./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:19:18,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:19:18,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:19:18,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:19:18,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:19:18,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:19:18,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:19:18,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:19:18,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:19:18,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:19:18,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:19:18,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:19:18,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:19:18,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:19:18,662 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:19:18,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:19:18,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:19:18,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:19:18,665 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:18,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:18,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:19:18,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:19:18,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:19:18,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2025-01-09 04:19:18,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:19:18,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:19:18,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:19:18,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:19:18,907 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:19:18,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-01-09 04:19:20,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfe1330a0/b5bec5df8b224684bbb3867b38bc2dfd/FLAG28065a45e [2025-01-09 04:19:20,323 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:19:20,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-01-09 04:19:20,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfe1330a0/b5bec5df8b224684bbb3867b38bc2dfd/FLAG28065a45e [2025-01-09 04:19:20,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfe1330a0/b5bec5df8b224684bbb3867b38bc2dfd [2025-01-09 04:19:20,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:19:20,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:19:20,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:19:20,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:19:20,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:19:20,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5ee2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20, skipping insertion in model container [2025-01-09 04:19:20,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:19:20,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2025-01-09 04:19:20,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:20,815 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:19:20,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2025-01-09 04:19:20,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:19:20,900 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:19:20,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20 WrapperNode [2025-01-09 04:19:20,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:19:20,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:20,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:19:20,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:19:20,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,953 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 421 [2025-01-09 04:19:20,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:19:20,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:19:20,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:19:20,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:19:20,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,989 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:19:20,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:20,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:21,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:21,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:19:21,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:19:21,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:19:21,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:19:21,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (1/1) ... [2025-01-09 04:19:21,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:19:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:21,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:19:21,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:19:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:19:21,066 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-01-09 04:19:21,067 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-01-09 04:19:21,067 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:19:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:19:21,068 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-01-09 04:19:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-01-09 04:19:21,068 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-01-09 04:19:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-01-09 04:19:21,068 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-01-09 04:19:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-01-09 04:19:21,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:19:21,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:19:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:19:21,153 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:19:21,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:19:21,528 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-01-09 04:19:21,529 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:19:21,537 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:19:21,538 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:19:21,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:21 BoogieIcfgContainer [2025-01-09 04:19:21,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:19:21,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:19:21,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:19:21,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:19:21,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:19:20" (1/3) ... [2025-01-09 04:19:21,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556fb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:21, skipping insertion in model container [2025-01-09 04:19:21,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:20" (2/3) ... [2025-01-09 04:19:21,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556fb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:21, skipping insertion in model container [2025-01-09 04:19:21,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:21" (3/3) ... [2025-01-09 04:19:21,545 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-01-09 04:19:21,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:19:21,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c that has 6 procedures, 172 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:19:21,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:19:21,610 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e97af21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:19:21,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:19:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 133 states have (on average 1.593984962406015) internal successors, (212), 137 states have internal predecessors, (212), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 04:19:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 04:19:21,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:21,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:21,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1955034029, now seen corresponding path program 1 times [2025-01-09 04:19:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839000579] [2025-01-09 04:19:21,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 04:19:21,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 04:19:21,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:21,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:21,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839000579] [2025-01-09 04:19:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839000579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:21,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420407674] [2025-01-09 04:19:21,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:21,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:21,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:21,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:21,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:21,915 INFO L87 Difference]: Start difference. First operand has 172 states, 133 states have (on average 1.593984962406015) internal successors, (212), 137 states have internal predecessors, (212), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,034 INFO L93 Difference]: Finished difference Result 347 states and 588 transitions. [2025-01-09 04:19:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 04:19:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,045 INFO L225 Difference]: With dead ends: 347 [2025-01-09 04:19:22,046 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 04:19:22,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:22,055 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 7 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 782 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 04:19:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-09 04:19:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.5441176470588236) internal successors, (210), 139 states have internal predecessors, (210), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 04:19:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 274 transitions. [2025-01-09 04:19:22,106 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 274 transitions. Word has length 15 [2025-01-09 04:19:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,107 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 274 transitions. [2025-01-09 04:19:22,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 274 transitions. [2025-01-09 04:19:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 04:19:22,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:19:22,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:22,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash 139689861, now seen corresponding path program 1 times [2025-01-09 04:19:22,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907186052] [2025-01-09 04:19:22,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:22,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 04:19:22,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 04:19:22,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:22,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907186052] [2025-01-09 04:19:22,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907186052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:22,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248745735] [2025-01-09 04:19:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:22,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:22,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:22,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:22,205 INFO L87 Difference]: Start difference. First operand 175 states and 274 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,269 INFO L93 Difference]: Finished difference Result 361 states and 569 transitions. [2025-01-09 04:19:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 04:19:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,272 INFO L225 Difference]: With dead ends: 361 [2025-01-09 04:19:22,272 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 04:19:22,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:22,274 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 22 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 791 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 04:19:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-01-09 04:19:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 149 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 289 transitions. [2025-01-09 04:19:22,289 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 289 transitions. Word has length 16 [2025-01-09 04:19:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,290 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 289 transitions. [2025-01-09 04:19:22,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:19:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 289 transitions. [2025-01-09 04:19:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 04:19:22,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:19:22,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash -905024323, now seen corresponding path program 1 times [2025-01-09 04:19:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:22,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749817090] [2025-01-09 04:19:22,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:22,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 04:19:22,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 04:19:22,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749817090] [2025-01-09 04:19:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749817090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447544043] [2025-01-09 04:19:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:22,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:22,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:22,372 INFO L87 Difference]: Start difference. First operand 187 states and 289 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,389 INFO L93 Difference]: Finished difference Result 393 states and 615 transitions. [2025-01-09 04:19:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:22,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-09 04:19:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,391 INFO L225 Difference]: With dead ends: 393 [2025-01-09 04:19:22,391 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 04:19:22,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:22,392 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 22 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 534 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:22,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 04:19:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-01-09 04:19:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 151 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 291 transitions. [2025-01-09 04:19:22,431 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 291 transitions. Word has length 22 [2025-01-09 04:19:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,431 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 291 transitions. [2025-01-09 04:19:22,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:19:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 291 transitions. [2025-01-09 04:19:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 04:19:22,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:19:22,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:22,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -341911756, now seen corresponding path program 1 times [2025-01-09 04:19:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:22,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352288483] [2025-01-09 04:19:22,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:22,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 04:19:22,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 04:19:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:22,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352288483] [2025-01-09 04:19:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352288483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:22,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928321806] [2025-01-09 04:19:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:22,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:22,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:22,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:22,497 INFO L87 Difference]: Start difference. First operand 189 states and 291 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,531 INFO L93 Difference]: Finished difference Result 425 states and 670 transitions. [2025-01-09 04:19:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-09 04:19:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,533 INFO L225 Difference]: With dead ends: 425 [2025-01-09 04:19:22,533 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 04:19:22,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:22,534 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 117 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 783 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 04:19:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 189. [2025-01-09 04:19:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 151 states have internal predecessors, (221), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 287 transitions. [2025-01-09 04:19:22,545 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 287 transitions. Word has length 31 [2025-01-09 04:19:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,546 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 287 transitions. [2025-01-09 04:19:22,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 287 transitions. [2025-01-09 04:19:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 04:19:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:19:22,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:22,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1130911465, now seen corresponding path program 1 times [2025-01-09 04:19:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823528295] [2025-01-09 04:19:22,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:22,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 04:19:22,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 04:19:22,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:22,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823528295] [2025-01-09 04:19:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823528295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:22,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:22,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:22,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855495291] [2025-01-09 04:19:22,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:22,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:22,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:22,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:22,614 INFO L87 Difference]: Start difference. First operand 189 states and 287 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,640 INFO L93 Difference]: Finished difference Result 369 states and 564 transitions. [2025-01-09 04:19:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:22,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 04:19:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,642 INFO L225 Difference]: With dead ends: 369 [2025-01-09 04:19:22,642 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 04:19:22,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:22,643 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1042 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 04:19:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2025-01-09 04:19:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.4864864864864864) internal successors, (220), 151 states have internal predecessors, (220), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 04:19:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 286 transitions. [2025-01-09 04:19:22,653 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 286 transitions. Word has length 32 [2025-01-09 04:19:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,653 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 286 transitions. [2025-01-09 04:19:22,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2025-01-09 04:19:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 04:19:22,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:19:22,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:22,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1513268134, now seen corresponding path program 1 times [2025-01-09 04:19:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:22,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621187835] [2025-01-09 04:19:22,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:22,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:19:22,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:19:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:22,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621187835] [2025-01-09 04:19:22,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621187835] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:22,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489127170] [2025-01-09 04:19:22,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:22,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:22,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:22,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:19:22,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:19:22,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:19:22,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:22,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:22,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:22,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:22,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:19:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489127170] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:22,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 04:19:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921093044] [2025-01-09 04:19:22,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:22,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:22,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:22,883 INFO L87 Difference]: Start difference. First operand 189 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:19:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:22,923 INFO L93 Difference]: Finished difference Result 426 states and 659 transitions. [2025-01-09 04:19:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-01-09 04:19:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:22,925 INFO L225 Difference]: With dead ends: 426 [2025-01-09 04:19:22,925 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 04:19:22,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:22,926 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 73 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:22,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 803 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 04:19:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2025-01-09 04:19:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 191 states have (on average 1.4607329842931938) internal successors, (279), 194 states have internal predecessors, (279), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 04:19:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 365 transitions. [2025-01-09 04:19:22,938 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 365 transitions. Word has length 34 [2025-01-09 04:19:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:22,939 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 365 transitions. [2025-01-09 04:19:22,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:19:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2025-01-09 04:19:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:22,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:22,940 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:22,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:19:23,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:23,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:23,143 INFO L85 PathProgramCache]: Analyzing trace with hash -542388262, now seen corresponding path program 2 times [2025-01-09 04:19:23,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:23,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28900371] [2025-01-09 04:19:23,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:19:23,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:23,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 04:19:23,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-01-09 04:19:23,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 04:19:23,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 04:19:23,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:23,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28900371] [2025-01-09 04:19:23,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28900371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:23,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807008859] [2025-01-09 04:19:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:23,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:23,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:23,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:23,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:23,245 INFO L87 Difference]: Start difference. First operand 242 states and 365 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:23,310 INFO L93 Difference]: Finished difference Result 463 states and 715 transitions. [2025-01-09 04:19:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:23,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-01-09 04:19:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:23,313 INFO L225 Difference]: With dead ends: 463 [2025-01-09 04:19:23,313 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 04:19:23,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:23,315 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 8 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:23,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 763 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 04:19:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-01-09 04:19:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 200 states have internal predecessors, (287), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 04:19:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 373 transitions. [2025-01-09 04:19:23,329 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 373 transitions. Word has length 56 [2025-01-09 04:19:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:23,329 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 373 transitions. [2025-01-09 04:19:23,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 373 transitions. [2025-01-09 04:19:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:19:23,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:23,330 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:23,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:19:23,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:23,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash 746721161, now seen corresponding path program 1 times [2025-01-09 04:19:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67526055] [2025-01-09 04:19:23,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:23,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:19:23,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:19:23,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:23,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 04:19:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67526055] [2025-01-09 04:19:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67526055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915959608] [2025-01-09 04:19:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:23,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:23,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:23,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:23,426 INFO L87 Difference]: Start difference. First operand 249 states and 373 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:23,459 INFO L93 Difference]: Finished difference Result 507 states and 771 transitions. [2025-01-09 04:19:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-01-09 04:19:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:23,461 INFO L225 Difference]: With dead ends: 507 [2025-01-09 04:19:23,461 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 04:19:23,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:23,463 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 22 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:23,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 778 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 04:19:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-01-09 04:19:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 231 states have internal predecessors, (323), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 04:19:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 415 transitions. [2025-01-09 04:19:23,473 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 415 transitions. Word has length 56 [2025-01-09 04:19:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:23,473 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 415 transitions. [2025-01-09 04:19:23,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:19:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 415 transitions. [2025-01-09 04:19:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:19:23,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:23,474 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:23,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:19:23,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:23,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1173747937, now seen corresponding path program 1 times [2025-01-09 04:19:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:23,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304714066] [2025-01-09 04:19:23,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:23,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:23,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:19:23,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:19:23,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:23,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 04:19:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304714066] [2025-01-09 04:19:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304714066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128463421] [2025-01-09 04:19:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:23,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:23,553 INFO L87 Difference]: Start difference. First operand 284 states and 415 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:23,577 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2025-01-09 04:19:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2025-01-09 04:19:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:23,579 INFO L225 Difference]: With dead ends: 519 [2025-01-09 04:19:23,579 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 04:19:23,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:23,581 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:23,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1041 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 04:19:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-01-09 04:19:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 231 states have internal predecessors, (320), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 04:19:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions. [2025-01-09 04:19:23,602 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 412 transitions. Word has length 74 [2025-01-09 04:19:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:23,603 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 412 transitions. [2025-01-09 04:19:23,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2025-01-09 04:19:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:19:23,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:23,604 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:23,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:19:23,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:23,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash 647857124, now seen corresponding path program 1 times [2025-01-09 04:19:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:23,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656010281] [2025-01-09 04:19:23,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:19:23,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:19:23,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:23,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-09 04:19:23,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656010281] [2025-01-09 04:19:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656010281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203009616] [2025-01-09 04:19:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:23,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:23,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:23,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:23,785 INFO L87 Difference]: Start difference. First operand 284 states and 412 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:23,844 INFO L93 Difference]: Finished difference Result 554 states and 825 transitions. [2025-01-09 04:19:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:23,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-01-09 04:19:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:23,848 INFO L225 Difference]: With dead ends: 554 [2025-01-09 04:19:23,848 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 04:19:23,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:23,851 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 23 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:23,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 778 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 04:19:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2025-01-09 04:19:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 264 states have (on average 1.3674242424242424) internal successors, (361), 267 states have internal predecessors, (361), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 04:19:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 459 transitions. [2025-01-09 04:19:23,880 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 459 transitions. Word has length 102 [2025-01-09 04:19:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:23,881 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 459 transitions. [2025-01-09 04:19:23,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 459 transitions. [2025-01-09 04:19:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:19:23,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:23,883 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:23,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:19:23,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:23,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash 170629142, now seen corresponding path program 1 times [2025-01-09 04:19:23,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:23,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451229852] [2025-01-09 04:19:23,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:23,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:19:23,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:19:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 04:19:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451229852] [2025-01-09 04:19:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451229852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221890149] [2025-01-09 04:19:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:23,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:23,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:23,996 INFO L87 Difference]: Start difference. First operand 324 states and 459 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:24,051 INFO L93 Difference]: Finished difference Result 580 states and 845 transitions. [2025-01-09 04:19:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-01-09 04:19:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:24,055 INFO L225 Difference]: With dead ends: 580 [2025-01-09 04:19:24,055 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 04:19:24,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,057 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 9 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:24,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 746 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 04:19:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-01-09 04:19:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 259 states have (on average 1.3474903474903475) internal successors, (349), 262 states have internal predecessors, (349), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 04:19:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2025-01-09 04:19:24,100 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 103 [2025-01-09 04:19:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,100 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2025-01-09 04:19:24,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 04:19:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2025-01-09 04:19:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:19:24,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,101 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:24,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:19:24,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1316376755, now seen corresponding path program 1 times [2025-01-09 04:19:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351879014] [2025-01-09 04:19:24,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:19:24,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:19:24,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-01-09 04:19:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351879014] [2025-01-09 04:19:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351879014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210651846] [2025-01-09 04:19:24,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:24,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:24,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:24,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,239 INFO L87 Difference]: Start difference. First operand 318 states and 445 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:24,271 INFO L93 Difference]: Finished difference Result 556 states and 795 transitions. [2025-01-09 04:19:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:24,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 122 [2025-01-09 04:19:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:24,275 INFO L225 Difference]: With dead ends: 556 [2025-01-09 04:19:24,275 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 04:19:24,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,277 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:24,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1025 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 04:19:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2025-01-09 04:19:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 259 states have (on average 1.335907335907336) internal successors, (346), 262 states have internal predecessors, (346), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 04:19:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 442 transitions. [2025-01-09 04:19:24,296 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 442 transitions. Word has length 122 [2025-01-09 04:19:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,299 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 442 transitions. [2025-01-09 04:19:24,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 442 transitions. [2025-01-09 04:19:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 04:19:24,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,301 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:24,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:19:24,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -793740496, now seen corresponding path program 1 times [2025-01-09 04:19:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207379479] [2025-01-09 04:19:24,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 04:19:24,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 04:19:24,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 04:19:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207379479] [2025-01-09 04:19:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207379479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322137540] [2025-01-09 04:19:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:24,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:24,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:24,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:24,403 INFO L87 Difference]: Start difference. First operand 318 states and 442 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:24,456 INFO L93 Difference]: Finished difference Result 519 states and 755 transitions. [2025-01-09 04:19:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-01-09 04:19:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:24,459 INFO L225 Difference]: With dead ends: 519 [2025-01-09 04:19:24,459 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 04:19:24,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,461 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 7 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:24,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 714 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 04:19:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-01-09 04:19:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 258 states have (on average 1.3333333333333333) internal successors, (344), 261 states have internal predecessors, (344), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 04:19:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 438 transitions. [2025-01-09 04:19:24,496 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 438 transitions. Word has length 154 [2025-01-09 04:19:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,497 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 438 transitions. [2025-01-09 04:19:24,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:19:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 438 transitions. [2025-01-09 04:19:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 04:19:24,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,501 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:19:24,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1084675184, now seen corresponding path program 1 times [2025-01-09 04:19:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774815540] [2025-01-09 04:19:24,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 04:19:24,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 04:19:24,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-01-09 04:19:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774815540] [2025-01-09 04:19:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774815540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:24,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:24,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170314515] [2025-01-09 04:19:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:24,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:24,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:24,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:24,625 INFO L87 Difference]: Start difference. First operand 316 states and 438 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:24,677 INFO L93 Difference]: Finished difference Result 459 states and 651 transitions. [2025-01-09 04:19:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 169 [2025-01-09 04:19:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:24,680 INFO L225 Difference]: With dead ends: 459 [2025-01-09 04:19:24,680 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 04:19:24,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,681 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 32 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:24,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 691 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 04:19:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-01-09 04:19:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 244 states have (on average 1.3237704918032787) internal successors, (323), 247 states have internal predecessors, (323), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 04:19:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 411 transitions. [2025-01-09 04:19:24,697 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 411 transitions. Word has length 169 [2025-01-09 04:19:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,697 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 411 transitions. [2025-01-09 04:19:24,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 411 transitions. [2025-01-09 04:19:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:19:24,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,701 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:24,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:19:24,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1635001066, now seen corresponding path program 1 times [2025-01-09 04:19:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838288261] [2025-01-09 04:19:24,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:19:24,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:19:24,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-01-09 04:19:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838288261] [2025-01-09 04:19:24,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838288261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:24,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:24,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000535508] [2025-01-09 04:19:24,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:24,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:24,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:24,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:24,841 INFO L87 Difference]: Start difference. First operand 299 states and 411 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:24,900 INFO L93 Difference]: Finished difference Result 442 states and 624 transitions. [2025-01-09 04:19:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:24,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 171 [2025-01-09 04:19:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:24,903 INFO L225 Difference]: With dead ends: 442 [2025-01-09 04:19:24,903 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 04:19:24,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:24,904 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 28 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:24,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 694 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 04:19:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-01-09 04:19:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 228 states have (on average 1.3157894736842106) internal successors, (300), 231 states have internal predecessors, (300), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 04:19:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 382 transitions. [2025-01-09 04:19:24,920 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 382 transitions. Word has length 171 [2025-01-09 04:19:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:24,920 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 382 transitions. [2025-01-09 04:19:24,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 04:19:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 382 transitions. [2025-01-09 04:19:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 04:19:24,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:24,923 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:24,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:19:24,923 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:24,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash -205857765, now seen corresponding path program 1 times [2025-01-09 04:19:24,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:24,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877511911] [2025-01-09 04:19:24,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:24,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:24,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 04:19:24,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 04:19:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 04:19:25,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:25,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877511911] [2025-01-09 04:19:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877511911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:25,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:25,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:19:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375936825] [2025-01-09 04:19:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:25,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:19:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:25,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:19:25,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:25,038 INFO L87 Difference]: Start difference. First operand 280 states and 382 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 04:19:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:25,062 INFO L93 Difference]: Finished difference Result 423 states and 595 transitions. [2025-01-09 04:19:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 172 [2025-01-09 04:19:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:25,065 INFO L225 Difference]: With dead ends: 423 [2025-01-09 04:19:25,065 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 04:19:25,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:25,065 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:25,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1003 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 04:19:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-01-09 04:19:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 228 states have (on average 1.2894736842105263) internal successors, (294), 231 states have internal predecessors, (294), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 04:19:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 376 transitions. [2025-01-09 04:19:25,079 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 376 transitions. Word has length 172 [2025-01-09 04:19:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:25,079 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 376 transitions. [2025-01-09 04:19:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 04:19:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 376 transitions. [2025-01-09 04:19:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 04:19:25,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:25,082 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:25,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:19:25,082 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:25,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash 198376473, now seen corresponding path program 1 times [2025-01-09 04:19:25,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:25,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381433634] [2025-01-09 04:19:25,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:25,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:25,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 04:19:25,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 04:19:25,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:25,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 04:19:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381433634] [2025-01-09 04:19:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381433634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086514574] [2025-01-09 04:19:25,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:25,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:25,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:19:25,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 04:19:25,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 04:19:25,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:25,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:25,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 04:19:25,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 04:19:25,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086514574] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:25,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:19:25,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-01-09 04:19:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340659695] [2025-01-09 04:19:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:25,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:25,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:25,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:25,555 INFO L87 Difference]: Start difference. First operand 280 states and 376 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:19:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:25,593 INFO L93 Difference]: Finished difference Result 443 states and 616 transitions. [2025-01-09 04:19:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 178 [2025-01-09 04:19:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:25,596 INFO L225 Difference]: With dead ends: 443 [2025-01-09 04:19:25,596 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 04:19:25,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:25,598 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 29 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:25,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 475 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 04:19:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-01-09 04:19:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 210 states have (on average 1.2809523809523808) internal successors, (269), 213 states have internal predecessors, (269), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 04:19:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 345 transitions. [2025-01-09 04:19:25,611 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 345 transitions. Word has length 178 [2025-01-09 04:19:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:25,611 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 345 transitions. [2025-01-09 04:19:25,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 04:19:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 345 transitions. [2025-01-09 04:19:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 04:19:25,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:25,612 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:25,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:25,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 04:19:25,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:25,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash 96910918, now seen corresponding path program 1 times [2025-01-09 04:19:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:25,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324693723] [2025-01-09 04:19:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:25,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 04:19:25,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 04:19:25,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:25,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-01-09 04:19:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:25,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324693723] [2025-01-09 04:19:25,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324693723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:25,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:25,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194544363] [2025-01-09 04:19:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:25,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:25,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:25,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:25,947 INFO L87 Difference]: Start difference. First operand 259 states and 345 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 04:19:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:25,978 INFO L93 Difference]: Finished difference Result 399 states and 556 transitions. [2025-01-09 04:19:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:25,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 202 [2025-01-09 04:19:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:25,981 INFO L225 Difference]: With dead ends: 399 [2025-01-09 04:19:25,982 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 04:19:25,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:25,983 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:25,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 734 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 04:19:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-01-09 04:19:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 213 states have (on average 1.2769953051643192) internal successors, (272), 216 states have internal predecessors, (272), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 04:19:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 348 transitions. [2025-01-09 04:19:25,999 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 348 transitions. Word has length 202 [2025-01-09 04:19:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:26,001 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 348 transitions. [2025-01-09 04:19:26,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 04:19:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 348 transitions. [2025-01-09 04:19:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:19:26,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:26,004 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:26,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:19:26,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1768069581, now seen corresponding path program 1 times [2025-01-09 04:19:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789539947] [2025-01-09 04:19:26,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:26,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:19:26,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:19:26,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:26,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-01-09 04:19:26,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:26,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789539947] [2025-01-09 04:19:26,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789539947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902879014] [2025-01-09 04:19:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:26,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:26,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:26,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:26,175 INFO L87 Difference]: Start difference. First operand 263 states and 348 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 04:19:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:26,211 INFO L93 Difference]: Finished difference Result 408 states and 564 transitions. [2025-01-09 04:19:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 209 [2025-01-09 04:19:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:26,213 INFO L225 Difference]: With dead ends: 408 [2025-01-09 04:19:26,213 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 04:19:26,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:26,214 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 4 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:26,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 736 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 04:19:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-01-09 04:19:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 217 states have (on average 1.271889400921659) internal successors, (276), 220 states have internal predecessors, (276), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 04:19:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 352 transitions. [2025-01-09 04:19:26,228 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 352 transitions. Word has length 209 [2025-01-09 04:19:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:26,230 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 352 transitions. [2025-01-09 04:19:26,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 04:19:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 352 transitions. [2025-01-09 04:19:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 04:19:26,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:26,232 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:26,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:19:26,233 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1522351614, now seen corresponding path program 1 times [2025-01-09 04:19:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935348542] [2025-01-09 04:19:26,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:26,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 04:19:26,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 04:19:26,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:26,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-01-09 04:19:26,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:26,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935348542] [2025-01-09 04:19:26,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935348542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:26,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:26,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227874977] [2025-01-09 04:19:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:26,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:26,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:26,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:26,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:26,366 INFO L87 Difference]: Start difference. First operand 268 states and 352 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:19:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:26,400 INFO L93 Difference]: Finished difference Result 412 states and 564 transitions. [2025-01-09 04:19:26,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:19:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 217 [2025-01-09 04:19:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:26,402 INFO L225 Difference]: With dead ends: 412 [2025-01-09 04:19:26,402 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 04:19:26,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:26,403 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:26,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 04:19:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-01-09 04:19:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 219 states have internal predecessors, (273), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 04:19:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 347 transitions. [2025-01-09 04:19:26,417 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 347 transitions. Word has length 217 [2025-01-09 04:19:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:26,417 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 347 transitions. [2025-01-09 04:19:26,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:19:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 347 transitions. [2025-01-09 04:19:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 04:19:26,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:26,420 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:26,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:19:26,420 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 271726527, now seen corresponding path program 1 times [2025-01-09 04:19:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033002905] [2025-01-09 04:19:26,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:26,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 04:19:26,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 04:19:26,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:26,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-01-09 04:19:26,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:26,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033002905] [2025-01-09 04:19:26,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033002905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:26,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247470893] [2025-01-09 04:19:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:26,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:26,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:26,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:26,579 INFO L87 Difference]: Start difference. First operand 267 states and 347 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 04:19:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:26,598 INFO L93 Difference]: Finished difference Result 410 states and 553 transitions. [2025-01-09 04:19:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:26,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 225 [2025-01-09 04:19:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:26,602 INFO L225 Difference]: With dead ends: 410 [2025-01-09 04:19:26,602 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 04:19:26,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:26,603 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:26,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 04:19:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-09 04:19:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 217 states have (on average 1.2534562211981566) internal successors, (272), 218 states have internal predecessors, (272), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 04:19:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 344 transitions. [2025-01-09 04:19:26,621 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 344 transitions. Word has length 225 [2025-01-09 04:19:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:26,621 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 344 transitions. [2025-01-09 04:19:26,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 04:19:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 344 transitions. [2025-01-09 04:19:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 04:19:26,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:26,623 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:26,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:19:26,623 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1098109153, now seen corresponding path program 1 times [2025-01-09 04:19:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269979029] [2025-01-09 04:19:26,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:26,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 04:19:26,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 04:19:26,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:26,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-01-09 04:19:26,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:26,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269979029] [2025-01-09 04:19:26,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269979029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:26,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:26,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921987869] [2025-01-09 04:19:26,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:26,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:26,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:26,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:26,861 INFO L87 Difference]: Start difference. First operand 266 states and 344 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 04:19:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:26,967 INFO L93 Difference]: Finished difference Result 615 states and 822 transitions. [2025-01-09 04:19:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:26,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 226 [2025-01-09 04:19:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:26,972 INFO L225 Difference]: With dead ends: 615 [2025-01-09 04:19:26,972 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 04:19:26,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:26,974 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 312 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:26,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 689 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 04:19:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 418. [2025-01-09 04:19:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 339 states have (on average 1.3008849557522124) internal successors, (441), 341 states have internal predecessors, (441), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 04:19:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 549 transitions. [2025-01-09 04:19:26,992 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 549 transitions. Word has length 226 [2025-01-09 04:19:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:26,993 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 549 transitions. [2025-01-09 04:19:26,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 04:19:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 549 transitions. [2025-01-09 04:19:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-09 04:19:26,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:26,995 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:26,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:19:26,995 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash -486373084, now seen corresponding path program 1 times [2025-01-09 04:19:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826804976] [2025-01-09 04:19:26,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:26,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:27,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 04:19:27,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 04:19:27,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:27,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 04:19:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826804976] [2025-01-09 04:19:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826804976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976868371] [2025-01-09 04:19:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:27,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:27,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:27,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:27,121 INFO L87 Difference]: Start difference. First operand 418 states and 549 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:27,155 INFO L93 Difference]: Finished difference Result 886 states and 1215 transitions. [2025-01-09 04:19:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 255 [2025-01-09 04:19:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:27,159 INFO L225 Difference]: With dead ends: 886 [2025-01-09 04:19:27,159 INFO L226 Difference]: Without dead ends: 659 [2025-01-09 04:19:27,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:27,161 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 167 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:27,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 504 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-01-09 04:19:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 497. [2025-01-09 04:19:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 408 states have (on average 1.3088235294117647) internal successors, (534), 411 states have internal predecessors, (534), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 04:19:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 652 transitions. [2025-01-09 04:19:27,185 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 652 transitions. Word has length 255 [2025-01-09 04:19:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:27,186 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 652 transitions. [2025-01-09 04:19:27,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 652 transitions. [2025-01-09 04:19:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 04:19:27,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:27,189 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:27,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:19:27,189 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:27,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:27,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1722423514, now seen corresponding path program 1 times [2025-01-09 04:19:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:27,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617569390] [2025-01-09 04:19:27,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:27,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:27,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 04:19:27,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 04:19:27,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:27,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 04:19:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617569390] [2025-01-09 04:19:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617569390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:27,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:27,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728526340] [2025-01-09 04:19:27,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:27,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:27,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:27,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:27,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:27,299 INFO L87 Difference]: Start difference. First operand 497 states and 652 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:27,341 INFO L93 Difference]: Finished difference Result 1057 states and 1440 transitions. [2025-01-09 04:19:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 256 [2025-01-09 04:19:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:27,346 INFO L225 Difference]: With dead ends: 1057 [2025-01-09 04:19:27,346 INFO L226 Difference]: Without dead ends: 780 [2025-01-09 04:19:27,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:27,348 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 169 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:27,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 521 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-01-09 04:19:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 605. [2025-01-09 04:19:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 504 states have (on average 1.3174603174603174) internal successors, (664), 509 states have internal predecessors, (664), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 04:19:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 794 transitions. [2025-01-09 04:19:27,380 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 794 transitions. Word has length 256 [2025-01-09 04:19:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:27,380 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 794 transitions. [2025-01-09 04:19:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:19:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 794 transitions. [2025-01-09 04:19:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-09 04:19:27,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:27,383 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:27,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:19:27,384 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:27,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash 15056703, now seen corresponding path program 1 times [2025-01-09 04:19:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365568243] [2025-01-09 04:19:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-09 04:19:27,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 04:19:27,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:27,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 04:19:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:27,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365568243] [2025-01-09 04:19:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365568243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281472945] [2025-01-09 04:19:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:27,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:27,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:27,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:27,484 INFO L87 Difference]: Start difference. First operand 605 states and 794 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:27,529 INFO L93 Difference]: Finished difference Result 1267 states and 1722 transitions. [2025-01-09 04:19:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:27,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 257 [2025-01-09 04:19:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:27,534 INFO L225 Difference]: With dead ends: 1267 [2025-01-09 04:19:27,534 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 04:19:27,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:27,535 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 170 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:27,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 537 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 04:19:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 711. [2025-01-09 04:19:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 602 states have (on average 1.3289036544850499) internal successors, (800), 611 states have internal predecessors, (800), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 938 transitions. [2025-01-09 04:19:27,574 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 938 transitions. Word has length 257 [2025-01-09 04:19:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:27,574 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 938 transitions. [2025-01-09 04:19:27,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 938 transitions. [2025-01-09 04:19:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-01-09 04:19:27,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:27,577 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:27,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:19:27,577 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:27,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash 289816317, now seen corresponding path program 1 times [2025-01-09 04:19:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:27,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410164760] [2025-01-09 04:19:27,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:27,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:27,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-09 04:19:27,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 04:19:27,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:27,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-01-09 04:19:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410164760] [2025-01-09 04:19:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410164760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352290679] [2025-01-09 04:19:27,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:27,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:27,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:27,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:27,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:19:27,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-09 04:19:28,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-09 04:19:28,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:28,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:28,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:28,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 04:19:28,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:28,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352290679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:28,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:28,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 04:19:28,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713195079] [2025-01-09 04:19:28,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:28,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:28,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:28,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:28,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:19:28,061 INFO L87 Difference]: Start difference. First operand 711 states and 938 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:28,151 INFO L93 Difference]: Finished difference Result 1174 states and 1586 transitions. [2025-01-09 04:19:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:28,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 257 [2025-01-09 04:19:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:28,155 INFO L225 Difference]: With dead ends: 1174 [2025-01-09 04:19:28,155 INFO L226 Difference]: Without dead ends: 711 [2025-01-09 04:19:28,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:19:28,156 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 31 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:28,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 661 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-01-09 04:19:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2025-01-09 04:19:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 602 states have (on average 1.318936877076412) internal successors, (794), 611 states have internal predecessors, (794), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 932 transitions. [2025-01-09 04:19:28,193 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 932 transitions. Word has length 257 [2025-01-09 04:19:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:28,193 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 932 transitions. [2025-01-09 04:19:28,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 932 transitions. [2025-01-09 04:19:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-01-09 04:19:28,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:28,196 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:28,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:28,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:28,398 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:28,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2030811476, now seen corresponding path program 1 times [2025-01-09 04:19:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132262185] [2025-01-09 04:19:28,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:28,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-01-09 04:19:28,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-01-09 04:19:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2025-01-09 04:19:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132262185] [2025-01-09 04:19:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132262185] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281948836] [2025-01-09 04:19:28,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:28,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:28,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:28,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:19:28,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-01-09 04:19:28,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-01-09 04:19:28,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:28,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:28,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:19:28,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-01-09 04:19:28,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:28,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281948836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:28,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:28,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 04:19:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856528887] [2025-01-09 04:19:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:28,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:28,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:28,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:19:28,951 INFO L87 Difference]: Start difference. First operand 711 states and 932 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:29,104 INFO L93 Difference]: Finished difference Result 1174 states and 1572 transitions. [2025-01-09 04:19:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:29,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 258 [2025-01-09 04:19:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:29,110 INFO L225 Difference]: With dead ends: 1174 [2025-01-09 04:19:29,110 INFO L226 Difference]: Without dead ends: 723 [2025-01-09 04:19:29,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:19:29,111 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 7 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:29,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 669 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-01-09 04:19:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2025-01-09 04:19:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 612 states have (on average 1.3202614379084967) internal successors, (808), 621 states have internal predecessors, (808), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 946 transitions. [2025-01-09 04:19:29,147 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 946 transitions. Word has length 258 [2025-01-09 04:19:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:29,148 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 946 transitions. [2025-01-09 04:19:29,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 946 transitions. [2025-01-09 04:19:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-09 04:19:29,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:29,151 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:29,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:19:29,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 04:19:29,352 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:29,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash 930522711, now seen corresponding path program 1 times [2025-01-09 04:19:29,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:29,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393333421] [2025-01-09 04:19:29,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:29,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:29,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-09 04:19:29,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-09 04:19:29,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 04:19:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393333421] [2025-01-09 04:19:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393333421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:29,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:19:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983541987] [2025-01-09 04:19:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:29,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:19:29,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:29,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:19:29,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:29,566 INFO L87 Difference]: Start difference. First operand 723 states and 946 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:29,591 INFO L93 Difference]: Finished difference Result 1188 states and 1586 transitions. [2025-01-09 04:19:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:19:29,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 259 [2025-01-09 04:19:29,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:29,595 INFO L225 Difference]: With dead ends: 1188 [2025-01-09 04:19:29,595 INFO L226 Difference]: Without dead ends: 703 [2025-01-09 04:19:29,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:19:29,596 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:29,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-01-09 04:19:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2025-01-09 04:19:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 593 states have (on average 1.3052276559865092) internal successors, (774), 601 states have internal predecessors, (774), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 04:19:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 911 transitions. [2025-01-09 04:19:29,621 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 911 transitions. Word has length 259 [2025-01-09 04:19:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:29,621 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 911 transitions. [2025-01-09 04:19:29,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 04:19:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 911 transitions. [2025-01-09 04:19:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 04:19:29,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:29,623 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:29,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:19:29,623 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:29,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2098562313, now seen corresponding path program 1 times [2025-01-09 04:19:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:29,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925593651] [2025-01-09 04:19:29,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:29,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 04:19:29,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 04:19:29,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:29,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-01-09 04:19:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:29,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925593651] [2025-01-09 04:19:29,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925593651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:29,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:29,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:19:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45908010] [2025-01-09 04:19:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:29,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:29,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:29,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:29,926 INFO L87 Difference]: Start difference. First operand 703 states and 911 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 04:19:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:29,990 INFO L93 Difference]: Finished difference Result 1016 states and 1388 transitions. [2025-01-09 04:19:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:19:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 260 [2025-01-09 04:19:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:29,995 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 04:19:29,995 INFO L226 Difference]: Without dead ends: 1014 [2025-01-09 04:19:29,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:29,996 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 118 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:29,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1725 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-01-09 04:19:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 709. [2025-01-09 04:19:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 597 states have (on average 1.3031825795644891) internal successors, (778), 606 states have internal predecessors, (778), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 04:19:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 917 transitions. [2025-01-09 04:19:30,026 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 917 transitions. Word has length 260 [2025-01-09 04:19:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:30,026 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 917 transitions. [2025-01-09 04:19:30,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 04:19:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 917 transitions. [2025-01-09 04:19:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-01-09 04:19:30,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:30,029 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:30,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:19:30,029 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:30,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1811663985, now seen corresponding path program 1 times [2025-01-09 04:19:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913140819] [2025-01-09 04:19:30,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:30,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 04:19:30,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 04:19:30,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:30,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 04:19:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913140819] [2025-01-09 04:19:30,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913140819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296401770] [2025-01-09 04:19:30,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:30,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:30,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:30,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:19:30,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 04:19:30,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 04:19:30,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:30,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:30,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 04:19:30,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 248 proven. 33 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-01-09 04:19:30,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 04:19:31,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296401770] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:31,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:31,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-01-09 04:19:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580120072] [2025-01-09 04:19:31,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:31,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 04:19:31,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:31,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 04:19:31,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:19:31,089 INFO L87 Difference]: Start difference. First operand 709 states and 917 transitions. Second operand has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-01-09 04:19:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:31,482 INFO L93 Difference]: Finished difference Result 1704 states and 2281 transitions. [2025-01-09 04:19:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:19:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 268 [2025-01-09 04:19:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:31,489 INFO L225 Difference]: With dead ends: 1704 [2025-01-09 04:19:31,489 INFO L226 Difference]: Without dead ends: 1253 [2025-01-09 04:19:31,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 527 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:19:31,490 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 267 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:31,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 3854 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:19:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-01-09 04:19:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 983. [2025-01-09 04:19:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 831 states have (on average 1.2936221419975933) internal successors, (1075), 841 states have internal predecessors, (1075), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2025-01-09 04:19:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1267 transitions. [2025-01-09 04:19:31,531 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1267 transitions. Word has length 268 [2025-01-09 04:19:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:31,531 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1267 transitions. [2025-01-09 04:19:31,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-01-09 04:19:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1267 transitions. [2025-01-09 04:19:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-01-09 04:19:31,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:31,534 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:31,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:31,734 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:31,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:31,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1521689294, now seen corresponding path program 1 times [2025-01-09 04:19:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:31,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269923515] [2025-01-09 04:19:31,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:31,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 04:19:31,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 04:19:31,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-01-09 04:19:31,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269923515] [2025-01-09 04:19:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269923515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924220567] [2025-01-09 04:19:31,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:31,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:31,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:31,861 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:31,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:19:31,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 04:19:32,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 04:19:32,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:32,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:32,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:32,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-01-09 04:19:32,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924220567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:32,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:32,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 04:19:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498816703] [2025-01-09 04:19:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:32,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:32,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:32,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:32,094 INFO L87 Difference]: Start difference. First operand 983 states and 1267 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 04:19:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:32,173 INFO L93 Difference]: Finished difference Result 1832 states and 2401 transitions. [2025-01-09 04:19:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:32,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 268 [2025-01-09 04:19:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:32,178 INFO L225 Difference]: With dead ends: 1832 [2025-01-09 04:19:32,178 INFO L226 Difference]: Without dead ends: 967 [2025-01-09 04:19:32,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:32,181 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 4 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:32,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 666 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-01-09 04:19:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2025-01-09 04:19:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 820 states have (on average 1.2817073170731708) internal successors, (1051), 830 states have internal predecessors, (1051), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2025-01-09 04:19:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1234 transitions. [2025-01-09 04:19:32,224 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1234 transitions. Word has length 268 [2025-01-09 04:19:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:32,224 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1234 transitions. [2025-01-09 04:19:32,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 04:19:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1234 transitions. [2025-01-09 04:19:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 04:19:32,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:32,227 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:32,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 04:19:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-09 04:19:32,431 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 722832789, now seen corresponding path program 1 times [2025-01-09 04:19:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305833348] [2025-01-09 04:19:32,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:32,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 04:19:32,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 04:19:32,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:32,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-01-09 04:19:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305833348] [2025-01-09 04:19:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305833348] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512452596] [2025-01-09 04:19:32,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:32,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:32,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:32,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:19:32,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 04:19:32,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 04:19:32,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:32,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:32,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:19:32,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 04:19:32,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512452596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:32,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:32,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-01-09 04:19:32,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839890678] [2025-01-09 04:19:32,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:32,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:32,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:32,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:32,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:32,739 INFO L87 Difference]: Start difference. First operand 967 states and 1234 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:32,822 INFO L93 Difference]: Finished difference Result 1681 states and 2186 transitions. [2025-01-09 04:19:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 271 [2025-01-09 04:19:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:32,828 INFO L225 Difference]: With dead ends: 1681 [2025-01-09 04:19:32,828 INFO L226 Difference]: Without dead ends: 823 [2025-01-09 04:19:32,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:32,832 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:32,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 694 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:32,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-01-09 04:19:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2025-01-09 04:19:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 694 states have (on average 1.280979827089337) internal successors, (889), 704 states have internal predecessors, (889), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 04:19:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1050 transitions. [2025-01-09 04:19:32,880 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1050 transitions. Word has length 271 [2025-01-09 04:19:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:32,881 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1050 transitions. [2025-01-09 04:19:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 04:19:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1050 transitions. [2025-01-09 04:19:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-01-09 04:19:32,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:32,885 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:32,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 04:19:33,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:33,086 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:33,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1427599382, now seen corresponding path program 1 times [2025-01-09 04:19:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398939304] [2025-01-09 04:19:33,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:33,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:33,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 04:19:33,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 04:19:33,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:33,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2025-01-09 04:19:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398939304] [2025-01-09 04:19:33,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398939304] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566887922] [2025-01-09 04:19:33,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:33,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:33,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 04:19:33,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 04:19:33,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 04:19:33,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:33,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:33,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 04:19:33,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 04:19:33,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566887922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-01-09 04:19:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053410571] [2025-01-09 04:19:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:33,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:19:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:33,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:19:33,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:19:33,766 INFO L87 Difference]: Start difference. First operand 823 states and 1050 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:34,301 INFO L93 Difference]: Finished difference Result 2208 states and 2827 transitions. [2025-01-09 04:19:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:19:34,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 283 [2025-01-09 04:19:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:34,309 INFO L225 Difference]: With dead ends: 2208 [2025-01-09 04:19:34,309 INFO L226 Difference]: Without dead ends: 1750 [2025-01-09 04:19:34,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:19:34,311 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 615 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:34,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2741 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:19:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2025-01-09 04:19:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1384. [2025-01-09 04:19:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1157 states have (on average 1.2618841832324978) internal successors, (1460), 1172 states have internal predecessors, (1460), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2025-01-09 04:19:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1757 transitions. [2025-01-09 04:19:34,372 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1757 transitions. Word has length 283 [2025-01-09 04:19:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:34,373 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1757 transitions. [2025-01-09 04:19:34,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1757 transitions. [2025-01-09 04:19:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-09 04:19:34,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:34,375 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:34,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 04:19:34,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:34,576 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2106052313, now seen corresponding path program 1 times [2025-01-09 04:19:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543189504] [2025-01-09 04:19:34,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:34,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 04:19:34,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 04:19:34,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:34,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-01-09 04:19:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:34,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543189504] [2025-01-09 04:19:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543189504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:34,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:19:34,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609822846] [2025-01-09 04:19:34,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:34,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:19:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:34,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:19:34,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:34,713 INFO L87 Difference]: Start difference. First operand 1384 states and 1757 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:34,795 INFO L93 Difference]: Finished difference Result 2553 states and 3330 transitions. [2025-01-09 04:19:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:19:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 289 [2025-01-09 04:19:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:34,801 INFO L225 Difference]: With dead ends: 2553 [2025-01-09 04:19:34,802 INFO L226 Difference]: Without dead ends: 1519 [2025-01-09 04:19:34,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:19:34,804 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 32 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:34,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1196 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-01-09 04:19:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1477. [2025-01-09 04:19:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1229 states have (on average 1.273393002441009) internal successors, (1565), 1244 states have internal predecessors, (1565), 170 states have call successors, (170), 78 states have call predecessors, (170), 77 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 04:19:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1904 transitions. [2025-01-09 04:19:34,862 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1904 transitions. Word has length 289 [2025-01-09 04:19:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:34,862 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 1904 transitions. [2025-01-09 04:19:34,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1904 transitions. [2025-01-09 04:19:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-09 04:19:34,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:34,865 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:34,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:19:34,865 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash 358500003, now seen corresponding path program 1 times [2025-01-09 04:19:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:34,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90775628] [2025-01-09 04:19:34,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:34,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 04:19:34,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 04:19:34,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:34,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-01-09 04:19:35,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90775628] [2025-01-09 04:19:35,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90775628] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401071299] [2025-01-09 04:19:35,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:35,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:35,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:35,199 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:35,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 04:19:35,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 04:19:35,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 04:19:35,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:35,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:35,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:19:35,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-01-09 04:19:35,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401071299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:35,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:35,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-01-09 04:19:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405668191] [2025-01-09 04:19:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:35,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:19:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:35,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:19:35,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:19:35,677 INFO L87 Difference]: Start difference. First operand 1477 states and 1904 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 04:19:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:36,145 INFO L93 Difference]: Finished difference Result 3081 states and 3993 transitions. [2025-01-09 04:19:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:19:36,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 289 [2025-01-09 04:19:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:36,156 INFO L225 Difference]: With dead ends: 3081 [2025-01-09 04:19:36,156 INFO L226 Difference]: Without dead ends: 1961 [2025-01-09 04:19:36,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:19:36,160 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 122 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:36,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1822 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:19:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-01-09 04:19:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1711. [2025-01-09 04:19:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1426 states have (on average 1.2643758765778401) internal successors, (1803), 1443 states have internal predecessors, (1803), 197 states have call successors, (197), 88 states have call predecessors, (197), 87 states have return successors, (196), 186 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 04:19:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2196 transitions. [2025-01-09 04:19:36,290 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2196 transitions. Word has length 289 [2025-01-09 04:19:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:36,290 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2196 transitions. [2025-01-09 04:19:36,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 04:19:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2196 transitions. [2025-01-09 04:19:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-09 04:19:36,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:36,293 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:36,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 04:19:36,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:36,497 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:36,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1033833123, now seen corresponding path program 1 times [2025-01-09 04:19:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263295427] [2025-01-09 04:19:36,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:36,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 04:19:36,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 04:19:36,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:36,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-01-09 04:19:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263295427] [2025-01-09 04:19:37,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263295427] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204053040] [2025-01-09 04:19:37,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:37,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:37,163 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:37,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 04:19:37,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 04:19:37,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 04:19:37,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:37,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:37,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 04:19:37,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-01-09 04:19:37,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:19:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204053040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:37,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:19:37,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2025-01-09 04:19:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258986331] [2025-01-09 04:19:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:37,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:19:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:37,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:19:37,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:37,523 INFO L87 Difference]: Start difference. First operand 1711 states and 2196 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:38,132 INFO L93 Difference]: Finished difference Result 3386 states and 4355 transitions. [2025-01-09 04:19:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:19:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 289 [2025-01-09 04:19:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:38,148 INFO L225 Difference]: With dead ends: 3386 [2025-01-09 04:19:38,149 INFO L226 Difference]: Without dead ends: 2099 [2025-01-09 04:19:38,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:19:38,156 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 601 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:38,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2570 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:19:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2025-01-09 04:19:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1678. [2025-01-09 04:19:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1403 states have (on average 1.2580185317177477) internal successors, (1765), 1420 states have internal predecessors, (1765), 187 states have call successors, (187), 88 states have call predecessors, (187), 87 states have return successors, (186), 176 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 04:19:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2138 transitions. [2025-01-09 04:19:38,226 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2138 transitions. Word has length 289 [2025-01-09 04:19:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:38,226 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2138 transitions. [2025-01-09 04:19:38,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 04:19:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2138 transitions. [2025-01-09 04:19:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-09 04:19:38,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:38,228 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:38,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 04:19:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 04:19:38,429 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:38,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1312440161, now seen corresponding path program 1 times [2025-01-09 04:19:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:38,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757062102] [2025-01-09 04:19:38,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:38,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 04:19:38,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 04:19:38,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:38,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-01-09 04:19:38,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:38,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757062102] [2025-01-09 04:19:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757062102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:38,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556232921] [2025-01-09 04:19:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:38,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:38,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:38,564 INFO L87 Difference]: Start difference. First operand 1678 states and 2138 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:38,775 INFO L93 Difference]: Finished difference Result 3007 states and 3867 transitions. [2025-01-09 04:19:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 289 [2025-01-09 04:19:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:38,783 INFO L225 Difference]: With dead ends: 3007 [2025-01-09 04:19:38,783 INFO L226 Difference]: Without dead ends: 1697 [2025-01-09 04:19:38,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:38,786 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 241 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:38,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 672 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:19:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-01-09 04:19:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1574. [2025-01-09 04:19:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1314 states have (on average 1.2587519025875191) internal successors, (1654), 1330 states have internal predecessors, (1654), 177 states have call successors, (177), 83 states have call predecessors, (177), 82 states have return successors, (176), 167 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 04:19:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2007 transitions. [2025-01-09 04:19:38,876 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2007 transitions. Word has length 289 [2025-01-09 04:19:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:38,876 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2007 transitions. [2025-01-09 04:19:38,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 04:19:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2007 transitions. [2025-01-09 04:19:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 04:19:38,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:38,878 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:38,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:19:38,878 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:38,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash -464206748, now seen corresponding path program 1 times [2025-01-09 04:19:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:38,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664387026] [2025-01-09 04:19:38,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:38,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 04:19:38,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 04:19:38,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:38,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-01-09 04:19:38,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:38,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664387026] [2025-01-09 04:19:38,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664387026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:38,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:38,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:38,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116458423] [2025-01-09 04:19:38,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:38,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:38,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:38,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:38,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:38,984 INFO L87 Difference]: Start difference. First operand 1574 states and 2007 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 04:19:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:39,184 INFO L93 Difference]: Finished difference Result 2733 states and 3513 transitions. [2025-01-09 04:19:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:39,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 296 [2025-01-09 04:19:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:39,192 INFO L225 Difference]: With dead ends: 2733 [2025-01-09 04:19:39,192 INFO L226 Difference]: Without dead ends: 1520 [2025-01-09 04:19:39,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:39,195 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 309 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:39,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1044 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-01-09 04:19:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1281. [2025-01-09 04:19:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1084 states have (on average 1.2370848708487086) internal successors, (1341), 1090 states have internal predecessors, (1341), 136 states have call successors, (136), 60 states have call predecessors, (136), 60 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 04:19:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1613 transitions. [2025-01-09 04:19:39,250 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1613 transitions. Word has length 296 [2025-01-09 04:19:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:39,250 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1613 transitions. [2025-01-09 04:19:39,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 04:19:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1613 transitions. [2025-01-09 04:19:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-09 04:19:39,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:39,253 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:39,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:19:39,254 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -478630860, now seen corresponding path program 1 times [2025-01-09 04:19:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311276314] [2025-01-09 04:19:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:39,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 04:19:39,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 04:19:39,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:39,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2025-01-09 04:19:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311276314] [2025-01-09 04:19:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311276314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:40,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:40,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:19:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679169308] [2025-01-09 04:19:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:40,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:19:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:40,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:19:40,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:40,027 INFO L87 Difference]: Start difference. First operand 1281 states and 1613 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 04:19:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:40,205 INFO L93 Difference]: Finished difference Result 2614 states and 3321 transitions. [2025-01-09 04:19:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:19:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 338 [2025-01-09 04:19:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:40,213 INFO L225 Difference]: With dead ends: 2614 [2025-01-09 04:19:40,214 INFO L226 Difference]: Without dead ends: 1701 [2025-01-09 04:19:40,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:19:40,218 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 77 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:40,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1670 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:19:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-01-09 04:19:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1443. [2025-01-09 04:19:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1206 states have (on average 1.236318407960199) internal successors, (1491), 1215 states have internal predecessors, (1491), 155 states have call successors, (155), 72 states have call predecessors, (155), 81 states have return successors, (170), 155 states have call predecessors, (170), 155 states have call successors, (170) [2025-01-09 04:19:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1816 transitions. [2025-01-09 04:19:40,278 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1816 transitions. Word has length 338 [2025-01-09 04:19:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:40,278 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 1816 transitions. [2025-01-09 04:19:40,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 04:19:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1816 transitions. [2025-01-09 04:19:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-01-09 04:19:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:40,281 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:19:40,281 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -675144365, now seen corresponding path program 1 times [2025-01-09 04:19:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662494222] [2025-01-09 04:19:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:40,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 04:19:40,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 04:19:40,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:40,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2025-01-09 04:19:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:40,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662494222] [2025-01-09 04:19:40,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662494222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:40,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:40,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:19:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999476201] [2025-01-09 04:19:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:40,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:19:40,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:40,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:19:40,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:19:40,388 INFO L87 Difference]: Start difference. First operand 1443 states and 1816 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 04:19:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:40,484 INFO L93 Difference]: Finished difference Result 2897 states and 3656 transitions. [2025-01-09 04:19:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:19:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 338 [2025-01-09 04:19:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:40,494 INFO L225 Difference]: With dead ends: 2897 [2025-01-09 04:19:40,495 INFO L226 Difference]: Without dead ends: 1407 [2025-01-09 04:19:40,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:19:40,497 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 26 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:40,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 640 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:19:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-01-09 04:19:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2025-01-09 04:19:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1179 states have (on average 1.2086513994910941) internal successors, (1425), 1188 states have internal predecessors, (1425), 155 states have call successors, (155), 72 states have call predecessors, (155), 72 states have return successors, (155), 146 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 04:19:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1735 transitions. [2025-01-09 04:19:40,579 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1735 transitions. Word has length 338 [2025-01-09 04:19:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:40,581 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1735 transitions. [2025-01-09 04:19:40,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 04:19:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1735 transitions. [2025-01-09 04:19:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-09 04:19:40,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:40,584 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:19:40,584 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1001553959, now seen corresponding path program 1 times [2025-01-09 04:19:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181420108] [2025-01-09 04:19:40,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:40,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 04:19:40,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 04:19:40,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:40,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-01-09 04:19:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181420108] [2025-01-09 04:19:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181420108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215689804] [2025-01-09 04:19:41,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:41,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:41,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:41,248 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:41,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 04:19:41,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 04:19:41,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 04:19:41,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:41,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:41,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 04:19:41,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 275 proven. 64 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-01-09 04:19:42,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-01-09 04:19:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215689804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:43,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 12] total 21 [2025-01-09 04:19:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265214220] [2025-01-09 04:19:43,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:43,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:19:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:43,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:19:43,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:19:43,035 INFO L87 Difference]: Start difference. First operand 1407 states and 1735 transitions. Second operand has 21 states, 20 states have (on average 13.05) internal successors, (261), 20 states have internal predecessors, (261), 12 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 11 states have call predecessors, (51), 11 states have call successors, (51) [2025-01-09 04:19:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:46,840 INFO L93 Difference]: Finished difference Result 7273 states and 9597 transitions. [2025-01-09 04:19:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-01-09 04:19:46,841 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 13.05) internal successors, (261), 20 states have internal predecessors, (261), 12 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 11 states have call predecessors, (51), 11 states have call successors, (51) Word has length 348 [2025-01-09 04:19:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:46,858 INFO L225 Difference]: With dead ends: 7273 [2025-01-09 04:19:46,859 INFO L226 Difference]: Without dead ends: 6252 [2025-01-09 04:19:46,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 705 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1614, Invalid=9728, Unknown=0, NotChecked=0, Total=11342 [2025-01-09 04:19:46,864 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 5127 mSDsluCounter, 4181 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5127 SdHoareTripleChecker+Valid, 4638 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:46,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5127 Valid, 4638 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:19:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6252 states. [2025-01-09 04:19:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6252 to 2624. [2025-01-09 04:19:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2190 states have (on average 1.2287671232876711) internal successors, (2691), 2208 states have internal predecessors, (2691), 296 states have call successors, (296), 137 states have call predecessors, (296), 137 states have return successors, (296), 278 states have call predecessors, (296), 296 states have call successors, (296) [2025-01-09 04:19:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3283 transitions. [2025-01-09 04:19:47,036 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3283 transitions. Word has length 348 [2025-01-09 04:19:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:47,037 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3283 transitions. [2025-01-09 04:19:47,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 13.05) internal successors, (261), 20 states have internal predecessors, (261), 12 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 11 states have call predecessors, (51), 11 states have call successors, (51) [2025-01-09 04:19:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3283 transitions. [2025-01-09 04:19:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-09 04:19:47,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:47,042 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:47,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 04:19:47,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-01-09 04:19:47,247 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash 259363291, now seen corresponding path program 1 times [2025-01-09 04:19:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219087497] [2025-01-09 04:19:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:47,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 04:19:47,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 04:19:47,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:47,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2025-01-09 04:19:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219087497] [2025-01-09 04:19:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219087497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:19:47,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:19:47,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:19:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958792785] [2025-01-09 04:19:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:19:47,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:19:47,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:47,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:19:47,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:19:47,470 INFO L87 Difference]: Start difference. First operand 2624 states and 3283 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 04:19:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:19:47,904 INFO L93 Difference]: Finished difference Result 5274 states and 6653 transitions. [2025-01-09 04:19:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:19:47,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 348 [2025-01-09 04:19:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:19:47,918 INFO L225 Difference]: With dead ends: 5274 [2025-01-09 04:19:47,918 INFO L226 Difference]: Without dead ends: 3193 [2025-01-09 04:19:47,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:19:47,923 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 148 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:19:47,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 2176 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:19:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2025-01-09 04:19:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2550. [2025-01-09 04:19:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2136 states have (on average 1.2214419475655431) internal successors, (2609), 2156 states have internal predecessors, (2609), 278 states have call successors, (278), 135 states have call predecessors, (278), 135 states have return successors, (278), 258 states have call predecessors, (278), 278 states have call successors, (278) [2025-01-09 04:19:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3165 transitions. [2025-01-09 04:19:48,107 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3165 transitions. Word has length 348 [2025-01-09 04:19:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:19:48,107 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 3165 transitions. [2025-01-09 04:19:48,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 04:19:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3165 transitions. [2025-01-09 04:19:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 04:19:48,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:19:48,115 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:19:48,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:19:48,115 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:19:48,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:19:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1372997086, now seen corresponding path program 1 times [2025-01-09 04:19:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:19:48,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139115577] [2025-01-09 04:19:48,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:19:48,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 04:19:48,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 04:19:48,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:48,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-01-09 04:19:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:19:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139115577] [2025-01-09 04:19:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139115577] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:19:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514730017] [2025-01-09 04:19:48,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:19:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:19:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:19:48,772 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:19:48,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 04:19:48,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 04:19:49,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 04:19:49,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:19:49,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:19:49,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:19:49,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:19:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 275 proven. 62 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2025-01-09 04:19:49,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:19:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2025-01-09 04:19:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514730017] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:19:49,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:19:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 27 [2025-01-09 04:19:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308061101] [2025-01-09 04:19:49,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:19:49,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:19:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:19:49,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:19:49,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:19:49,951 INFO L87 Difference]: Start difference. First operand 2550 states and 3165 transitions. Second operand has 27 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 15 states have call successors, (62), 7 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2025-01-09 04:20:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:05,867 INFO L93 Difference]: Finished difference Result 48732 states and 64895 transitions. [2025-01-09 04:20:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2025-01-09 04:20:05,868 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 15 states have call successors, (62), 7 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) Word has length 349 [2025-01-09 04:20:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:06,130 INFO L225 Difference]: With dead ends: 48732 [2025-01-09 04:20:06,130 INFO L226 Difference]: Without dead ends: 46725 [2025-01-09 04:20:06,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 791 SyntacticMatches, 0 SemanticMatches, 449 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92480 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=17051, Invalid=185899, Unknown=0, NotChecked=0, Total=202950 [2025-01-09 04:20:06,169 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 13939 mSDsluCounter, 11090 mSDsCounter, 0 mSdLazyCounter, 5199 mSolverCounterSat, 3633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13939 SdHoareTripleChecker+Valid, 12060 SdHoareTripleChecker+Invalid, 8832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3633 IncrementalHoareTripleChecker+Valid, 5199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:06,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13939 Valid, 12060 Invalid, 8832 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3633 Valid, 5199 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 04:20:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46725 states. [2025-01-09 04:20:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46725 to 3753. [2025-01-09 04:20:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3139 states have (on average 1.2280981204205161) internal successors, (3855), 3169 states have internal predecessors, (3855), 412 states have call successors, (412), 201 states have call predecessors, (412), 201 states have return successors, (412), 382 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 04:20:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 4679 transitions. [2025-01-09 04:20:06,951 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 4679 transitions. Word has length 349 [2025-01-09 04:20:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:06,952 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 4679 transitions. [2025-01-09 04:20:06,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 15 states have call successors, (62), 7 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2025-01-09 04:20:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 4679 transitions. [2025-01-09 04:20:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 04:20:06,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:06,959 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:06,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 04:20:07,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:07,221 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:07,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash -223096878, now seen corresponding path program 1 times [2025-01-09 04:20:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:07,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356370374] [2025-01-09 04:20:07,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:07,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:07,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 04:20:07,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 04:20:07,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:07,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2025-01-09 04:20:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356370374] [2025-01-09 04:20:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356370374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215474327] [2025-01-09 04:20:08,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:08,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:08,183 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:20:08,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 04:20:08,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 04:20:08,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 04:20:08,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:08,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 04:20:08,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 248 proven. 92 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-01-09 04:20:09,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2025-01-09 04:20:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215474327] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:09,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:09,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 34 [2025-01-09 04:20:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35991355] [2025-01-09 04:20:09,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:09,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 04:20:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:09,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 04:20:09,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:20:09,554 INFO L87 Difference]: Start difference. First operand 3753 states and 4679 transitions. Second operand has 34 states, 33 states have (on average 8.757575757575758) internal successors, (289), 31 states have internal predecessors, (289), 12 states have call successors, (55), 7 states have call predecessors, (55), 9 states have return successors, (54), 13 states have call predecessors, (54), 11 states have call successors, (54) [2025-01-09 04:20:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:23,570 INFO L93 Difference]: Finished difference Result 45405 states and 59486 transitions. [2025-01-09 04:20:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 324 states. [2025-01-09 04:20:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 8.757575757575758) internal successors, (289), 31 states have internal predecessors, (289), 12 states have call successors, (55), 7 states have call predecessors, (55), 9 states have return successors, (54), 13 states have call predecessors, (54), 11 states have call successors, (54) Word has length 350 [2025-01-09 04:20:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:23,830 INFO L225 Difference]: With dead ends: 45405 [2025-01-09 04:20:23,830 INFO L226 Difference]: Without dead ends: 42340 [2025-01-09 04:20:23,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53127 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8621, Invalid=114931, Unknown=0, NotChecked=0, Total=123552 [2025-01-09 04:20:23,849 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 4025 mSDsluCounter, 15734 mSDsCounter, 0 mSdLazyCounter, 8985 mSolverCounterSat, 946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4033 SdHoareTripleChecker+Valid, 16604 SdHoareTripleChecker+Invalid, 9931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 946 IncrementalHoareTripleChecker+Valid, 8985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:23,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4033 Valid, 16604 Invalid, 9931 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [946 Valid, 8985 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 04:20:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42340 states. [2025-01-09 04:20:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42340 to 5352. [2025-01-09 04:20:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5352 states, 4474 states have (on average 1.227983907018328) internal successors, (5494), 4518 states have internal predecessors, (5494), 596 states have call successors, (596), 281 states have call predecessors, (596), 281 states have return successors, (596), 552 states have call predecessors, (596), 596 states have call successors, (596) [2025-01-09 04:20:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5352 states to 5352 states and 6686 transitions. [2025-01-09 04:20:24,888 INFO L78 Accepts]: Start accepts. Automaton has 5352 states and 6686 transitions. Word has length 350 [2025-01-09 04:20:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:24,889 INFO L471 AbstractCegarLoop]: Abstraction has 5352 states and 6686 transitions. [2025-01-09 04:20:24,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 8.757575757575758) internal successors, (289), 31 states have internal predecessors, (289), 12 states have call successors, (55), 7 states have call predecessors, (55), 9 states have return successors, (54), 13 states have call predecessors, (54), 11 states have call successors, (54) [2025-01-09 04:20:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5352 states and 6686 transitions. [2025-01-09 04:20:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 04:20:24,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:24,906 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:24,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 04:20:25,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:25,110 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash 236439798, now seen corresponding path program 1 times [2025-01-09 04:20:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177678861] [2025-01-09 04:20:25,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:25,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 04:20:25,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 04:20:25,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:25,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-01-09 04:20:25,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177678861] [2025-01-09 04:20:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177678861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:25,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:20:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906652844] [2025-01-09 04:20:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:25,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:20:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:25,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:20:25,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:20:25,426 INFO L87 Difference]: Start difference. First operand 5352 states and 6686 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 04:20:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:26,955 INFO L93 Difference]: Finished difference Result 12399 states and 15584 transitions. [2025-01-09 04:20:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:20:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 350 [2025-01-09 04:20:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:26,983 INFO L225 Difference]: With dead ends: 12399 [2025-01-09 04:20:26,984 INFO L226 Difference]: Without dead ends: 7856 [2025-01-09 04:20:26,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:20:26,995 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 275 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:26,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 2966 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:20:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7856 states. [2025-01-09 04:20:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7856 to 5316. [2025-01-09 04:20:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5316 states, 4450 states have (on average 1.22561797752809) internal successors, (5454), 4494 states have internal predecessors, (5454), 584 states have call successors, (584), 281 states have call predecessors, (584), 281 states have return successors, (584), 540 states have call predecessors, (584), 584 states have call successors, (584) [2025-01-09 04:20:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 6622 transitions. [2025-01-09 04:20:27,607 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 6622 transitions. Word has length 350 [2025-01-09 04:20:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:27,607 INFO L471 AbstractCegarLoop]: Abstraction has 5316 states and 6622 transitions. [2025-01-09 04:20:27,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 04:20:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 6622 transitions. [2025-01-09 04:20:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 04:20:27,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:27,617 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:27,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 04:20:27,617 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:27,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1216408096, now seen corresponding path program 1 times [2025-01-09 04:20:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:27,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63614303] [2025-01-09 04:20:27,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:27,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 04:20:27,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 04:20:27,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:27,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2025-01-09 04:20:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:27,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63614303] [2025-01-09 04:20:27,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63614303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:27,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:27,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377481384] [2025-01-09 04:20:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:27,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:27,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:27,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:27,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:27,798 INFO L87 Difference]: Start difference. First operand 5316 states and 6622 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 04:20:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:28,633 INFO L93 Difference]: Finished difference Result 9395 states and 11731 transitions. [2025-01-09 04:20:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:28,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 350 [2025-01-09 04:20:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:28,647 INFO L225 Difference]: With dead ends: 9395 [2025-01-09 04:20:28,647 INFO L226 Difference]: Without dead ends: 4513 [2025-01-09 04:20:28,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:28,654 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:28,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4513 states. [2025-01-09 04:20:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4513 to 4513. [2025-01-09 04:20:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4513 states, 3687 states have (on average 1.2123677786818552) internal successors, (4470), 3731 states have internal predecessors, (4470), 564 states have call successors, (564), 261 states have call predecessors, (564), 261 states have return successors, (564), 520 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 04:20:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 5598 transitions. [2025-01-09 04:20:29,105 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 5598 transitions. Word has length 350 [2025-01-09 04:20:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:29,106 INFO L471 AbstractCegarLoop]: Abstraction has 4513 states and 5598 transitions. [2025-01-09 04:20:29,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 04:20:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 5598 transitions. [2025-01-09 04:20:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-09 04:20:29,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:29,114 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 04:20:29,114 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:29,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash 701776151, now seen corresponding path program 1 times [2025-01-09 04:20:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948578095] [2025-01-09 04:20:29,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:29,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 04:20:29,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 04:20:29,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-01-09 04:20:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948578095] [2025-01-09 04:20:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948578095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933734451] [2025-01-09 04:20:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:29,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:29,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:29,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:29,463 INFO L87 Difference]: Start difference. First operand 4513 states and 5598 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 04:20:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:29,996 INFO L93 Difference]: Finished difference Result 8371 states and 10426 transitions. [2025-01-09 04:20:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:29,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 351 [2025-01-09 04:20:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:30,009 INFO L225 Difference]: With dead ends: 8371 [2025-01-09 04:20:30,009 INFO L226 Difference]: Without dead ends: 4216 [2025-01-09 04:20:30,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:30,017 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:30,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 465 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2025-01-09 04:20:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4216. [2025-01-09 04:20:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4216 states, 3400 states have (on average 1.2079411764705883) internal successors, (4107), 3444 states have internal predecessors, (4107), 559 states have call successors, (559), 256 states have call predecessors, (559), 256 states have return successors, (559), 515 states have call predecessors, (559), 559 states have call successors, (559) [2025-01-09 04:20:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4216 states to 4216 states and 5225 transitions. [2025-01-09 04:20:30,651 INFO L78 Accepts]: Start accepts. Automaton has 4216 states and 5225 transitions. Word has length 351 [2025-01-09 04:20:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:30,651 INFO L471 AbstractCegarLoop]: Abstraction has 4216 states and 5225 transitions. [2025-01-09 04:20:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 04:20:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 5225 transitions. [2025-01-09 04:20:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 04:20:30,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:30,660 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:30,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 04:20:30,661 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:30,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1036046891, now seen corresponding path program 1 times [2025-01-09 04:20:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426473326] [2025-01-09 04:20:30,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:30,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 04:20:30,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 04:20:30,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:30,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2025-01-09 04:20:30,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:30,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426473326] [2025-01-09 04:20:30,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426473326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:30,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:30,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135110876] [2025-01-09 04:20:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:30,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:30,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:30,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:30,896 INFO L87 Difference]: Start difference. First operand 4216 states and 5225 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 04:20:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:31,381 INFO L93 Difference]: Finished difference Result 6662 states and 8274 transitions. [2025-01-09 04:20:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 352 [2025-01-09 04:20:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:31,392 INFO L225 Difference]: With dead ends: 6662 [2025-01-09 04:20:31,392 INFO L226 Difference]: Without dead ends: 2790 [2025-01-09 04:20:31,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:31,399 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:31,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2025-01-09 04:20:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2790. [2025-01-09 04:20:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2276 states have (on average 1.2007908611599296) internal successors, (2733), 2303 states have internal predecessors, (2733), 347 states have call successors, (347), 166 states have call predecessors, (347), 166 states have return successors, (347), 320 states have call predecessors, (347), 347 states have call successors, (347) [2025-01-09 04:20:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3427 transitions. [2025-01-09 04:20:31,801 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3427 transitions. Word has length 352 [2025-01-09 04:20:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:31,801 INFO L471 AbstractCegarLoop]: Abstraction has 2790 states and 3427 transitions. [2025-01-09 04:20:31,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 04:20:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3427 transitions. [2025-01-09 04:20:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 04:20:31,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:31,806 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:31,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 04:20:31,806 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:31,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 124228974, now seen corresponding path program 1 times [2025-01-09 04:20:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:31,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486565689] [2025-01-09 04:20:31,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:31,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 04:20:31,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 04:20:31,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:31,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2025-01-09 04:20:31,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486565689] [2025-01-09 04:20:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486565689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:31,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:20:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080288591] [2025-01-09 04:20:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:20:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:31,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:20:31,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:20:31,981 INFO L87 Difference]: Start difference. First operand 2790 states and 3427 transitions. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 7 states have internal predecessors, (120), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 04:20:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:32,535 INFO L93 Difference]: Finished difference Result 5473 states and 6764 transitions. [2025-01-09 04:20:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:20:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 7 states have internal predecessors, (120), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 355 [2025-01-09 04:20:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:32,555 INFO L225 Difference]: With dead ends: 5473 [2025-01-09 04:20:32,555 INFO L226 Difference]: Without dead ends: 3230 [2025-01-09 04:20:32,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:20:32,559 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 116 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:32,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1635 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2025-01-09 04:20:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 2877. [2025-01-09 04:20:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2339 states have (on average 1.2005130397605814) internal successors, (2808), 2366 states have internal predecessors, (2808), 365 states have call successors, (365), 172 states have call predecessors, (365), 172 states have return successors, (365), 338 states have call predecessors, (365), 365 states have call successors, (365) [2025-01-09 04:20:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3538 transitions. [2025-01-09 04:20:32,893 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3538 transitions. Word has length 355 [2025-01-09 04:20:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:32,894 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 3538 transitions. [2025-01-09 04:20:32,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 7 states have internal predecessors, (120), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 04:20:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3538 transitions. [2025-01-09 04:20:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 04:20:32,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:32,899 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:32,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 04:20:32,899 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:32,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1241140534, now seen corresponding path program 1 times [2025-01-09 04:20:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:32,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39136276] [2025-01-09 04:20:32,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:32,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 04:20:32,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 04:20:32,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:32,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2025-01-09 04:20:33,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:33,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39136276] [2025-01-09 04:20:33,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39136276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:33,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357684453] [2025-01-09 04:20:33,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:33,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:33,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:33,081 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:20:33,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 04:20:33,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 04:20:33,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 04:20:33,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:33,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:33,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 04:20:33,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 127 proven. 204 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2025-01-09 04:20:33,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2025-01-09 04:20:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357684453] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:33,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 19 [2025-01-09 04:20:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891692957] [2025-01-09 04:20:33,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:33,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:20:33,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:33,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:20:33,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:20:33,972 INFO L87 Difference]: Start difference. First operand 2877 states and 3538 transitions. Second operand has 19 states, 19 states have (on average 14.157894736842104) internal successors, (269), 17 states have internal predecessors, (269), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) [2025-01-09 04:20:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:36,030 INFO L93 Difference]: Finished difference Result 8708 states and 10763 transitions. [2025-01-09 04:20:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 04:20:36,031 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.157894736842104) internal successors, (269), 17 states have internal predecessors, (269), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) Word has length 355 [2025-01-09 04:20:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:36,052 INFO L225 Difference]: With dead ends: 8708 [2025-01-09 04:20:36,052 INFO L226 Difference]: Without dead ends: 6378 [2025-01-09 04:20:36,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 700 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=3178, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 04:20:36,059 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 951 mSDsluCounter, 7616 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 8179 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:36,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 8179 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:20:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6378 states. [2025-01-09 04:20:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6378 to 4965. [2025-01-09 04:20:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4965 states, 4055 states have (on average 1.1997533908754623) internal successors, (4865), 4097 states have internal predecessors, (4865), 614 states have call successors, (614), 295 states have call predecessors, (614), 295 states have return successors, (614), 572 states have call predecessors, (614), 614 states have call successors, (614) [2025-01-09 04:20:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 6093 transitions. [2025-01-09 04:20:36,899 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 6093 transitions. Word has length 355 [2025-01-09 04:20:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:36,899 INFO L471 AbstractCegarLoop]: Abstraction has 4965 states and 6093 transitions. [2025-01-09 04:20:36,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.157894736842104) internal successors, (269), 17 states have internal predecessors, (269), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) [2025-01-09 04:20:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 6093 transitions. [2025-01-09 04:20:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-09 04:20:36,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:36,908 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:36,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 04:20:37,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-01-09 04:20:37,109 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:37,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1851005058, now seen corresponding path program 1 times [2025-01-09 04:20:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:37,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633447908] [2025-01-09 04:20:37,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:37,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:37,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 04:20:37,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 04:20:37,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:37,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-01-09 04:20:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633447908] [2025-01-09 04:20:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633447908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:20:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924926468] [2025-01-09 04:20:37,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:37,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:20:37,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:37,367 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:20:37,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 04:20:37,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 04:20:37,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 04:20:37,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:37,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:37,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 04:20:37,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:20:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 326 proven. 60 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 04:20:37,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:20:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 57 proven. 52 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 04:20:38,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924926468] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:20:38,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:20:38,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2025-01-09 04:20:38,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24058470] [2025-01-09 04:20:38,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:20:38,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 04:20:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:38,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 04:20:38,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:20:38,556 INFO L87 Difference]: Start difference. First operand 4965 states and 6093 transitions. Second operand has 33 states, 33 states have (on average 8.575757575757576) internal successors, (283), 28 states have internal predecessors, (283), 7 states have call successors, (49), 8 states have call predecessors, (49), 15 states have return successors, (50), 12 states have call predecessors, (50), 7 states have call successors, (50)