./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:17:39,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:17:39,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:17:39,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:17:39,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:17:39,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:17:39,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:17:39,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:17:39,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:17:39,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:17:39,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:17:39,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:17:39,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:17:39,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:17:39,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:39,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:17:39,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:17:39,487 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/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 -> cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 [2025-03-03 15:17:39,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:17:39,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:17:39,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:17:39,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:17:39,727 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:17:39,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:17:40,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b3f39b0/b38bd69c5e124cb1ae0b4945b398170c/FLAG4fe0508cf [2025-03-03 15:17:41,040 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:17:41,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:17:41,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b3f39b0/b38bd69c5e124cb1ae0b4945b398170c/FLAG4fe0508cf [2025-03-03 15:17:41,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b3f39b0/b38bd69c5e124cb1ae0b4945b398170c [2025-03-03 15:17:41,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:17:41,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:17:41,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:41,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:17:41,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:17:41,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21279eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41, skipping insertion in model container [2025-03-03 15:17:41,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:17:41,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2025-03-03 15:17:41,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:41,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:17:41,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2025-03-03 15:17:41,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:41,392 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:17:41,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41 WrapperNode [2025-03-03 15:17:41,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:41,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:41,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:17:41,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:17:41,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,423 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 625 [2025-03-03 15:17:41,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:41,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:17:41,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:17:41,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:17:41,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,446 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-03-03 15:17:41,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:17:41,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:17:41,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:17:41,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:17:41,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (1/1) ... [2025-03-03 15:17:41,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:17:41,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:17:41,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:17:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:17:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:17:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:17:41,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:17:41,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:17:41,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:17:42,072 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc main_~node2__m2~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L500: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node7____CPAchecker_TMP_0~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L342: havoc main_~node7__m7~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: havoc main_~node6__m6~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node5__m5~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: havoc main_~node4__m4~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:17:42,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: havoc main_~node3__m3~0#1; [2025-03-03 15:17:42,101 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-03 15:17:42,101 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:17:42,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:17:42,113 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:17:42,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:17:42 BoogieIcfgContainer [2025-03-03 15:17:42,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:17:42,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:17:42,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:17:42,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:17:42,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:17:41" (1/3) ... [2025-03-03 15:17:42,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b777fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:17:42, skipping insertion in model container [2025-03-03 15:17:42,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:41" (2/3) ... [2025-03-03 15:17:42,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b777fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:17:42, skipping insertion in model container [2025-03-03 15:17:42,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:17:42" (3/3) ... [2025-03-03 15:17:42,120 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:17:42,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:17:42,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 138 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:17:42,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:17:42,203 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;@7f8cc61e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:17:42,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:17:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:17:42,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:42,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:42,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:42,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash -196884735, now seen corresponding path program 1 times [2025-03-03 15:17:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443719194] [2025-03-03 15:17:42,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:42,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:17:42,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:17:42,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:42,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:42,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:42,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443719194] [2025-03-03 15:17:42,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443719194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:42,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:42,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278743861] [2025-03-03 15:17:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:42,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:42,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:42,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:42,574 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:42,623 INFO L93 Difference]: Finished difference Result 300 states and 490 transitions. [2025-03-03 15:17:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:17:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:42,631 INFO L225 Difference]: With dead ends: 300 [2025-03-03 15:17:42,632 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 15:17:42,633 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-03-03 15:17:42,635 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 159 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:42,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 471 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 15:17:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-03-03 15:17:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions. [2025-03-03 15:17:42,662 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 87 [2025-03-03 15:17:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:42,662 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 298 transitions. [2025-03-03 15:17:42,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2025-03-03 15:17:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:17:42,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:42,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:42,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:17:42,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:42,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash 559944001, now seen corresponding path program 1 times [2025-03-03 15:17:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:42,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444763034] [2025-03-03 15:17:42,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:42,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:42,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:17:42,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:17:42,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:42,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:42,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:42,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444763034] [2025-03-03 15:17:42,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444763034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:42,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406199631] [2025-03-03 15:17:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:42,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:42,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:42,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:42,825 INFO L87 Difference]: Start difference. First operand 207 states and 298 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:42,853 INFO L93 Difference]: Finished difference Result 499 states and 762 transitions. [2025-03-03 15:17:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:42,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 15:17:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:42,857 INFO L225 Difference]: With dead ends: 499 [2025-03-03 15:17:42,857 INFO L226 Difference]: Without dead ends: 345 [2025-03-03 15:17:42,858 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-03-03 15:17:42,859 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 110 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:42,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 402 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-03 15:17:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2025-03-03 15:17:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 514 transitions. [2025-03-03 15:17:42,879 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 514 transitions. Word has length 88 [2025-03-03 15:17:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:42,879 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 514 transitions. [2025-03-03 15:17:42,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 514 transitions. [2025-03-03 15:17:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:17:42,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:42,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:42,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:17:42,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:42,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash -863850834, now seen corresponding path program 1 times [2025-03-03 15:17:42,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714560890] [2025-03-03 15:17:42,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:42,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:17:42,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:17:42,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:42,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714560890] [2025-03-03 15:17:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714560890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:43,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:43,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363422704] [2025-03-03 15:17:43,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:43,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:43,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:43,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:43,024 INFO L87 Difference]: Start difference. First operand 343 states and 514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:43,050 INFO L93 Difference]: Finished difference Result 891 states and 1384 transitions. [2025-03-03 15:17:43,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 15:17:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:43,052 INFO L225 Difference]: With dead ends: 891 [2025-03-03 15:17:43,052 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 15:17:43,053 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-03-03 15:17:43,056 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 105 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:43,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 15:17:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2025-03-03 15:17:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 918 transitions. [2025-03-03 15:17:43,076 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 918 transitions. Word has length 89 [2025-03-03 15:17:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:43,077 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 918 transitions. [2025-03-03 15:17:43,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 918 transitions. [2025-03-03 15:17:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:17:43,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:43,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:43,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:17:43,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:43,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1386332914, now seen corresponding path program 1 times [2025-03-03 15:17:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067310055] [2025-03-03 15:17:43,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:43,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:17:43,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:17:43,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:43,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:43,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067310055] [2025-03-03 15:17:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067310055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758813537] [2025-03-03 15:17:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:43,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:43,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:43,191 INFO L87 Difference]: Start difference. First operand 599 states and 918 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:43,211 INFO L93 Difference]: Finished difference Result 1627 states and 2544 transitions. [2025-03-03 15:17:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:17:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:43,215 INFO L225 Difference]: With dead ends: 1627 [2025-03-03 15:17:43,215 INFO L226 Difference]: Without dead ends: 1081 [2025-03-03 15:17:43,216 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-03-03 15:17:43,217 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:43,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 394 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-03 15:17:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2025-03-03 15:17:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1670 transitions. [2025-03-03 15:17:43,238 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1670 transitions. Word has length 90 [2025-03-03 15:17:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:43,239 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1670 transitions. [2025-03-03 15:17:43,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1670 transitions. [2025-03-03 15:17:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:17:43,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:43,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:17:43,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash 684136283, now seen corresponding path program 1 times [2025-03-03 15:17:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254919907] [2025-03-03 15:17:43,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:43,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:17:43,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:17:43,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:43,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254919907] [2025-03-03 15:17:43,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254919907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:43,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:43,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:43,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409777445] [2025-03-03 15:17:43,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:43,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:43,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:43,343 INFO L87 Difference]: Start difference. First operand 1079 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:43,371 INFO L93 Difference]: Finished difference Result 3003 states and 4696 transitions. [2025-03-03 15:17:43,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-03 15:17:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:43,379 INFO L225 Difference]: With dead ends: 3003 [2025-03-03 15:17:43,379 INFO L226 Difference]: Without dead ends: 1977 [2025-03-03 15:17:43,381 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-03-03 15:17:43,382 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:43,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 390 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:43,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-03-03 15:17:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1975. [2025-03-03 15:17:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3062 transitions. [2025-03-03 15:17:43,434 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3062 transitions. Word has length 91 [2025-03-03 15:17:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:43,435 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 3062 transitions. [2025-03-03 15:17:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3062 transitions. [2025-03-03 15:17:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:17:43,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:43,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:17:43,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 910655963, now seen corresponding path program 1 times [2025-03-03 15:17:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486184605] [2025-03-03 15:17:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:43,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:17:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:17:43,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:43,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486184605] [2025-03-03 15:17:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486184605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708811258] [2025-03-03 15:17:43,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:43,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:43,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:43,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:43,530 INFO L87 Difference]: Start difference. First operand 1975 states and 3062 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:43,564 INFO L93 Difference]: Finished difference Result 5563 states and 8664 transitions. [2025-03-03 15:17:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:17:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:43,575 INFO L225 Difference]: With dead ends: 5563 [2025-03-03 15:17:43,575 INFO L226 Difference]: Without dead ends: 3641 [2025-03-03 15:17:43,577 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-03-03 15:17:43,579 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:43,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 386 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2025-03-03 15:17:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3639. [2025-03-03 15:17:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5622 transitions. [2025-03-03 15:17:43,653 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5622 transitions. Word has length 92 [2025-03-03 15:17:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:43,653 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 5622 transitions. [2025-03-03 15:17:43,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5622 transitions. [2025-03-03 15:17:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:17:43,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:43,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:43,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:17:43,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:43,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash -49217272, now seen corresponding path program 1 times [2025-03-03 15:17:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:43,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820762147] [2025-03-03 15:17:43,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:43,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:17:43,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:17:43,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:43,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820762147] [2025-03-03 15:17:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820762147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:43,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720413237] [2025-03-03 15:17:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:43,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:43,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:43,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:43,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:43,875 INFO L87 Difference]: Start difference. First operand 3639 states and 5622 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:44,469 INFO L93 Difference]: Finished difference Result 53843 states and 83588 transitions. [2025-03-03 15:17:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:17:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 15:17:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:44,571 INFO L225 Difference]: With dead ends: 53843 [2025-03-03 15:17:44,572 INFO L226 Difference]: Without dead ends: 50257 [2025-03-03 15:17:44,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:17:44,585 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1920 mSDsluCounter, 5547 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:44,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1920 Valid, 5726 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:17:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2025-03-03 15:17:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 7223. [2025-03-03 15:17:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7223 states, 7222 states have (on average 1.5317086679590142) internal successors, (11062), 7222 states have internal predecessors, (11062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7223 states to 7223 states and 11062 transitions. [2025-03-03 15:17:44,982 INFO L78 Accepts]: Start accepts. Automaton has 7223 states and 11062 transitions. Word has length 93 [2025-03-03 15:17:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 7223 states and 11062 transitions. [2025-03-03 15:17:44,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7223 states and 11062 transitions. [2025-03-03 15:17:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:17:44,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:44,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:44,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:17:44,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:44,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:44,985 INFO L85 PathProgramCache]: Analyzing trace with hash -14276559, now seen corresponding path program 1 times [2025-03-03 15:17:44,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:44,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378008011] [2025-03-03 15:17:44,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:44,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:45,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:17:45,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:17:45,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:45,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:45,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378008011] [2025-03-03 15:17:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378008011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:45,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818562659] [2025-03-03 15:17:45,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:45,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:45,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:45,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:45,101 INFO L87 Difference]: Start difference. First operand 7223 states and 11062 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:45,149 INFO L93 Difference]: Finished difference Result 20859 states and 31864 transitions. [2025-03-03 15:17:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:45,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:17:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:45,172 INFO L225 Difference]: With dead ends: 20859 [2025-03-03 15:17:45,172 INFO L226 Difference]: Without dead ends: 13689 [2025-03-03 15:17:45,182 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-03-03 15:17:45,183 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 80 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:45,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 303 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13689 states. [2025-03-03 15:17:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13689 to 13559. [2025-03-03 15:17:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13559 states, 13558 states have (on average 1.5050892462015046) internal successors, (20406), 13558 states have internal predecessors, (20406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13559 states to 13559 states and 20406 transitions. [2025-03-03 15:17:45,399 INFO L78 Accepts]: Start accepts. Automaton has 13559 states and 20406 transitions. Word has length 95 [2025-03-03 15:17:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:45,399 INFO L471 AbstractCegarLoop]: Abstraction has 13559 states and 20406 transitions. [2025-03-03 15:17:45,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13559 states and 20406 transitions. [2025-03-03 15:17:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:17:45,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:45,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:45,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:17:45,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:45,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash -13114710, now seen corresponding path program 1 times [2025-03-03 15:17:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:45,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158902295] [2025-03-03 15:17:45,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:45,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:45,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:17:45,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:17:45,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:45,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:45,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158902295] [2025-03-03 15:17:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158902295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:45,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:45,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211352770] [2025-03-03 15:17:45,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:45,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:45,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:45,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:45,835 INFO L87 Difference]: Start difference. First operand 13559 states and 20406 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:46,138 INFO L93 Difference]: Finished difference Result 27067 states and 40760 transitions. [2025-03-03 15:17:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:46,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:17:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:46,158 INFO L225 Difference]: With dead ends: 27067 [2025-03-03 15:17:46,158 INFO L226 Difference]: Without dead ends: 13561 [2025-03-03 15:17:46,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:17:46,174 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 224 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:46,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 946 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:17:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2025-03-03 15:17:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13559. [2025-03-03 15:17:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13559 states, 13558 states have (on average 1.495648325711757) internal successors, (20278), 13558 states have internal predecessors, (20278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13559 states to 13559 states and 20278 transitions. [2025-03-03 15:17:46,362 INFO L78 Accepts]: Start accepts. Automaton has 13559 states and 20278 transitions. Word has length 95 [2025-03-03 15:17:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:46,362 INFO L471 AbstractCegarLoop]: Abstraction has 13559 states and 20278 transitions. [2025-03-03 15:17:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 13559 states and 20278 transitions. [2025-03-03 15:17:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:17:46,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:46,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:46,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:17:46,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash -405600701, now seen corresponding path program 1 times [2025-03-03 15:17:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:46,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742328303] [2025-03-03 15:17:46,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:46,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:17:46,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:17:46,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:46,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:46,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:46,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742328303] [2025-03-03 15:17:46,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742328303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:46,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:46,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:17:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107663326] [2025-03-03 15:17:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:46,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:46,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:46,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:46,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:46,620 INFO L87 Difference]: Start difference. First operand 13559 states and 20278 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:46,661 INFO L93 Difference]: Finished difference Result 13817 states and 20663 transitions. [2025-03-03 15:17:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:17:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:46,683 INFO L225 Difference]: With dead ends: 13817 [2025-03-03 15:17:46,683 INFO L226 Difference]: Without dead ends: 13815 [2025-03-03 15:17:46,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-03 15:17:46,688 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:46,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 709 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13815 states. [2025-03-03 15:17:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13815 to 13815. [2025-03-03 15:17:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13815 states, 13814 states have (on average 1.481830027508325) internal successors, (20470), 13814 states have internal predecessors, (20470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13815 states to 13815 states and 20470 transitions. [2025-03-03 15:17:46,865 INFO L78 Accepts]: Start accepts. Automaton has 13815 states and 20470 transitions. Word has length 96 [2025-03-03 15:17:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:46,865 INFO L471 AbstractCegarLoop]: Abstraction has 13815 states and 20470 transitions. [2025-03-03 15:17:46,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 13815 states and 20470 transitions. [2025-03-03 15:17:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:17:46,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:46,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:46,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:17:46,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:46,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash -611208693, now seen corresponding path program 1 times [2025-03-03 15:17:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:46,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065967476] [2025-03-03 15:17:46,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:46,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:17:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:17:46,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:46,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065967476] [2025-03-03 15:17:46,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065967476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:46,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:46,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:17:46,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969875872] [2025-03-03 15:17:46,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:46,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:17:46,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:46,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:17:46,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:17:46,919 INFO L87 Difference]: Start difference. First operand 13815 states and 20470 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:46,972 INFO L93 Difference]: Finished difference Result 27390 states and 40828 transitions. [2025-03-03 15:17:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:17:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:17:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:47,004 INFO L225 Difference]: With dead ends: 27390 [2025-03-03 15:17:47,004 INFO L226 Difference]: Without dead ends: 19963 [2025-03-03 15:17:47,015 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-03-03 15:17:47,016 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 117 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:47,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 414 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:17:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2025-03-03 15:17:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19961. [2025-03-03 15:17:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19961 states, 19960 states have (on average 1.4777555110220442) internal successors, (29496), 19960 states have internal predecessors, (29496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19961 states to 19961 states and 29496 transitions. [2025-03-03 15:17:47,341 INFO L78 Accepts]: Start accepts. Automaton has 19961 states and 29496 transitions. Word has length 96 [2025-03-03 15:17:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:47,341 INFO L471 AbstractCegarLoop]: Abstraction has 19961 states and 29496 transitions. [2025-03-03 15:17:47,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 19961 states and 29496 transitions. [2025-03-03 15:17:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:17:47,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:47,348 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:47,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:17:47,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1978375539, now seen corresponding path program 1 times [2025-03-03 15:17:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387515706] [2025-03-03 15:17:47,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:17:47,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:17:47,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:47,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:17:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387515706] [2025-03-03 15:17:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387515706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:47,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:47,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810712696] [2025-03-03 15:17:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:47,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:47,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:47,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:47,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:47,580 INFO L87 Difference]: Start difference. First operand 19961 states and 29496 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:48,187 INFO L93 Difference]: Finished difference Result 162953 states and 240832 transitions. [2025-03-03 15:17:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-03 15:17:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:48,390 INFO L225 Difference]: With dead ends: 162953 [2025-03-03 15:17:48,391 INFO L226 Difference]: Without dead ends: 143047 [2025-03-03 15:17:48,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:48,420 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1624 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:48,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 2549 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:17:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143047 states. [2025-03-03 15:17:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143047 to 39865. [2025-03-03 15:17:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39865 states, 39864 states have (on average 1.4736102749347781) internal successors, (58744), 39864 states have internal predecessors, (58744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39865 states to 39865 states and 58744 transitions. [2025-03-03 15:17:49,361 INFO L78 Accepts]: Start accepts. Automaton has 39865 states and 58744 transitions. Word has length 131 [2025-03-03 15:17:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:49,361 INFO L471 AbstractCegarLoop]: Abstraction has 39865 states and 58744 transitions. [2025-03-03 15:17:49,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 39865 states and 58744 transitions. [2025-03-03 15:17:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:17:49,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:49,369 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:49,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:17:49,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:49,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash 355717395, now seen corresponding path program 1 times [2025-03-03 15:17:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:49,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940017636] [2025-03-03 15:17:49,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:49,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:17:49,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:17:49,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:49,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:17:49,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940017636] [2025-03-03 15:17:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940017636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:49,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622481035] [2025-03-03 15:17:49,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:49,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:49,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:49,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:49,685 INFO L87 Difference]: Start difference. First operand 39865 states and 58744 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:50,246 INFO L93 Difference]: Finished difference Result 182857 states and 270080 transitions. [2025-03-03 15:17:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:50,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-03 15:17:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:50,643 INFO L225 Difference]: With dead ends: 182857 [2025-03-03 15:17:50,643 INFO L226 Difference]: Without dead ends: 162951 [2025-03-03 15:17:50,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:50,685 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 1657 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:50,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 2359 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:17:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162951 states. [2025-03-03 15:17:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162951 to 69753. [2025-03-03 15:17:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69753 states, 69752 states have (on average 1.4688611079252207) internal successors, (102456), 69752 states have internal predecessors, (102456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69753 states to 69753 states and 102456 transitions. [2025-03-03 15:17:51,849 INFO L78 Accepts]: Start accepts. Automaton has 69753 states and 102456 transitions. Word has length 131 [2025-03-03 15:17:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:51,849 INFO L471 AbstractCegarLoop]: Abstraction has 69753 states and 102456 transitions. [2025-03-03 15:17:51,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 69753 states and 102456 transitions. [2025-03-03 15:17:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:17:51,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:51,858 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:51,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:17:51,858 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1830366029, now seen corresponding path program 1 times [2025-03-03 15:17:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:51,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007486826] [2025-03-03 15:17:51,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:17:51,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:17:51,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:51,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:17:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:52,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007486826] [2025-03-03 15:17:52,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007486826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:52,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:52,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543703305] [2025-03-03 15:17:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:52,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:52,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:52,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:52,034 INFO L87 Difference]: Start difference. First operand 69753 states and 102456 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:52,841 INFO L93 Difference]: Finished difference Result 202761 states and 299328 transitions. [2025-03-03 15:17:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:52,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-03 15:17:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:53,044 INFO L225 Difference]: With dead ends: 202761 [2025-03-03 15:17:53,044 INFO L226 Difference]: Without dead ends: 182855 [2025-03-03 15:17:53,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:53,106 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1715 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:53,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 2259 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:17:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182855 states. [2025-03-03 15:17:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182855 to 89657. [2025-03-03 15:17:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89657 states, 89656 states have (on average 1.4689925939145176) internal successors, (131704), 89656 states have internal predecessors, (131704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89657 states to 89657 states and 131704 transitions. [2025-03-03 15:17:54,557 INFO L78 Accepts]: Start accepts. Automaton has 89657 states and 131704 transitions. Word has length 131 [2025-03-03 15:17:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:54,558 INFO L471 AbstractCegarLoop]: Abstraction has 89657 states and 131704 transitions. [2025-03-03 15:17:54,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 89657 states and 131704 transitions. [2025-03-03 15:17:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:17:54,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:54,566 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:17:54,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash -185817005, now seen corresponding path program 1 times [2025-03-03 15:17:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896356366] [2025-03-03 15:17:54,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:54,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:17:54,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:17:54,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:54,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 15:17:54,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:54,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896356366] [2025-03-03 15:17:54,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896356366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:54,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:54,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322044215] [2025-03-03 15:17:54,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:54,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:54,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:54,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:54,949 INFO L87 Difference]: Start difference. First operand 89657 states and 131704 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:55,663 INFO L93 Difference]: Finished difference Result 222665 states and 328576 transitions. [2025-03-03 15:17:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-03 15:17:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:56,157 INFO L225 Difference]: With dead ends: 222665 [2025-03-03 15:17:56,157 INFO L226 Difference]: Without dead ends: 202759 [2025-03-03 15:17:56,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:56,201 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1780 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:56,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 2248 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:17:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202759 states. [2025-03-03 15:17:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202759 to 109561. [2025-03-03 15:17:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109561 states, 109560 states have (on average 1.4690763052208835) internal successors, (160952), 109560 states have internal predecessors, (160952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109561 states to 109561 states and 160952 transitions. [2025-03-03 15:17:57,656 INFO L78 Accepts]: Start accepts. Automaton has 109561 states and 160952 transitions. Word has length 131 [2025-03-03 15:17:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:57,656 INFO L471 AbstractCegarLoop]: Abstraction has 109561 states and 160952 transitions. [2025-03-03 15:17:57,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 109561 states and 160952 transitions. [2025-03-03 15:17:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:17:57,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:57,666 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:17:57,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:17:57,666 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:57,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1965902835, now seen corresponding path program 1 times [2025-03-03 15:17:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634228633] [2025-03-03 15:17:57,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:57,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:17:57,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:17:57,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:57,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:17:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634228633] [2025-03-03 15:17:58,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634228633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:58,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:58,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:17:58,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287888237] [2025-03-03 15:17:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:58,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:58,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:58,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:58,109 INFO L87 Difference]: Start difference. First operand 109561 states and 160952 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:58,979 INFO L93 Difference]: Finished difference Result 242569 states and 357824 transitions. [2025-03-03 15:17:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:17:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-03 15:17:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:59,245 INFO L225 Difference]: With dead ends: 242569 [2025-03-03 15:17:59,246 INFO L226 Difference]: Without dead ends: 222663 [2025-03-03 15:17:59,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:17:59,323 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1870 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:59,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 2285 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:17:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222663 states. [2025-03-03 15:18:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222663 to 129465. [2025-03-03 15:18:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129465 states, 129464 states have (on average 1.4691342767101279) internal successors, (190200), 129464 states have internal predecessors, (190200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129465 states to 129465 states and 190200 transitions. [2025-03-03 15:18:01,169 INFO L78 Accepts]: Start accepts. Automaton has 129465 states and 190200 transitions. Word has length 131 [2025-03-03 15:18:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:01,169 INFO L471 AbstractCegarLoop]: Abstraction has 129465 states and 190200 transitions. [2025-03-03 15:18:01,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 129465 states and 190200 transitions. [2025-03-03 15:18:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:18:01,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:01,176 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:18:01,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:18:01,176 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:01,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2121220205, now seen corresponding path program 1 times [2025-03-03 15:18:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867998778] [2025-03-03 15:18:01,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:01,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:18:01,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:18:01,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:01,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:18:01,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867998778] [2025-03-03 15:18:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867998778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037411543] [2025-03-03 15:18:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:01,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:01,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:01,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:01,323 INFO L87 Difference]: Start difference. First operand 129465 states and 190200 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:02,350 INFO L93 Difference]: Finished difference Result 262473 states and 387072 transitions. [2025-03-03 15:18:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-03 15:18:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:02,665 INFO L225 Difference]: With dead ends: 262473 [2025-03-03 15:18:02,665 INFO L226 Difference]: Without dead ends: 242567 [2025-03-03 15:18:02,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:02,747 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 1635 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:02,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 2550 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242567 states. [2025-03-03 15:18:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242567 to 149369. [2025-03-03 15:18:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149369 states, 149368 states have (on average 1.4691767982432649) internal successors, (219448), 149368 states have internal predecessors, (219448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149369 states to 149369 states and 219448 transitions. [2025-03-03 15:18:05,205 INFO L78 Accepts]: Start accepts. Automaton has 149369 states and 219448 transitions. Word has length 131 [2025-03-03 15:18:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:05,205 INFO L471 AbstractCegarLoop]: Abstraction has 149369 states and 219448 transitions. [2025-03-03 15:18:05,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 149369 states and 219448 transitions. [2025-03-03 15:18:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 15:18:05,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:05,218 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:18:05,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:18:05,218 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -399414194, now seen corresponding path program 1 times [2025-03-03 15:18:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413774317] [2025-03-03 15:18:05,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:05,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 15:18:05,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 15:18:05,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:05,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:18:05,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:05,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413774317] [2025-03-03 15:18:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413774317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:18:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212207277] [2025-03-03 15:18:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:05,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:05,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:05,354 INFO L87 Difference]: Start difference. First operand 149369 states and 219448 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:06,376 INFO L93 Difference]: Finished difference Result 269705 states and 397888 transitions. [2025-03-03 15:18:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:18:06,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-03-03 15:18:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:06,715 INFO L225 Difference]: With dead ends: 269705 [2025-03-03 15:18:06,715 INFO L226 Difference]: Without dead ends: 256135 [2025-03-03 15:18:06,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:18:06,793 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1611 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:06,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 2958 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:18:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256135 states. [2025-03-03 15:18:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256135 to 162937. [2025-03-03 15:18:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162937 states, 162936 states have (on average 1.4701723376049491) internal successors, (239544), 162936 states have internal predecessors, (239544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162937 states to 162937 states and 239544 transitions. [2025-03-03 15:18:09,499 INFO L78 Accepts]: Start accepts. Automaton has 162937 states and 239544 transitions. Word has length 132 [2025-03-03 15:18:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:09,499 INFO L471 AbstractCegarLoop]: Abstraction has 162937 states and 239544 transitions. [2025-03-03 15:18:09,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 162937 states and 239544 transitions. [2025-03-03 15:18:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 15:18:09,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:09,510 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:18:09,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:18:09,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash -209522097, now seen corresponding path program 1 times [2025-03-03 15:18:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:09,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052706973] [2025-03-03 15:18:09,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:09,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 15:18:09,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 15:18:09,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:09,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:09,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052706973] [2025-03-03 15:18:09,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052706973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:09,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:18:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107231568] [2025-03-03 15:18:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:09,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:18:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:09,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:18:09,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:18:09,584 INFO L87 Difference]: Start difference. First operand 162937 states and 239544 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:10,549 INFO L93 Difference]: Finished difference Result 278319 states and 410427 transitions. [2025-03-03 15:18:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:18:10,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-03 15:18:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:10,675 INFO L225 Difference]: With dead ends: 278319 [2025-03-03 15:18:10,675 INFO L226 Difference]: Without dead ends: 115437 [2025-03-03 15:18:10,723 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-03-03 15:18:10,723 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 84 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 406 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-03-03 15:18:10,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 406 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:18:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115437 states. [2025-03-03 15:18:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115437 to 115435. [2025-03-03 15:18:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115435 states, 115434 states have (on average 1.4713862466864183) internal successors, (169848), 115434 states have internal predecessors, (169848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115435 states to 115435 states and 169848 transitions. [2025-03-03 15:18:12,172 INFO L78 Accepts]: Start accepts. Automaton has 115435 states and 169848 transitions. Word has length 133 [2025-03-03 15:18:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:12,172 INFO L471 AbstractCegarLoop]: Abstraction has 115435 states and 169848 transitions. [2025-03-03 15:18:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 115435 states and 169848 transitions. [2025-03-03 15:18:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 15:18:12,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:12,179 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 15:18:12,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:18:12,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:18:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2125348722, now seen corresponding path program 1 times [2025-03-03 15:18:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011572880] [2025-03-03 15:18:12,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:12,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 15:18:12,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 15:18:12,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011572880] [2025-03-03 15:18:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011572880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:18:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976675851] [2025-03-03 15:18:12,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:12,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:18:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:18:12,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:18:12,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:18:12,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 15:18:12,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 15:18:12,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:18:12,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:18:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:13,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:18:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976675851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:18:13,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:18:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 22 [2025-03-03 15:18:13,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379815992] [2025-03-03 15:18:13,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:18:13,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 15:18:13,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:13,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 15:18:13,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:18:13,659 INFO L87 Difference]: Start difference. First operand 115435 states and 169848 transitions. Second operand has 22 states, 22 states have (on average 17.681818181818183) internal successors, (389), 22 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:23,123 INFO L93 Difference]: Finished difference Result 1526344 states and 2221561 transitions. [2025-03-03 15:18:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-03-03 15:18:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 17.681818181818183) internal successors, (389), 22 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-03 15:18:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:25,093 INFO L225 Difference]: With dead ends: 1526344 [2025-03-03 15:18:25,093 INFO L226 Difference]: Without dead ends: 1402677