./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1a54cb791c5af35332ec00d8dfd3a394281252d9141996dd7e5974a534492ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:16:36,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:16:36,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:16:36,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:16:36,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:16:36,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:16:36,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:16:36,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:16:36,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:16:36,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:16:36,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:16:36,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:16:36,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:16:36,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:16:36,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:16:36,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:16:36,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:16:36,227 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:16:36,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:16:36,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:16:36,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:16:36,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:16:36,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:16:36,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:16:36,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:16:36,229 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:16:36,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:16:36,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:16:36,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:16:36,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:16:36,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:16:36,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:16:36,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:16:36,230 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 -> b1a54cb791c5af35332ec00d8dfd3a394281252d9141996dd7e5974a534492ee [2025-03-03 15:16:36,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:16:36,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:16:36,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:16:36,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:16:36,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:16:36,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-03 15:16:37,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708d42cf6/029c304a5e0440e7b5f227bbc3cab0f7/FLAGd471d1fc8 [2025-03-03 15:16:37,925 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:16:37,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-03 15:16:37,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708d42cf6/029c304a5e0440e7b5f227bbc3cab0f7/FLAGd471d1fc8 [2025-03-03 15:16:37,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708d42cf6/029c304a5e0440e7b5f227bbc3cab0f7 [2025-03-03 15:16:37,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:16:37,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:16:37,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:16:37,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:16:37,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:16:37,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:16:37" (1/1) ... [2025-03-03 15:16:37,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38784a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:37, skipping insertion in model container [2025-03-03 15:16:37,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:16:37" (1/1) ... [2025-03-03 15:16:37,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:16:38,137 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.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6694,6707] [2025-03-03 15:16:38,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:16:38,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:16:38,238 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.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6694,6707] [2025-03-03 15:16:38,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:16:38,282 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:16:38,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38 WrapperNode [2025-03-03 15:16:38,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:16:38,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:16:38,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:16:38,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:16:38,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,334 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 541 [2025-03-03 15:16:38,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:16:38,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:16:38,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:16:38,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:16:38,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:16:38,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:16:38,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:16:38,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:16:38,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:16:38,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (1/1) ... [2025-03-03 15:16:38,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:16:38,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:16:38,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:16:38,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:16:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:16:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:16:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:16:38,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:16:38,550 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:16:38,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:16:38,969 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L584: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L291: havoc main_~node6__m6~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: havoc main_~node5__m5~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node4__m4~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node3__m3~0#1; [2025-03-03 15:16:38,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L494: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:16:38,971 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node2__m2~0#1; [2025-03-03 15:16:38,971 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L215: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:16:38,971 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:16:38,997 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-03 15:16:38,997 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:16:39,007 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:16:39,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:16:39,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:16:39 BoogieIcfgContainer [2025-03-03 15:16:39,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:16:39,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:16:39,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:16:39,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:16:39,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:16:37" (1/3) ... [2025-03-03 15:16:39,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ff4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:16:39, skipping insertion in model container [2025-03-03 15:16:39,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:38" (2/3) ... [2025-03-03 15:16:39,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ff4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:16:39, skipping insertion in model container [2025-03-03 15:16:39,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:16:39" (3/3) ... [2025-03-03 15:16:39,020 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-03 15:16:39,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:16:39,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c that has 1 procedures, 116 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:16:39,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:16:39,092 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;@687cd72e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:16:39,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:16:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 115 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:16:39,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:39,107 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] [2025-03-03 15:16:39,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:39,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1659500225, now seen corresponding path program 1 times [2025-03-03 15:16:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:39,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387036886] [2025-03-03 15:16:39,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:39,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:16:39,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:16:39,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:39,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387036886] [2025-03-03 15:16:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387036886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:39,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702355791] [2025-03-03 15:16:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:39,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:39,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:39,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:39,498 INFO L87 Difference]: Start difference. First operand has 116 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 115 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:39,551 INFO L93 Difference]: Finished difference Result 254 states and 416 transitions. [2025-03-03 15:16:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2025-03-03 15:16:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:39,561 INFO L225 Difference]: With dead ends: 254 [2025-03-03 15:16:39,561 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 15:16:39,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:39,568 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 140 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:39,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 407 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 15:16:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2025-03-03 15:16:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2025-03-03 15:16:39,608 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 72 [2025-03-03 15:16:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:39,609 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2025-03-03 15:16:39,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2025-03-03 15:16:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:16:39,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:39,612 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] [2025-03-03 15:16:39,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:16:39,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:39,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2021664322, now seen corresponding path program 1 times [2025-03-03 15:16:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319617972] [2025-03-03 15:16:39,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:39,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:16:39,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:16:39,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:39,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319617972] [2025-03-03 15:16:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319617972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410005575] [2025-03-03 15:16:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:39,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:39,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:39,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:39,741 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:39,767 INFO L93 Difference]: Finished difference Result 417 states and 638 transitions. [2025-03-03 15:16:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:39,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2025-03-03 15:16:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:39,769 INFO L225 Difference]: With dead ends: 417 [2025-03-03 15:16:39,769 INFO L226 Difference]: Without dead ends: 287 [2025-03-03 15:16:39,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:39,770 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 96 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:39,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 350 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-03 15:16:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2025-03-03 15:16:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.5070422535211268) internal successors, (428), 284 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2025-03-03 15:16:39,783 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 73 [2025-03-03 15:16:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:39,783 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2025-03-03 15:16:39,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2025-03-03 15:16:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:16:39,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:39,784 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] [2025-03-03 15:16:39,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:16:39,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 710669838, now seen corresponding path program 1 times [2025-03-03 15:16:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527773833] [2025-03-03 15:16:39,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:39,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:16:39,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:16:39,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:39,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:39,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:39,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527773833] [2025-03-03 15:16:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527773833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:39,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496976975] [2025-03-03 15:16:39,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:39,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:39,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:39,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:39,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:39,896 INFO L87 Difference]: Start difference. First operand 285 states and 428 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:39,914 INFO L93 Difference]: Finished difference Result 737 states and 1146 transitions. [2025-03-03 15:16:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:39,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-03 15:16:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:39,917 INFO L225 Difference]: With dead ends: 737 [2025-03-03 15:16:39,917 INFO L226 Difference]: Without dead ends: 495 [2025-03-03 15:16:39,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:39,933 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 91 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:39,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 346 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-03 15:16:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2025-03-03 15:16:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.5365853658536586) internal successors, (756), 492 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 756 transitions. [2025-03-03 15:16:39,958 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 756 transitions. Word has length 74 [2025-03-03 15:16:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:39,958 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 756 transitions. [2025-03-03 15:16:39,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 756 transitions. [2025-03-03 15:16:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:16:39,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:39,959 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] [2025-03-03 15:16:39,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:16:39,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:39,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 179167723, now seen corresponding path program 1 times [2025-03-03 15:16:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15139490] [2025-03-03 15:16:39,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:39,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:16:39,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:16:39,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:39,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:40,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:40,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15139490] [2025-03-03 15:16:40,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15139490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:40,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:40,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804558966] [2025-03-03 15:16:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:40,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:40,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:40,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:40,056 INFO L87 Difference]: Start difference. First operand 493 states and 756 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:40,080 INFO L93 Difference]: Finished difference Result 1329 states and 2078 transitions. [2025-03-03 15:16:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2025-03-03 15:16:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:40,087 INFO L225 Difference]: With dead ends: 1329 [2025-03-03 15:16:40,087 INFO L226 Difference]: Without dead ends: 879 [2025-03-03 15:16:40,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:40,092 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 86 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:40,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 342 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-03 15:16:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2025-03-03 15:16:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 1.547945205479452) internal successors, (1356), 876 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1356 transitions. [2025-03-03 15:16:40,121 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1356 transitions. Word has length 75 [2025-03-03 15:16:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:40,121 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1356 transitions. [2025-03-03 15:16:40,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1356 transitions. [2025-03-03 15:16:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:16:40,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:40,123 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] [2025-03-03 15:16:40,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:16:40,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:40,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1970015835, now seen corresponding path program 1 times [2025-03-03 15:16:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65036520] [2025-03-03 15:16:40,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:40,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:16:40,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:16:40,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:40,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:40,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65036520] [2025-03-03 15:16:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65036520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:40,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:40,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330616114] [2025-03-03 15:16:40,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:40,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:40,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:40,212 INFO L87 Difference]: Start difference. First operand 877 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:40,235 INFO L93 Difference]: Finished difference Result 2417 states and 3774 transitions. [2025-03-03 15:16:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-03-03 15:16:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:40,241 INFO L225 Difference]: With dead ends: 2417 [2025-03-03 15:16:40,241 INFO L226 Difference]: Without dead ends: 1583 [2025-03-03 15:16:40,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:40,242 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 81 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:40,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 338 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-03 15:16:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1581. [2025-03-03 15:16:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 1.5468354430379747) internal successors, (2444), 1580 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2444 transitions. [2025-03-03 15:16:40,275 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2444 transitions. Word has length 76 [2025-03-03 15:16:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:40,276 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2444 transitions. [2025-03-03 15:16:40,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2444 transitions. [2025-03-03 15:16:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:16:40,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:40,276 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] [2025-03-03 15:16:40,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:16:40,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:40,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2118216472, now seen corresponding path program 1 times [2025-03-03 15:16:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:40,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165785397] [2025-03-03 15:16:40,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:40,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:40,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:16:40,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:16:40,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:40,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165785397] [2025-03-03 15:16:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165785397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:40,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790861972] [2025-03-03 15:16:40,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:40,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:40,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:40,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:40,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:40,357 INFO L87 Difference]: Start difference. First operand 1581 states and 2444 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:40,383 INFO L93 Difference]: Finished difference Result 4401 states and 6830 transitions. [2025-03-03 15:16:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2025-03-03 15:16:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:40,391 INFO L225 Difference]: With dead ends: 4401 [2025-03-03 15:16:40,392 INFO L226 Difference]: Without dead ends: 2863 [2025-03-03 15:16:40,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:40,395 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 76 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:40,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 334 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2025-03-03 15:16:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2861. [2025-03-03 15:16:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.5370629370629372) internal successors, (4396), 2860 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4396 transitions. [2025-03-03 15:16:40,441 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4396 transitions. Word has length 77 [2025-03-03 15:16:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:40,441 INFO L471 AbstractCegarLoop]: Abstraction has 2861 states and 4396 transitions. [2025-03-03 15:16:40,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4396 transitions. [2025-03-03 15:16:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:16:40,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:40,442 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] [2025-03-03 15:16:40,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:16:40,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:40,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1269547096, now seen corresponding path program 1 times [2025-03-03 15:16:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636422369] [2025-03-03 15:16:40,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:40,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:16:40,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:16:40,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:40,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:40,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:40,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636422369] [2025-03-03 15:16:40,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636422369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:40,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:40,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034247725] [2025-03-03 15:16:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:40,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:40,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:40,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:40,623 INFO L87 Difference]: Start difference. First operand 2861 states and 4396 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:41,022 INFO L93 Difference]: Finished difference Result 36677 states and 56632 transitions. [2025-03-03 15:16:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 78 [2025-03-03 15:16:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:41,117 INFO L225 Difference]: With dead ends: 36677 [2025-03-03 15:16:41,117 INFO L226 Difference]: Without dead ends: 33859 [2025-03-03 15:16:41,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:16:41,128 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1491 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:41,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 2693 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33859 states. [2025-03-03 15:16:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33859 to 5677. [2025-03-03 15:16:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5676 states have (on average 1.518675123326286) internal successors, (8620), 5676 states have internal predecessors, (8620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 8620 transitions. [2025-03-03 15:16:41,465 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 8620 transitions. Word has length 78 [2025-03-03 15:16:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 8620 transitions. [2025-03-03 15:16:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 8620 transitions. [2025-03-03 15:16:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:16:41,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:41,469 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-03 15:16:41,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:16:41,469 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash -225163663, now seen corresponding path program 1 times [2025-03-03 15:16:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297204913] [2025-03-03 15:16:41,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:41,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:41,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:16:41,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:16:41,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:41,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297204913] [2025-03-03 15:16:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297204913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:41,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:16:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401694507] [2025-03-03 15:16:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:41,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:16:41,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:41,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:16:41,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:41,565 INFO L87 Difference]: Start difference. First operand 5677 states and 8620 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-03 15:16:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:41,605 INFO L93 Difference]: Finished difference Result 14035 states and 21328 transitions. [2025-03-03 15:16:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:16:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03 15:16:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:41,619 INFO L225 Difference]: With dead ends: 14035 [2025-03-03 15:16:41,619 INFO L226 Difference]: Without dead ends: 8401 [2025-03-03 15:16:41,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:16:41,627 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:41,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 298 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8401 states. [2025-03-03 15:16:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8401 to 8399. [2025-03-03 15:16:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8398 states have (on average 1.506787330316742) internal successors, (12654), 8398 states have internal predecessors, (12654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 12654 transitions. [2025-03-03 15:16:41,754 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 12654 transitions. Word has length 80 [2025-03-03 15:16:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 8399 states and 12654 transitions. [2025-03-03 15:16:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 12654 transitions. [2025-03-03 15:16:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:16:41,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:41,758 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-03 15:16:41,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:16:41,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:41,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -224001814, now seen corresponding path program 1 times [2025-03-03 15:16:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:41,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-03-03 15:16:41,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:41,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:41,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:16:41,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:16:41,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:41,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:42,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:42,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-03-03 15:16:42,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117368501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:42,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:42,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289080800] [2025-03-03 15:16:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:42,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:42,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:42,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:42,061 INFO L87 Difference]: Start difference. First operand 8399 states and 12654 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-03 15:16:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:42,325 INFO L93 Difference]: Finished difference Result 16755 states and 25264 transitions. [2025-03-03 15:16:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:42,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-03 15:16:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:42,337 INFO L225 Difference]: With dead ends: 16755 [2025-03-03 15:16:42,338 INFO L226 Difference]: Without dead ends: 8401 [2025-03-03 15:16:42,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:42,344 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 454 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:42,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 684 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8401 states. [2025-03-03 15:16:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8401 to 8399. [2025-03-03 15:16:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8398 states have (on average 1.4953560371517027) internal successors, (12558), 8398 states have internal predecessors, (12558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 12558 transitions. [2025-03-03 15:16:42,437 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 12558 transitions. Word has length 80 [2025-03-03 15:16:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 8399 states and 12558 transitions. [2025-03-03 15:16:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-03 15:16:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 12558 transitions. [2025-03-03 15:16:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:16:42,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:42,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:16:42,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1646833728, now seen corresponding path program 1 times [2025-03-03 15:16:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016692475] [2025-03-03 15:16:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:42,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:16:42,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:16:42,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:42,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016692475] [2025-03-03 15:16:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016692475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:42,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:16:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122895622] [2025-03-03 15:16:42,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:42,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:42,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:42,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:42,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:42,670 INFO L87 Difference]: Start difference. First operand 8399 states and 12558 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-03 15:16:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:42,706 INFO L93 Difference]: Finished difference Result 8657 states and 12943 transitions. [2025-03-03 15:16:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:42,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-03 15:16:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:42,719 INFO L225 Difference]: With dead ends: 8657 [2025-03-03 15:16:42,720 INFO L226 Difference]: Without dead ends: 8655 [2025-03-03 15:16:42,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:42,724 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:42,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 592 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:16:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8655 states. [2025-03-03 15:16:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8655 to 8655. [2025-03-03 15:16:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8655 states, 8654 states have (on average 1.4770048532470534) internal successors, (12782), 8654 states have internal predecessors, (12782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8655 states to 8655 states and 12782 transitions. [2025-03-03 15:16:42,846 INFO L78 Accepts]: Start accepts. Automaton has 8655 states and 12782 transitions. Word has length 81 [2025-03-03 15:16:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:42,847 INFO L471 AbstractCegarLoop]: Abstraction has 8655 states and 12782 transitions. [2025-03-03 15:16:42,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-03 15:16:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8655 states and 12782 transitions. [2025-03-03 15:16:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:16:42,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:42,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:42,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:16:42,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:42,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash 504138144, now seen corresponding path program 1 times [2025-03-03 15:16:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:42,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550585763] [2025-03-03 15:16:42,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:42,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:16:42,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:16:42,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:42,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:16:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550585763] [2025-03-03 15:16:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550585763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:43,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575375256] [2025-03-03 15:16:43,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:43,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:43,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:43,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:43,043 INFO L87 Difference]: Start difference. First operand 8655 states and 12782 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:43,305 INFO L93 Difference]: Finished difference Result 61917 states and 91477 transitions. [2025-03-03 15:16:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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 111 [2025-03-03 15:16:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:43,397 INFO L225 Difference]: With dead ends: 61917 [2025-03-03 15:16:43,398 INFO L226 Difference]: Without dead ends: 53307 [2025-03-03 15:16:43,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:43,416 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1122 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:43,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1661 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53307 states. [2025-03-03 15:16:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53307 to 17263. [2025-03-03 15:16:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17263 states, 17262 states have (on average 1.472714633298575) internal successors, (25422), 17262 states have internal predecessors, (25422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17263 states to 17263 states and 25422 transitions. [2025-03-03 15:16:43,825 INFO L78 Accepts]: Start accepts. Automaton has 17263 states and 25422 transitions. Word has length 111 [2025-03-03 15:16:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:43,825 INFO L471 AbstractCegarLoop]: Abstraction has 17263 states and 25422 transitions. [2025-03-03 15:16:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 17263 states and 25422 transitions. [2025-03-03 15:16:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:16:43,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:43,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:43,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:16:43,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:43,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1681945280, now seen corresponding path program 1 times [2025-03-03 15:16:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346362313] [2025-03-03 15:16:43,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:43,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:16:43,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:16:43,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:43,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:16:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:44,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346362313] [2025-03-03 15:16:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346362313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:44,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600845729] [2025-03-03 15:16:44,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:44,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:44,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:44,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:44,032 INFO L87 Difference]: Start difference. First operand 17263 states and 25422 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:44,266 INFO L93 Difference]: Finished difference Result 70525 states and 104117 transitions. [2025-03-03 15:16:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:44,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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 111 [2025-03-03 15:16:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:44,339 INFO L225 Difference]: With dead ends: 70525 [2025-03-03 15:16:44,339 INFO L226 Difference]: Without dead ends: 61915 [2025-03-03 15:16:44,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:44,363 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1155 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:44,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1497 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61915 states. [2025-03-03 15:16:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61915 to 30191. [2025-03-03 15:16:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30191 states, 30190 states have (on average 1.4674395495197086) internal successors, (44302), 30190 states have internal predecessors, (44302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30191 states to 30191 states and 44302 transitions. [2025-03-03 15:16:44,855 INFO L78 Accepts]: Start accepts. Automaton has 30191 states and 44302 transitions. Word has length 111 [2025-03-03 15:16:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:44,856 INFO L471 AbstractCegarLoop]: Abstraction has 30191 states and 44302 transitions. [2025-03-03 15:16:44,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 30191 states and 44302 transitions. [2025-03-03 15:16:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:16:44,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:44,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:44,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:16:44,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:44,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -37396256, now seen corresponding path program 1 times [2025-03-03 15:16:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:44,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889011553] [2025-03-03 15:16:44,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:16:44,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:16:44,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:44,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:16:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889011553] [2025-03-03 15:16:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889011553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629289451] [2025-03-03 15:16:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:45,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:45,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:45,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:45,091 INFO L87 Difference]: Start difference. First operand 30191 states and 44302 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:45,355 INFO L93 Difference]: Finished difference Result 79133 states and 116757 transitions. [2025-03-03 15:16:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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 111 [2025-03-03 15:16:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:45,439 INFO L225 Difference]: With dead ends: 79133 [2025-03-03 15:16:45,439 INFO L226 Difference]: Without dead ends: 70523 [2025-03-03 15:16:45,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:45,466 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1206 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:45,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1467 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70523 states. [2025-03-03 15:16:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70523 to 38799. [2025-03-03 15:16:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38799 states, 38798 states have (on average 1.4676529718026703) internal successors, (56942), 38798 states have internal predecessors, (56942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38799 states to 38799 states and 56942 transitions. [2025-03-03 15:16:46,202 INFO L78 Accepts]: Start accepts. Automaton has 38799 states and 56942 transitions. Word has length 111 [2025-03-03 15:16:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:46,202 INFO L471 AbstractCegarLoop]: Abstraction has 38799 states and 56942 transitions. [2025-03-03 15:16:46,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 38799 states and 56942 transitions. [2025-03-03 15:16:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:16:46,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:46,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:46,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:16:46,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:46,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:46,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2114323584, now seen corresponding path program 1 times [2025-03-03 15:16:46,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:46,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880758303] [2025-03-03 15:16:46,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:46,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:46,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:16:46,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:16:46,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:46,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:16:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880758303] [2025-03-03 15:16:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880758303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:46,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297668196] [2025-03-03 15:16:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:46,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:46,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:46,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:46,398 INFO L87 Difference]: Start difference. First operand 38799 states and 56942 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:46,709 INFO L93 Difference]: Finished difference Result 87741 states and 129397 transitions. [2025-03-03 15:16:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:46,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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 111 [2025-03-03 15:16:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:46,822 INFO L225 Difference]: With dead ends: 87741 [2025-03-03 15:16:46,822 INFO L226 Difference]: Without dead ends: 79131 [2025-03-03 15:16:46,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:46,852 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 1276 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:46,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1464 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79131 states. [2025-03-03 15:16:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79131 to 47407. [2025-03-03 15:16:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47407 states, 47406 states have (on average 1.467788887482597) internal successors, (69582), 47406 states have internal predecessors, (69582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47407 states to 47407 states and 69582 transitions. [2025-03-03 15:16:47,686 INFO L78 Accepts]: Start accepts. Automaton has 47407 states and 69582 transitions. Word has length 111 [2025-03-03 15:16:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:47,687 INFO L471 AbstractCegarLoop]: Abstraction has 47407 states and 69582 transitions. [2025-03-03 15:16:47,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 47407 states and 69582 transitions. [2025-03-03 15:16:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:16:47,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:47,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:47,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:16:47,692 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:47,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1972799456, now seen corresponding path program 1 times [2025-03-03 15:16:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650392618] [2025-03-03 15:16:47,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:47,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:16:47,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:16:47,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:47,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 15:16:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:47,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650392618] [2025-03-03 15:16:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650392618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:47,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:47,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603744127] [2025-03-03 15:16:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:47,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:47,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:47,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:47,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:47,833 INFO L87 Difference]: Start difference. First operand 47407 states and 69582 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:48,116 INFO L93 Difference]: Finished difference Result 96349 states and 142037 transitions. [2025-03-03 15:16:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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 111 [2025-03-03 15:16:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:48,218 INFO L225 Difference]: With dead ends: 96349 [2025-03-03 15:16:48,219 INFO L226 Difference]: Without dead ends: 87739 [2025-03-03 15:16:48,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:48,255 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1142 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:48,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1618 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87739 states. [2025-03-03 15:16:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87739 to 56015. [2025-03-03 15:16:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56015 states, 56014 states have (on average 1.4678830292426894) internal successors, (82222), 56014 states have internal predecessors, (82222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56015 states to 56015 states and 82222 transitions. [2025-03-03 15:16:49,384 INFO L78 Accepts]: Start accepts. Automaton has 56015 states and 82222 transitions. Word has length 111 [2025-03-03 15:16:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:49,384 INFO L471 AbstractCegarLoop]: Abstraction has 56015 states and 82222 transitions. [2025-03-03 15:16:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 56015 states and 82222 transitions. [2025-03-03 15:16:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:16:49,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:49,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:49,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:16:49,390 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:49,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2126796288, now seen corresponding path program 1 times [2025-03-03 15:16:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:49,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856120832] [2025-03-03 15:16:49,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:49,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:16:49,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:16:49,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:49,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:16:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856120832] [2025-03-03 15:16:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856120832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:49,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248986283] [2025-03-03 15:16:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:49,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:49,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:49,563 INFO L87 Difference]: Start difference. First operand 56015 states and 82222 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:50,059 INFO L93 Difference]: Finished difference Result 99517 states and 146741 transitions. [2025-03-03 15:16:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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 111 [2025-03-03 15:16:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:50,165 INFO L225 Difference]: With dead ends: 99517 [2025-03-03 15:16:50,165 INFO L226 Difference]: Without dead ends: 93627 [2025-03-03 15:16:50,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:50,195 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1121 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:50,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1910 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93627 states. [2025-03-03 15:16:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93627 to 61903. [2025-03-03 15:16:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61903 states, 61902 states have (on average 1.4688701495912895) internal successors, (90926), 61902 states have internal predecessors, (90926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61903 states to 61903 states and 90926 transitions. [2025-03-03 15:16:51,008 INFO L78 Accepts]: Start accepts. Automaton has 61903 states and 90926 transitions. Word has length 111 [2025-03-03 15:16:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:51,009 INFO L471 AbstractCegarLoop]: Abstraction has 61903 states and 90926 transitions. [2025-03-03 15:16:51,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61903 states and 90926 transitions. [2025-03-03 15:16:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:16:51,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:51,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:51,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:16:51,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:51,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash -191792163, now seen corresponding path program 1 times [2025-03-03 15:16:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038887335] [2025-03-03 15:16:51,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:16:51,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:16:51,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:51,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:16:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038887335] [2025-03-03 15:16:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038887335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:16:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9021838] [2025-03-03 15:16:51,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:51,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:16:51,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:16:51,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:16:51,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:16:51,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:16:51,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:16:51,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:51,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:51,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:16:51,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:16:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:51,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:16:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:52,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9021838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:16:52,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:16:52,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 5] total 11 [2025-03-03 15:16:52,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230378396] [2025-03-03 15:16:52,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:16:52,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:16:52,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:52,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:16:52,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:16:52,297 INFO L87 Difference]: Start difference. First operand 61903 states and 90926 transitions. Second operand has 11 states, 11 states have (on average 29.181818181818183) internal successors, (321), 11 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:53,069 INFO L93 Difference]: Finished difference Result 210668 states and 311142 transitions. [2025-03-03 15:16:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 15:16:53,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.181818181818183) internal successors, (321), 11 states have internal predecessors, (321), 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 112 [2025-03-03 15:16:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:53,243 INFO L225 Difference]: With dead ends: 210668 [2025-03-03 15:16:53,244 INFO L226 Difference]: Without dead ends: 148810 [2025-03-03 15:16:53,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:53,296 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 706 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:53,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1052 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:16:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148810 states. [2025-03-03 15:16:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148810 to 148800. [2025-03-03 15:16:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148800 states, 148799 states have (on average 1.4531347656906297) internal successors, (216225), 148799 states have internal predecessors, (216225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148800 states to 148800 states and 216225 transitions. [2025-03-03 15:16:55,077 INFO L78 Accepts]: Start accepts. Automaton has 148800 states and 216225 transitions. Word has length 112 [2025-03-03 15:16:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:55,077 INFO L471 AbstractCegarLoop]: Abstraction has 148800 states and 216225 transitions. [2025-03-03 15:16:55,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.181818181818183) internal successors, (321), 11 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 148800 states and 216225 transitions. [2025-03-03 15:16:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:16:55,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:55,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:55,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:16:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 15:16:55,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:16:55,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1798532484, now seen corresponding path program 1 times [2025-03-03 15:16:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711913595] [2025-03-03 15:16:55,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:55,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:16:55,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:16:55,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:55,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711913595] [2025-03-03 15:16:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711913595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:16:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703392737] [2025-03-03 15:16:55,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:55,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:16:55,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:16:55,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:16:55,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:16:55,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:16:55,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:16:55,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:55,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:55,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 15:16:55,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:16:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:56,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:16:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703392737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:16:57,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:16:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 15:16:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861783287] [2025-03-03 15:16:57,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:16:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 15:16:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:57,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 15:16:57,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:16:57,270 INFO L87 Difference]: Start difference. First operand 148800 states and 216225 transitions. Second operand has 25 states, 25 states have (on average 12.4) internal successors, (310), 24 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:03,739 INFO L93 Difference]: Finished difference Result 1279807 states and 1847984 transitions. [2025-03-03 15:17:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-03 15:17:03,739 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.4) internal successors, (310), 24 states have internal predecessors, (310), 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 113 [2025-03-03 15:17:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:05,487 INFO L225 Difference]: With dead ends: 1279807 [2025-03-03 15:17:05,488 INFO L226 Difference]: Without dead ends: 1131066 [2025-03-03 15:17:06,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2478, Invalid=12284, Unknown=0, NotChecked=0, Total=14762 [2025-03-03 15:17:06,143 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 5474 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 3561 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:06,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 2205 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3561 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:17:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131066 states. [2025-03-03 15:17:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131066 to 719734. [2025-03-03 15:17:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719734 states, 719733 states have (on average 1.429124411413677) internal successors, (1028588), 719733 states have internal predecessors, (1028588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719734 states to 719734 states and 1028588 transitions. [2025-03-03 15:17:18,169 INFO L78 Accepts]: Start accepts. Automaton has 719734 states and 1028588 transitions. Word has length 113 [2025-03-03 15:17:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:18,170 INFO L471 AbstractCegarLoop]: Abstraction has 719734 states and 1028588 transitions. [2025-03-03 15:17:18,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.4) internal successors, (310), 24 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 719734 states and 1028588 transitions. [2025-03-03 15:17:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:17:18,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:18,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:18,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:17:18,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 15:17:18,382 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:17:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash 147364476, now seen corresponding path program 1 times [2025-03-03 15:17:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:18,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888394082] [2025-03-03 15:17:18,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:18,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:17:18,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:17:18,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:18,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888394082] [2025-03-03 15:17:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888394082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:17:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106597556] [2025-03-03 15:17:18,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:18,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:17:18,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:17:18,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:17:18,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:17:18,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:17:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:17:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:18,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 15:17:18,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:17:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:19,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:17:19,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:19,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106597556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:17:19,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:17:19,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 15:17:19,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209862030] [2025-03-03 15:17:19,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:17:19,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 15:17:19,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:19,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 15:17:19,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:17:19,998 INFO L87 Difference]: Start difference. First operand 719734 states and 1028588 transitions. Second operand has 25 states, 25 states have (on average 11.92) internal successors, (298), 24 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)