./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-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 ff8f3f7dc837fc67a7020fd9a9dd65135ef198f3603f2c180bcb5ad9943191ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:28:02,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:28:03,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:28:03,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:28:03,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:28:03,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:28:03,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:28:03,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:28:03,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:28:03,063 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:28:03,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:28:03,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:28:03,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:28:03,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:28:03,064 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:28:03,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:28:03,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:28:03,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:28:03,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:28:03,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:28:03,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:03,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:28:03,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:28:03,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:28:03,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:28:03,067 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 -> ff8f3f7dc837fc67a7020fd9a9dd65135ef198f3603f2c180bcb5ad9943191ea [2025-03-16 19:28:03,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:28:03,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:28:03,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:28:03,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:28:03,303 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:28:03,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:28:04,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc8f4ac4/c3fb95cb5a5c468bb9276473416ac01b/FLAG44204ffee [2025-03-16 19:28:04,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:28:04,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:28:04,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc8f4ac4/c3fb95cb5a5c468bb9276473416ac01b/FLAG44204ffee [2025-03-16 19:28:04,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fc8f4ac4/c3fb95cb5a5c468bb9276473416ac01b [2025-03-16 19:28:04,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:28:04,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:28:04,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:04,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:28:04,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:28:04,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:04" (1/1) ... [2025-03-16 19:28:04,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29785afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:04, skipping insertion in model container [2025-03-16 19:28:04,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:04" (1/1) ... [2025-03-16 19:28:05,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:28:05,183 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-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2025-03-16 19:28:05,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:05,262 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:28:05,295 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-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2025-03-16 19:28:05,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:05,338 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:28:05,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05 WrapperNode [2025-03-16 19:28:05,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:05,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:05,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:28:05,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:28:05,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,380 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 866 [2025-03-16 19:28:05,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:05,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:28:05,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:28:05,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:28:05,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,402 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-16 19:28:05,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,410 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:28:05,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:28:05,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:28:05,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:28:05,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (1/1) ... [2025-03-16 19:28:05,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:05,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:28:05,450 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-16 19:28:05,452 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-16 19:28:05,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:28:05,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:28:05,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:28:05,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:28:05,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:28:05,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L962: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1230: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: havoc main_~node2__m2~2#1; [2025-03-16 19:28:06,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4__m4~2#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1274: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1142: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L647: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L853: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1186: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L825: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: havoc main_~node3__m3~2#1; [2025-03-16 19:28:06,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:06,291 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-03-16 19:28:06,291 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:28:06,305 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:28:06,307 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:28:06,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:06 BoogieIcfgContainer [2025-03-16 19:28:06,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:28:06,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:28:06,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:28:06,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:28:06,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:28:04" (1/3) ... [2025-03-16 19:28:06,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d15aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:06, skipping insertion in model container [2025-03-16 19:28:06,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:05" (2/3) ... [2025-03-16 19:28:06,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d15aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:06, skipping insertion in model container [2025-03-16 19:28:06,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:06" (3/3) ... [2025-03-16 19:28:06,316 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:28:06,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:28:06,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 214 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:28:06,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:28:06,393 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;@56e8025a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:28:06,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:28:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 212 states have (on average 1.721698113207547) internal successors, (365), 213 states have internal predecessors, (365), 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-16 19:28:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:06,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:06,406 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] [2025-03-16 19:28:06,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:06,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 841444602, now seen corresponding path program 1 times [2025-03-16 19:28:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:06,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142894654] [2025-03-16 19:28:06,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:06,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:06,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:06,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:06,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:07,063 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-16 19:28:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:07,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142894654] [2025-03-16 19:28:07,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142894654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:07,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:07,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:07,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987884878] [2025-03-16 19:28:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:07,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:07,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:07,091 INFO L87 Difference]: Start difference. First operand has 214 states, 212 states have (on average 1.721698113207547) internal successors, (365), 213 states have internal predecessors, (365), 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 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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-16 19:28:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:07,354 INFO L93 Difference]: Finished difference Result 866 states and 1401 transitions. [2025-03-16 19:28:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 79 [2025-03-16 19:28:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:07,369 INFO L225 Difference]: With dead ends: 866 [2025-03-16 19:28:07,370 INFO L226 Difference]: Without dead ends: 746 [2025-03-16 19:28:07,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:07,374 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 2243 mSDsluCounter, 2659 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:07,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 3029 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-16 19:28:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 327. [2025-03-16 19:28:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.50920245398773) internal successors, (492), 326 states have internal predecessors, (492), 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-16 19:28:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 492 transitions. [2025-03-16 19:28:07,434 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 492 transitions. Word has length 79 [2025-03-16 19:28:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:07,435 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 492 transitions. [2025-03-16 19:28:07,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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-16 19:28:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 492 transitions. [2025-03-16 19:28:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:07,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:07,439 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] [2025-03-16 19:28:07,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:28:07,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:07,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 315939675, now seen corresponding path program 1 times [2025-03-16 19:28:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792704864] [2025-03-16 19:28:07,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:07,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:07,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:07,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:07,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:07,821 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-16 19:28:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:07,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792704864] [2025-03-16 19:28:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792704864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581908150] [2025-03-16 19:28:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:07,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:07,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:07,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:07,825 INFO L87 Difference]: Start difference. First operand 327 states and 492 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-16 19:28:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:08,013 INFO L93 Difference]: Finished difference Result 1423 states and 2209 transitions. [2025-03-16 19:28:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 80 [2025-03-16 19:28:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:08,020 INFO L225 Difference]: With dead ends: 1423 [2025-03-16 19:28:08,020 INFO L226 Difference]: Without dead ends: 1175 [2025-03-16 19:28:08,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:08,023 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1135 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:08,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1218 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-03-16 19:28:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1167. [2025-03-16 19:28:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1166 states have (on average 1.5480274442538593) internal successors, (1805), 1166 states have internal predecessors, (1805), 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-16 19:28:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1805 transitions. [2025-03-16 19:28:08,082 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1805 transitions. Word has length 80 [2025-03-16 19:28:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:08,082 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1805 transitions. [2025-03-16 19:28:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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-16 19:28:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1805 transitions. [2025-03-16 19:28:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:08,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:08,085 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] [2025-03-16 19:28:08,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:28:08,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:08,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:08,086 INFO L85 PathProgramCache]: Analyzing trace with hash 84436691, now seen corresponding path program 1 times [2025-03-16 19:28:08,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:08,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205060858] [2025-03-16 19:28:08,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:08,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:08,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:08,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:08,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:08,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:08,239 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-16 19:28:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:08,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205060858] [2025-03-16 19:28:08,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205060858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:08,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:08,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661890079] [2025-03-16 19:28:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:08,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:08,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:08,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:08,241 INFO L87 Difference]: Start difference. First operand 1167 states and 1805 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:08,462 INFO L93 Difference]: Finished difference Result 2992 states and 4696 transitions. [2025-03-16 19:28:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-03-16 19:28:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:08,470 INFO L225 Difference]: With dead ends: 2992 [2025-03-16 19:28:08,470 INFO L226 Difference]: Without dead ends: 1969 [2025-03-16 19:28:08,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:08,474 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1128 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:08,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 308 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-16 19:28:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1967. [2025-03-16 19:28:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 1.5595116988809765) internal successors, (3066), 1966 states have internal predecessors, (3066), 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-16 19:28:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3066 transitions. [2025-03-16 19:28:08,529 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3066 transitions. Word has length 81 [2025-03-16 19:28:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:08,530 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3066 transitions. [2025-03-16 19:28:08,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3066 transitions. [2025-03-16 19:28:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:08,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:08,532 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] [2025-03-16 19:28:08,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:28:08,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:08,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:08,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1767591041, now seen corresponding path program 1 times [2025-03-16 19:28:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:08,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151755468] [2025-03-16 19:28:08,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:08,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:08,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:08,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:08,672 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-16 19:28:08,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:08,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151755468] [2025-03-16 19:28:08,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151755468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:08,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:08,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710701251] [2025-03-16 19:28:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:08,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:08,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:08,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:08,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:08,676 INFO L87 Difference]: Start difference. First operand 1967 states and 3066 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:08,893 INFO L93 Difference]: Finished difference Result 5434 states and 8539 transitions. [2025-03-16 19:28:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:08,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-03-16 19:28:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:08,904 INFO L225 Difference]: With dead ends: 5434 [2025-03-16 19:28:08,904 INFO L226 Difference]: Without dead ends: 3577 [2025-03-16 19:28:08,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:08,910 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1130 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:08,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 299 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2025-03-16 19:28:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3575. [2025-03-16 19:28:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3575 states, 3574 states have (on average 1.5632344711807498) internal successors, (5587), 3574 states have internal predecessors, (5587), 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-16 19:28:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 5587 transitions. [2025-03-16 19:28:08,997 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 5587 transitions. Word has length 81 [2025-03-16 19:28:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:08,997 INFO L471 AbstractCegarLoop]: Abstraction has 3575 states and 5587 transitions. [2025-03-16 19:28:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 5587 transitions. [2025-03-16 19:28:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:09,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:09,000 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] [2025-03-16 19:28:09,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:28:09,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:09,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 850577963, now seen corresponding path program 1 times [2025-03-16 19:28:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336573589] [2025-03-16 19:28:09,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:09,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:09,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:09,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:09,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:09,128 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-16 19:28:09,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336573589] [2025-03-16 19:28:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336573589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:09,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:09,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:09,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231720085] [2025-03-16 19:28:09,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:09,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:09,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:09,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:09,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:09,131 INFO L87 Difference]: Start difference. First operand 3575 states and 5587 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:09,362 INFO L93 Difference]: Finished difference Result 10326 states and 16212 transitions. [2025-03-16 19:28:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-03-16 19:28:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:09,384 INFO L225 Difference]: With dead ends: 10326 [2025-03-16 19:28:09,384 INFO L226 Difference]: Without dead ends: 6831 [2025-03-16 19:28:09,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:09,393 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1156 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:09,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 297 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6831 states. [2025-03-16 19:28:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6831 to 6829. [2025-03-16 19:28:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6829 states, 6828 states have (on average 1.5619507908611598) internal successors, (10665), 6828 states have internal predecessors, (10665), 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-16 19:28:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6829 states to 6829 states and 10665 transitions. [2025-03-16 19:28:09,549 INFO L78 Accepts]: Start accepts. Automaton has 6829 states and 10665 transitions. Word has length 81 [2025-03-16 19:28:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:09,550 INFO L471 AbstractCegarLoop]: Abstraction has 6829 states and 10665 transitions. [2025-03-16 19:28:09,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6829 states and 10665 transitions. [2025-03-16 19:28:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:09,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:09,557 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] [2025-03-16 19:28:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:28:09,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1463659223, now seen corresponding path program 1 times [2025-03-16 19:28:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984737245] [2025-03-16 19:28:09,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:09,641 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-16 19:28:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984737245] [2025-03-16 19:28:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984737245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838817438] [2025-03-16 19:28:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:09,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:09,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:09,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:09,643 INFO L87 Difference]: Start difference. First operand 6829 states and 10665 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:09,870 INFO L93 Difference]: Finished difference Result 20143 states and 31539 transitions. [2025-03-16 19:28:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:09,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-03-16 19:28:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:09,907 INFO L225 Difference]: With dead ends: 20143 [2025-03-16 19:28:09,908 INFO L226 Difference]: Without dead ends: 13371 [2025-03-16 19:28:09,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:09,920 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1182 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:09,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 295 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2025-03-16 19:28:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 13369. [2025-03-16 19:28:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13369 states, 13368 states have (on average 1.5567025733093955) internal successors, (20810), 13368 states have internal predecessors, (20810), 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-16 19:28:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 20810 transitions. [2025-03-16 19:28:10,152 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 20810 transitions. Word has length 81 [2025-03-16 19:28:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 13369 states and 20810 transitions. [2025-03-16 19:28:10,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 20810 transitions. [2025-03-16 19:28:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:10,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:10,156 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] [2025-03-16 19:28:10,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:28:10,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:10,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2066721405, now seen corresponding path program 1 times [2025-03-16 19:28:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864988877] [2025-03-16 19:28:10,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:10,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:10,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:10,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:10,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:10,238 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-16 19:28:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864988877] [2025-03-16 19:28:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864988877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422840761] [2025-03-16 19:28:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:10,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:10,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:10,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:10,240 INFO L87 Difference]: Start difference. First operand 13369 states and 20810 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:10,503 INFO L93 Difference]: Finished difference Result 39776 states and 61995 transitions. [2025-03-16 19:28:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-03-16 19:28:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:10,554 INFO L225 Difference]: With dead ends: 39776 [2025-03-16 19:28:10,554 INFO L226 Difference]: Without dead ends: 26448 [2025-03-16 19:28:10,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:10,635 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1206 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:10,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 293 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26448 states. [2025-03-16 19:28:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26448 to 26446. [2025-03-16 19:28:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26446 states, 26445 states have (on average 1.5480809226696919) internal successors, (40939), 26445 states have internal predecessors, (40939), 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-16 19:28:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26446 states to 26446 states and 40939 transitions. [2025-03-16 19:28:11,021 INFO L78 Accepts]: Start accepts. Automaton has 26446 states and 40939 transitions. Word has length 81 [2025-03-16 19:28:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:11,021 INFO L471 AbstractCegarLoop]: Abstraction has 26446 states and 40939 transitions. [2025-03-16 19:28:11,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 19:28:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26446 states and 40939 transitions. [2025-03-16 19:28:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:11,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:11,027 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] [2025-03-16 19:28:11,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:28:11,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:11,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash -139070179, now seen corresponding path program 1 times [2025-03-16 19:28:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165785439] [2025-03-16 19:28:11,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:11,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:11,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:11,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:11,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:11,289 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-16 19:28:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165785439] [2025-03-16 19:28:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165785439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:28:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172105178] [2025-03-16 19:28:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:11,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:11,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:11,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:11,291 INFO L87 Difference]: Start difference. First operand 26446 states and 40939 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-16 19:28:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:11,368 INFO L93 Difference]: Finished difference Result 27088 states and 41900 transitions. [2025-03-16 19:28:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 82 [2025-03-16 19:28:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:11,419 INFO L225 Difference]: With dead ends: 27088 [2025-03-16 19:28:11,419 INFO L226 Difference]: Without dead ends: 27086 [2025-03-16 19:28:11,429 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-16 19:28:11,430 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:11,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1162 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27086 states. [2025-03-16 19:28:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27086 to 27086. [2025-03-16 19:28:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27086 states, 27085 states have (on average 1.5351301458371793) internal successors, (41579), 27085 states have internal predecessors, (41579), 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-16 19:28:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27086 states to 27086 states and 41579 transitions. [2025-03-16 19:28:11,765 INFO L78 Accepts]: Start accepts. Automaton has 27086 states and 41579 transitions. Word has length 82 [2025-03-16 19:28:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:11,766 INFO L471 AbstractCegarLoop]: Abstraction has 27086 states and 41579 transitions. [2025-03-16 19:28:11,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-16 19:28:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 27086 states and 41579 transitions. [2025-03-16 19:28:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:11,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:11,771 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] [2025-03-16 19:28:11,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:28:11,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:11,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash -11434216, now seen corresponding path program 1 times [2025-03-16 19:28:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400955896] [2025-03-16 19:28:11,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:11,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:11,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:11,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:11,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:12,160 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-16 19:28:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400955896] [2025-03-16 19:28:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400955896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041433814] [2025-03-16 19:28:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:12,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:12,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:12,162 INFO L87 Difference]: Start difference. First operand 27086 states and 41579 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:12,730 INFO L93 Difference]: Finished difference Result 33699 states and 51370 transitions. [2025-03-16 19:28:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:28:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2025-03-16 19:28:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:12,783 INFO L225 Difference]: With dead ends: 33699 [2025-03-16 19:28:12,783 INFO L226 Difference]: Without dead ends: 30608 [2025-03-16 19:28:12,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:28:12,797 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1195 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:12,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 931 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:28:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30608 states. [2025-03-16 19:28:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30608 to 27086. [2025-03-16 19:28:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27086 states, 27085 states have (on average 1.5350932250323057) internal successors, (41578), 27085 states have internal predecessors, (41578), 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-16 19:28:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27086 states to 27086 states and 41578 transitions. [2025-03-16 19:28:13,128 INFO L78 Accepts]: Start accepts. Automaton has 27086 states and 41578 transitions. Word has length 83 [2025-03-16 19:28:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:13,128 INFO L471 AbstractCegarLoop]: Abstraction has 27086 states and 41578 transitions. [2025-03-16 19:28:13,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 27086 states and 41578 transitions. [2025-03-16 19:28:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:13,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:13,133 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] [2025-03-16 19:28:13,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:28:13,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:13,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2135667352, now seen corresponding path program 1 times [2025-03-16 19:28:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287276398] [2025-03-16 19:28:13,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:13,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:13,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:13,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:13,502 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-16 19:28:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287276398] [2025-03-16 19:28:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287276398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:13,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795004079] [2025-03-16 19:28:13,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:13,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:13,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:13,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:13,503 INFO L87 Difference]: Start difference. First operand 27086 states and 41578 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:14,200 INFO L93 Difference]: Finished difference Result 43547 states and 66237 transitions. [2025-03-16 19:28:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:28:14,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2025-03-16 19:28:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:14,249 INFO L225 Difference]: With dead ends: 43547 [2025-03-16 19:28:14,249 INFO L226 Difference]: Without dead ends: 34713 [2025-03-16 19:28:14,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:28:14,268 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1444 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:14,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 961 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34713 states. [2025-03-16 19:28:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34713 to 27495. [2025-03-16 19:28:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27495 states, 27494 states have (on average 1.5341892776605806) internal successors, (42181), 27494 states have internal predecessors, (42181), 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-16 19:28:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27495 states to 27495 states and 42181 transitions. [2025-03-16 19:28:14,767 INFO L78 Accepts]: Start accepts. Automaton has 27495 states and 42181 transitions. Word has length 83 [2025-03-16 19:28:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:14,767 INFO L471 AbstractCegarLoop]: Abstraction has 27495 states and 42181 transitions. [2025-03-16 19:28:14,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27495 states and 42181 transitions. [2025-03-16 19:28:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:14,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:14,772 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] [2025-03-16 19:28:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:28:14,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:14,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -683401704, now seen corresponding path program 1 times [2025-03-16 19:28:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:14,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680250018] [2025-03-16 19:28:14,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:14,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:14,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:14,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:14,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:14,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:14,980 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-16 19:28:14,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680250018] [2025-03-16 19:28:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680250018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:14,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:14,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649705364] [2025-03-16 19:28:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:14,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:14,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:14,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:14,982 INFO L87 Difference]: Start difference. First operand 27495 states and 42181 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:15,569 INFO L93 Difference]: Finished difference Result 52002 states and 79199 transitions. [2025-03-16 19:28:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:28:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2025-03-16 19:28:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:15,614 INFO L225 Difference]: With dead ends: 52002 [2025-03-16 19:28:15,614 INFO L226 Difference]: Without dead ends: 37578 [2025-03-16 19:28:15,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:28:15,637 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1250 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:15,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1029 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37578 states. [2025-03-16 19:28:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37578 to 27915. [2025-03-16 19:28:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27915 states, 27914 states have (on average 1.531453750806047) internal successors, (42749), 27914 states have internal predecessors, (42749), 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-16 19:28:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27915 states to 27915 states and 42749 transitions. [2025-03-16 19:28:16,129 INFO L78 Accepts]: Start accepts. Automaton has 27915 states and 42749 transitions. Word has length 83 [2025-03-16 19:28:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:16,129 INFO L471 AbstractCegarLoop]: Abstraction has 27915 states and 42749 transitions. [2025-03-16 19:28:16,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 27915 states and 42749 transitions. [2025-03-16 19:28:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:16,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:16,135 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] [2025-03-16 19:28:16,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:28:16,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1578813848, now seen corresponding path program 1 times [2025-03-16 19:28:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83948068] [2025-03-16 19:28:16,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:16,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:16,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:16,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:16,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:16,400 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-16 19:28:16,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:16,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83948068] [2025-03-16 19:28:16,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83948068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:16,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:16,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:16,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398524353] [2025-03-16 19:28:16,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:16,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:16,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:16,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:16,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:16,401 INFO L87 Difference]: Start difference. First operand 27915 states and 42749 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:17,018 INFO L93 Difference]: Finished difference Result 60543 states and 92084 transitions. [2025-03-16 19:28:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:28:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2025-03-16 19:28:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:17,065 INFO L225 Difference]: With dead ends: 60543 [2025-03-16 19:28:17,066 INFO L226 Difference]: Without dead ends: 40824 [2025-03-16 19:28:17,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:28:17,094 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1283 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:17,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1031 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40824 states. [2025-03-16 19:28:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40824 to 28332. [2025-03-16 19:28:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28332 states, 28331 states have (on average 1.5279375948607532) internal successors, (43288), 28331 states have internal predecessors, (43288), 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-16 19:28:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 43288 transitions. [2025-03-16 19:28:17,556 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 43288 transitions. Word has length 83 [2025-03-16 19:28:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:17,556 INFO L471 AbstractCegarLoop]: Abstraction has 28332 states and 43288 transitions. [2025-03-16 19:28:17,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 43288 transitions. [2025-03-16 19:28:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:17,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:17,563 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] [2025-03-16 19:28:17,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:28:17,563 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:17,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -89148136, now seen corresponding path program 1 times [2025-03-16 19:28:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:17,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339083249] [2025-03-16 19:28:17,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:17,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:17,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:17,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:17,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:17,867 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-16 19:28:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339083249] [2025-03-16 19:28:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339083249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:17,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688265118] [2025-03-16 19:28:17,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:17,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:17,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:17,869 INFO L87 Difference]: Start difference. First operand 28332 states and 43288 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:18,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:18,691 INFO L93 Difference]: Finished difference Result 70380 states and 106924 transitions. [2025-03-16 19:28:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:28:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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 83 [2025-03-16 19:28:18,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:18,747 INFO L225 Difference]: With dead ends: 70380 [2025-03-16 19:28:18,748 INFO L226 Difference]: Without dead ends: 43490 [2025-03-16 19:28:18,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:28:18,779 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 928 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:18,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1652 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:28:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43490 states. [2025-03-16 19:28:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43490 to 28691. [2025-03-16 19:28:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28691 states, 28690 states have (on average 1.5231439525967236) internal successors, (43699), 28690 states have internal predecessors, (43699), 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-16 19:28:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28691 states to 28691 states and 43699 transitions. [2025-03-16 19:28:19,357 INFO L78 Accepts]: Start accepts. Automaton has 28691 states and 43699 transitions. Word has length 83 [2025-03-16 19:28:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:19,357 INFO L471 AbstractCegarLoop]: Abstraction has 28691 states and 43699 transitions. [2025-03-16 19:28:19,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 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-16 19:28:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28691 states and 43699 transitions. [2025-03-16 19:28:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:19,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:19,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] [2025-03-16 19:28:19,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:28:19,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:19,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 254141987, now seen corresponding path program 1 times [2025-03-16 19:28:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:19,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608735593] [2025-03-16 19:28:19,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:19,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:19,482 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-16 19:28:19,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:19,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608735593] [2025-03-16 19:28:19,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608735593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:19,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:19,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041925985] [2025-03-16 19:28:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:19,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:19,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:19,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:19,486 INFO L87 Difference]: Start difference. First operand 28691 states and 43699 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-16 19:28:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:19,617 INFO L93 Difference]: Finished difference Result 77911 states and 118997 transitions. [2025-03-16 19:28:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:19,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-16 19:28:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:19,681 INFO L225 Difference]: With dead ends: 77911 [2025-03-16 19:28:19,681 INFO L226 Difference]: Without dead ends: 51669 [2025-03-16 19:28:19,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:19,709 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 203 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 731 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-16 19:28:19,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 731 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51669 states. [2025-03-16 19:28:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51669 to 51363. [2025-03-16 19:28:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51363 states, 51362 states have (on average 1.5133951170125775) internal successors, (77731), 51362 states have internal predecessors, (77731), 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-16 19:28:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51363 states to 51363 states and 77731 transitions. [2025-03-16 19:28:20,284 INFO L78 Accepts]: Start accepts. Automaton has 51363 states and 77731 transitions. Word has length 84 [2025-03-16 19:28:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:20,285 INFO L471 AbstractCegarLoop]: Abstraction has 51363 states and 77731 transitions. [2025-03-16 19:28:20,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-16 19:28:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 51363 states and 77731 transitions. [2025-03-16 19:28:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:20,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:20,290 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] [2025-03-16 19:28:20,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:28:20,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:20,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1722645317, now seen corresponding path program 1 times [2025-03-16 19:28:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:20,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273214294] [2025-03-16 19:28:20,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:20,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:20,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:20,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:20,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:20,336 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-16 19:28:20,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:20,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273214294] [2025-03-16 19:28:20,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273214294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:20,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120014956] [2025-03-16 19:28:20,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:20,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:20,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:20,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:20,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:20,338 INFO L87 Difference]: Start difference. First operand 51363 states and 77731 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:20,824 INFO L93 Difference]: Finished difference Result 131707 states and 199864 transitions. [2025-03-16 19:28:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-16 19:28:20,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:20,929 INFO L225 Difference]: With dead ends: 131707 [2025-03-16 19:28:20,929 INFO L226 Difference]: Without dead ends: 88647 [2025-03-16 19:28:20,947 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-16 19:28:20,947 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 213 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:20,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 565 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88647 states. [2025-03-16 19:28:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88647 to 88517. [2025-03-16 19:28:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88517 states, 88516 states have (on average 1.5086876948800216) internal successors, (133543), 88516 states have internal predecessors, (133543), 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-16 19:28:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88517 states to 88517 states and 133543 transitions. [2025-03-16 19:28:22,163 INFO L78 Accepts]: Start accepts. Automaton has 88517 states and 133543 transitions. Word has length 84 [2025-03-16 19:28:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 88517 states and 133543 transitions. [2025-03-16 19:28:22,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88517 states and 133543 transitions. [2025-03-16 19:28:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:22,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:22,171 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] [2025-03-16 19:28:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:28:22,171 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:22,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -882109218, now seen corresponding path program 1 times [2025-03-16 19:28:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422067596] [2025-03-16 19:28:22,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:22,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:22,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:22,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:22,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:22,252 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-16 19:28:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422067596] [2025-03-16 19:28:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422067596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557534510] [2025-03-16 19:28:22,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:22,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:22,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:22,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:22,258 INFO L87 Difference]: Start difference. First operand 88517 states and 133543 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:22,521 INFO L93 Difference]: Finished difference Result 119419 states and 179921 transitions. [2025-03-16 19:28:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:22,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-16 19:28:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:22,808 INFO L225 Difference]: With dead ends: 119419 [2025-03-16 19:28:22,808 INFO L226 Difference]: Without dead ends: 97061 [2025-03-16 19:28:22,836 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-16 19:28:22,838 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 175 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:22,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 677 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97061 states. [2025-03-16 19:28:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97061 to 86907. [2025-03-16 19:28:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86907 states, 86906 states have (on average 1.4886083814696338) internal successors, (129369), 86906 states have internal predecessors, (129369), 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-16 19:28:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86907 states to 86907 states and 129369 transitions. [2025-03-16 19:28:23,879 INFO L78 Accepts]: Start accepts. Automaton has 86907 states and 129369 transitions. Word has length 84 [2025-03-16 19:28:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:23,880 INFO L471 AbstractCegarLoop]: Abstraction has 86907 states and 129369 transitions. [2025-03-16 19:28:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 86907 states and 129369 transitions. [2025-03-16 19:28:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:23,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:23,888 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] [2025-03-16 19:28:23,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:28:23,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:23,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1771877820, now seen corresponding path program 1 times [2025-03-16 19:28:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791995438] [2025-03-16 19:28:23,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:23,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:23,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:23,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:23,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:23,938 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-16 19:28:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791995438] [2025-03-16 19:28:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791995438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597347438] [2025-03-16 19:28:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:23,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:23,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:23,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:23,940 INFO L87 Difference]: Start difference. First operand 86907 states and 129369 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:24,393 INFO L93 Difference]: Finished difference Result 139394 states and 207758 transitions. [2025-03-16 19:28:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-16 19:28:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:24,551 INFO L225 Difference]: With dead ends: 139394 [2025-03-16 19:28:24,551 INFO L226 Difference]: Without dead ends: 98594 [2025-03-16 19:28:24,605 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-16 19:28:24,606 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 181 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:24,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 609 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98594 states. [2025-03-16 19:28:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98594 to 97640. [2025-03-16 19:28:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97640 states, 97639 states have (on average 1.4680301928532655) internal successors, (143337), 97639 states have internal predecessors, (143337), 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-16 19:28:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97640 states to 97640 states and 143337 transitions. [2025-03-16 19:28:25,797 INFO L78 Accepts]: Start accepts. Automaton has 97640 states and 143337 transitions. Word has length 84 [2025-03-16 19:28:25,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:25,797 INFO L471 AbstractCegarLoop]: Abstraction has 97640 states and 143337 transitions. [2025-03-16 19:28:25,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand 97640 states and 143337 transitions. [2025-03-16 19:28:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:25,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:25,805 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] [2025-03-16 19:28:25,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:28:25,805 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash -516604635, now seen corresponding path program 1 times [2025-03-16 19:28:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:25,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366193027] [2025-03-16 19:28:25,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:25,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:25,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:25,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:25,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:25,842 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-16 19:28:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:25,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366193027] [2025-03-16 19:28:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366193027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:25,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:25,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846917004] [2025-03-16 19:28:25,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:25,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:25,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:25,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:25,843 INFO L87 Difference]: Start difference. First operand 97640 states and 143337 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:26,496 INFO L93 Difference]: Finished difference Result 187608 states and 275403 transitions. [2025-03-16 19:28:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:26,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-16 19:28:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:26,646 INFO L225 Difference]: With dead ends: 187608 [2025-03-16 19:28:26,646 INFO L226 Difference]: Without dead ends: 116802 [2025-03-16 19:28:26,708 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-16 19:28:26,709 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 191 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:26,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 562 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116802 states. [2025-03-16 19:28:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116802 to 115752. [2025-03-16 19:28:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115752 states, 115751 states have (on average 1.443339582379418) internal successors, (167068), 115751 states have internal predecessors, (167068), 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-16 19:28:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115752 states to 115752 states and 167068 transitions. [2025-03-16 19:28:28,391 INFO L78 Accepts]: Start accepts. Automaton has 115752 states and 167068 transitions. Word has length 84 [2025-03-16 19:28:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:28,391 INFO L471 AbstractCegarLoop]: Abstraction has 115752 states and 167068 transitions. [2025-03-16 19:28:28,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 115752 states and 167068 transitions. [2025-03-16 19:28:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:28,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:28,399 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] [2025-03-16 19:28:28,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:28:28,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 547351460, now seen corresponding path program 1 times [2025-03-16 19:28:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279358540] [2025-03-16 19:28:28,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:28,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:28,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:28,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:28,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:28,436 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-16 19:28:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:28,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279358540] [2025-03-16 19:28:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279358540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312787767] [2025-03-16 19:28:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:28,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:28,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:28,437 INFO L87 Difference]: Start difference. First operand 115752 states and 167068 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:29,294 INFO L93 Difference]: Finished difference Result 245738 states and 353728 transitions. [2025-03-16 19:28:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:29,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-03-16 19:28:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:29,477 INFO L225 Difference]: With dead ends: 245738 [2025-03-16 19:28:29,477 INFO L226 Difference]: Without dead ends: 139408 [2025-03-16 19:28:29,524 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-16 19:28:29,525 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 201 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:29,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 559 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139408 states. [2025-03-16 19:28:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139408 to 138470. [2025-03-16 19:28:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138470 states, 138469 states have (on average 1.4137243715199792) internal successors, (195757), 138469 states have internal predecessors, (195757), 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-16 19:28:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138470 states to 138470 states and 195757 transitions. [2025-03-16 19:28:31,336 INFO L78 Accepts]: Start accepts. Automaton has 138470 states and 195757 transitions. Word has length 84 [2025-03-16 19:28:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:31,336 INFO L471 AbstractCegarLoop]: Abstraction has 138470 states and 195757 transitions. [2025-03-16 19:28:31,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-16 19:28:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 138470 states and 195757 transitions. [2025-03-16 19:28:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:31,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:31,345 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] [2025-03-16 19:28:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:28:31,345 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:31,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 920146611, now seen corresponding path program 1 times [2025-03-16 19:28:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:31,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586903340] [2025-03-16 19:28:31,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:31,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:31,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:31,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:31,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:31,461 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-16 19:28:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:31,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586903340] [2025-03-16 19:28:31,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586903340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:31,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:31,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:31,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14069145] [2025-03-16 19:28:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:31,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:31,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:31,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:31,463 INFO L87 Difference]: Start difference. First operand 138470 states and 195757 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-16 19:28:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:32,481 INFO L93 Difference]: Finished difference Result 296939 states and 422979 transitions. [2025-03-16 19:28:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2025-03-16 19:28:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:32,844 INFO L225 Difference]: With dead ends: 296939 [2025-03-16 19:28:32,845 INFO L226 Difference]: Without dead ends: 282384 [2025-03-16 19:28:32,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:32,922 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 2015 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:32,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2015 Valid, 1586 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282384 states. [2025-03-16 19:28:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282384 to 152807. [2025-03-16 19:28:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152807 states, 152806 states have (on average 1.41413295289452) internal successors, (216088), 152806 states have internal predecessors, (216088), 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-16 19:28:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152807 states to 152807 states and 216088 transitions. [2025-03-16 19:28:35,684 INFO L78 Accepts]: Start accepts. Automaton has 152807 states and 216088 transitions. Word has length 85 [2025-03-16 19:28:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:35,684 INFO L471 AbstractCegarLoop]: Abstraction has 152807 states and 216088 transitions. [2025-03-16 19:28:35,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-16 19:28:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 152807 states and 216088 transitions. [2025-03-16 19:28:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:35,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:35,692 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] [2025-03-16 19:28:35,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:28:35,692 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:35,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1001258804, now seen corresponding path program 1 times [2025-03-16 19:28:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:35,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815385453] [2025-03-16 19:28:35,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:35,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:35,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:35,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:35,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:35,812 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-16 19:28:35,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:35,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815385453] [2025-03-16 19:28:35,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815385453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:35,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:35,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:35,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551505870] [2025-03-16 19:28:35,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:35,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:35,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:35,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:35,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:35,814 INFO L87 Difference]: Start difference. First operand 152807 states and 216088 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-16 19:28:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:37,070 INFO L93 Difference]: Finished difference Result 328952 states and 468594 transitions. [2025-03-16 19:28:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:37,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2025-03-16 19:28:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:37,549 INFO L225 Difference]: With dead ends: 328952 [2025-03-16 19:28:37,549 INFO L226 Difference]: Without dead ends: 296433 [2025-03-16 19:28:37,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:37,626 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1804 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:37,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 1692 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296433 states. [2025-03-16 19:28:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296433 to 184932. [2025-03-16 19:28:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184932 states, 184931 states have (on average 1.4143383207791014) internal successors, (261555), 184931 states have internal predecessors, (261555), 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-16 19:28:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184932 states to 184932 states and 261555 transitions. [2025-03-16 19:28:40,736 INFO L78 Accepts]: Start accepts. Automaton has 184932 states and 261555 transitions. Word has length 85 [2025-03-16 19:28:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:40,736 INFO L471 AbstractCegarLoop]: Abstraction has 184932 states and 261555 transitions. [2025-03-16 19:28:40,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-16 19:28:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 184932 states and 261555 transitions. [2025-03-16 19:28:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:40,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:40,744 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] [2025-03-16 19:28:40,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:28:40,744 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:40,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash -916392679, now seen corresponding path program 1 times [2025-03-16 19:28:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:40,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364994024] [2025-03-16 19:28:40,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:40,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:28:40,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:28:40,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:40,855 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-16 19:28:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364994024] [2025-03-16 19:28:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364994024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984052060] [2025-03-16 19:28:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:40,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:40,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:40,857 INFO L87 Difference]: Start difference. First operand 184932 states and 261555 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-16 19:28:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:42,173 INFO L93 Difference]: Finished difference Result 378133 states and 538522 transitions. [2025-03-16 19:28:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:42,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2025-03-16 19:28:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:42,664 INFO L225 Difference]: With dead ends: 378133 [2025-03-16 19:28:42,664 INFO L226 Difference]: Without dead ends: 328226 [2025-03-16 19:28:42,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:42,756 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1787 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:42,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 1749 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328226 states. [2025-03-16 19:28:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328226 to 222540. [2025-03-16 19:28:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222540 states, 222539 states have (on average 1.4160214614067645) internal successors, (315120), 222539 states have internal predecessors, (315120), 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-16 19:28:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222540 states to 222540 states and 315120 transitions. [2025-03-16 19:28:46,367 INFO L78 Accepts]: Start accepts. Automaton has 222540 states and 315120 transitions. Word has length 85 [2025-03-16 19:28:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:46,367 INFO L471 AbstractCegarLoop]: Abstraction has 222540 states and 315120 transitions. [2025-03-16 19:28:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-16 19:28:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 222540 states and 315120 transitions. [2025-03-16 19:28:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:28:46,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:46,373 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] [2025-03-16 19:28:46,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:28:46,373 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:46,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1439504137, now seen corresponding path program 1 times [2025-03-16 19:28:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316618334] [2025-03-16 19:28:46,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms