./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-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 21f8745a4b7dc6c318e9cfa92c5330ecd148615dc4c561afd5b7113093125b70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:19:49,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:19:49,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:19:49,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:19:49,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:19:49,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:19:49,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:19:49,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:19:49,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:19:49,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:19:49,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:19:49,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:19:49,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:19:49,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:19:49,291 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:19:49,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:19:49,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:19:49,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:19:49,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:19:49,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:19:49,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:19:49,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:19:49,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:19:49,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:19:49,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:19:49,294 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 -> 21f8745a4b7dc6c318e9cfa92c5330ecd148615dc4c561afd5b7113093125b70 [2025-03-16 19:19:49,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:19:49,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:19:49,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:19:49,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:19:49,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:19:49,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:19:50,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1268226/8033d267e0b44684b989afc4e30c17b3/FLAGe318f557d [2025-03-16 19:19:50,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:19:50,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:19:50,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1268226/8033d267e0b44684b989afc4e30c17b3/FLAGe318f557d [2025-03-16 19:19:51,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1268226/8033d267e0b44684b989afc4e30c17b3 [2025-03-16 19:19:51,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:19:51,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:19:51,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:19:51,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:19:51,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:19:51,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51, skipping insertion in model container [2025-03-16 19:19:51,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:19:51,477 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2025-03-16 19:19:51,502 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2025-03-16 19:19:51,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:19:51,575 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:19:51,618 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2025-03-16 19:19:51,626 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2025-03-16 19:19:51,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:19:51,669 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:19:51,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51 WrapperNode [2025-03-16 19:19:51,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:19:51,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:19:51,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:19:51,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:19:51,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,726 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1023 [2025-03-16 19:19:51,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:19:51,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:19:51,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:19:51,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:19:51,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,761 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:19:51,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:19:51,783 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:19:51,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:19:51,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:19:51,784 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (1/1) ... [2025-03-16 19:19:51,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:19:51,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:19:51,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:19:51,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:19:51,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:19:51,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:19:51,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:19:51,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:19:51,923 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:19:51,924 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:19:52,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L993: havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:52,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1094: havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:52,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:19:52,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1195: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:52,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L833: havoc main_~check__tmp~3#1; [2025-03-16 19:19:52,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L520: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:19:52,651 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: 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;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-16 19:19:52,694 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2025-03-16 19:19:52,695 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:19:52,707 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:19:52,709 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:19:52,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:19:52 BoogieIcfgContainer [2025-03-16 19:19:52,710 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:19:52,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:19:52,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:19:52,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:19:52,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:19:51" (1/3) ... [2025-03-16 19:19:52,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49afe9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:19:52, skipping insertion in model container [2025-03-16 19:19:52,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:19:51" (2/3) ... [2025-03-16 19:19:52,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49afe9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:19:52, skipping insertion in model container [2025-03-16 19:19:52,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:19:52" (3/3) ... [2025-03-16 19:19:52,718 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-03-16 19:19:52,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:19:52,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 236 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-16 19:19:52,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:19:52,785 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;@5090cd31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:19:52,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:19:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 233 states have (on average 1.8068669527896997) internal successors, (421), 235 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:19:52,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:52,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:52,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:52,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash -48159726, now seen corresponding path program 1 times [2025-03-16 19:19:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872121607] [2025-03-16 19:19:52,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:52,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:19:53,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:19:53,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:53,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872121607] [2025-03-16 19:19:53,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872121607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:53,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:53,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395335203] [2025-03-16 19:19:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:53,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:53,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:53,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:53,570 INFO L87 Difference]: Start difference. First operand has 236 states, 233 states have (on average 1.8068669527896997) internal successors, (421), 235 states have internal predecessors, (421), 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 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:53,708 INFO L93 Difference]: Finished difference Result 883 states and 1582 transitions. [2025-03-16 19:19:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:53,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:19:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:53,720 INFO L225 Difference]: With dead ends: 883 [2025-03-16 19:19:53,720 INFO L226 Difference]: Without dead ends: 664 [2025-03-16 19:19:53,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:53,731 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 829 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:53,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1443 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:19:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-16 19:19:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 430. [2025-03-16 19:19:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 428 states have (on average 1.469626168224299) internal successors, (629), 429 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2025-03-16 19:19:53,792 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 90 [2025-03-16 19:19:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:53,792 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2025-03-16 19:19:53,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2025-03-16 19:19:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:19:53,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:53,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:53,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:19:53,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:53,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash -113275077, now seen corresponding path program 1 times [2025-03-16 19:19:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:53,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381836168] [2025-03-16 19:19:53,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:53,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:19:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:19:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381836168] [2025-03-16 19:19:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381836168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227256101] [2025-03-16 19:19:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:53,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:53,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:53,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:53,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:53,926 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:53,947 INFO L93 Difference]: Finished difference Result 835 states and 1215 transitions. [2025-03-16 19:19:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:53,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-16 19:19:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:53,950 INFO L225 Difference]: With dead ends: 835 [2025-03-16 19:19:53,950 INFO L226 Difference]: Without dead ends: 432 [2025-03-16 19:19:53,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:53,952 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 0 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:53,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-16 19:19:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-03-16 19:19:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 430 states have (on average 1.4674418604651163) internal successors, (631), 431 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 631 transitions. [2025-03-16 19:19:53,970 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 631 transitions. Word has length 91 [2025-03-16 19:19:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:53,970 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 631 transitions. [2025-03-16 19:19:53,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 631 transitions. [2025-03-16 19:19:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:19:53,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:53,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:53,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:19:53,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:53,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1429829461, now seen corresponding path program 1 times [2025-03-16 19:19:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510904559] [2025-03-16 19:19:53,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:19:54,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:19:54,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:54,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510904559] [2025-03-16 19:19:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510904559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:54,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167844422] [2025-03-16 19:19:54,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:54,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:54,089 INFO L87 Difference]: Start difference. First operand 432 states and 631 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:54,126 INFO L93 Difference]: Finished difference Result 1089 states and 1604 transitions. [2025-03-16 19:19:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 19:19:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:54,130 INFO L225 Difference]: With dead ends: 1089 [2025-03-16 19:19:54,130 INFO L226 Difference]: Without dead ends: 834 [2025-03-16 19:19:54,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:54,133 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 274 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:54,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 922 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-16 19:19:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 816. [2025-03-16 19:19:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.4557739557739557) internal successors, (1185), 815 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1185 transitions. [2025-03-16 19:19:54,153 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1185 transitions. Word has length 92 [2025-03-16 19:19:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:54,153 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1185 transitions. [2025-03-16 19:19:54,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1185 transitions. [2025-03-16 19:19:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:19:54,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:54,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:54,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:19:54,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:54,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash 659095895, now seen corresponding path program 1 times [2025-03-16 19:19:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106124034] [2025-03-16 19:19:54,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:54,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:19:54,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:19:54,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:54,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106124034] [2025-03-16 19:19:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106124034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235525276] [2025-03-16 19:19:54,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:54,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:54,517 INFO L87 Difference]: Start difference. First operand 816 states and 1185 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:54,542 INFO L93 Difference]: Finished difference Result 1276 states and 1867 transitions. [2025-03-16 19:19:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 19:19:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:54,545 INFO L225 Difference]: With dead ends: 1276 [2025-03-16 19:19:54,545 INFO L226 Difference]: Without dead ends: 627 [2025-03-16 19:19:54,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:54,546 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 25 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:54,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1108 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-16 19:19:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2025-03-16 19:19:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 625 states have (on average 1.448) internal successors, (905), 626 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 905 transitions. [2025-03-16 19:19:54,559 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 905 transitions. Word has length 92 [2025-03-16 19:19:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:54,559 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 905 transitions. [2025-03-16 19:19:54,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 905 transitions. [2025-03-16 19:19:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:19:54,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:54,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:54,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:19:54,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash -445940867, now seen corresponding path program 1 times [2025-03-16 19:19:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265062649] [2025-03-16 19:19:54,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:54,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:54,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:19:54,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:19:54,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:54,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265062649] [2025-03-16 19:19:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265062649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:54,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705162769] [2025-03-16 19:19:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:54,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:54,801 INFO L87 Difference]: Start difference. First operand 627 states and 905 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:54,872 INFO L93 Difference]: Finished difference Result 1542 states and 2220 transitions. [2025-03-16 19:19:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:54,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2025-03-16 19:19:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:54,876 INFO L225 Difference]: With dead ends: 1542 [2025-03-16 19:19:54,876 INFO L226 Difference]: Without dead ends: 933 [2025-03-16 19:19:54,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:19:54,879 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 280 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:54,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1416 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-16 19:19:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 919. [2025-03-16 19:19:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 917 states have (on average 1.4329334787350054) internal successors, (1314), 918 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1314 transitions. [2025-03-16 19:19:54,904 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1314 transitions. Word has length 94 [2025-03-16 19:19:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:54,904 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1314 transitions. [2025-03-16 19:19:54,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1314 transitions. [2025-03-16 19:19:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:19:54,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:54,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:54,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:19:54,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:54,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1757784782, now seen corresponding path program 1 times [2025-03-16 19:19:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171830911] [2025-03-16 19:19:54,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:54,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:19:54,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:19:54,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:54,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171830911] [2025-03-16 19:19:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171830911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170111251] [2025-03-16 19:19:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:54,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:54,981 INFO L87 Difference]: Start difference. First operand 919 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:54,998 INFO L93 Difference]: Finished difference Result 1895 states and 2722 transitions. [2025-03-16 19:19:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:54,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 19:19:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,003 INFO L225 Difference]: With dead ends: 1895 [2025-03-16 19:19:55,003 INFO L226 Difference]: Without dead ends: 1252 [2025-03-16 19:19:55,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:55,006 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 318 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:55,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 926 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-03-16 19:19:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 919. [2025-03-16 19:19:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 917 states have (on average 1.4318429661941112) internal successors, (1313), 918 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1313 transitions. [2025-03-16 19:19:55,026 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1313 transitions. Word has length 95 [2025-03-16 19:19:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,026 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1313 transitions. [2025-03-16 19:19:55,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1313 transitions. [2025-03-16 19:19:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:19:55,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:55,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:19:55,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1039750912, now seen corresponding path program 1 times [2025-03-16 19:19:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245245776] [2025-03-16 19:19:55,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:19:55,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:19:55,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245245776] [2025-03-16 19:19:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245245776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234366642] [2025-03-16 19:19:55,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:55,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:55,100 INFO L87 Difference]: Start difference. First operand 919 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,149 INFO L93 Difference]: Finished difference Result 2254 states and 3281 transitions. [2025-03-16 19:19:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:55,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:19:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,156 INFO L225 Difference]: With dead ends: 2254 [2025-03-16 19:19:55,156 INFO L226 Difference]: Without dead ends: 1659 [2025-03-16 19:19:55,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:55,157 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 268 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:55,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 946 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-16 19:19:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1647. [2025-03-16 19:19:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1645 states have (on average 1.4322188449848023) internal successors, (2356), 1646 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2356 transitions. [2025-03-16 19:19:55,187 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2356 transitions. Word has length 96 [2025-03-16 19:19:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,187 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2356 transitions. [2025-03-16 19:19:55,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2356 transitions. [2025-03-16 19:19:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:19:55,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:19:55,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash -900831102, now seen corresponding path program 1 times [2025-03-16 19:19:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134943890] [2025-03-16 19:19:55,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:19:55,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:19:55,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:55,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134943890] [2025-03-16 19:19:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134943890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248082053] [2025-03-16 19:19:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:55,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:55,452 INFO L87 Difference]: Start difference. First operand 1647 states and 2356 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,475 INFO L93 Difference]: Finished difference Result 2472 states and 3560 transitions. [2025-03-16 19:19:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:19:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,482 INFO L225 Difference]: With dead ends: 2472 [2025-03-16 19:19:55,482 INFO L226 Difference]: Without dead ends: 1353 [2025-03-16 19:19:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:55,484 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 19 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:55,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1086 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-03-16 19:19:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2025-03-16 19:19:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1351 states have (on average 1.4248704663212435) internal successors, (1925), 1352 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1925 transitions. [2025-03-16 19:19:55,512 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1925 transitions. Word has length 96 [2025-03-16 19:19:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,512 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1925 transitions. [2025-03-16 19:19:55,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1925 transitions. [2025-03-16 19:19:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:19:55,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:19:55,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash 842679764, now seen corresponding path program 1 times [2025-03-16 19:19:55,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517430997] [2025-03-16 19:19:55,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:19:55,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:19:55,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517430997] [2025-03-16 19:19:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517430997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:55,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204362599] [2025-03-16 19:19:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:55,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:55,750 INFO L87 Difference]: Start difference. First operand 1353 states and 1925 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,840 INFO L93 Difference]: Finished difference Result 6360 states and 9046 transitions. [2025-03-16 19:19:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2025-03-16 19:19:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,854 INFO L225 Difference]: With dead ends: 6360 [2025-03-16 19:19:55,855 INFO L226 Difference]: Without dead ends: 5045 [2025-03-16 19:19:55,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:19:55,858 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 922 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:55,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1390 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:19:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states. [2025-03-16 19:19:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 2510. [2025-03-16 19:19:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 2508 states have (on average 1.4114832535885167) internal successors, (3540), 2509 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3540 transitions. [2025-03-16 19:19:55,917 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3540 transitions. Word has length 98 [2025-03-16 19:19:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,917 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 3540 transitions. [2025-03-16 19:19:55,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3540 transitions. [2025-03-16 19:19:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:19:55,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:55,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:19:55,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2019271859, now seen corresponding path program 1 times [2025-03-16 19:19:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585028615] [2025-03-16 19:19:55,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:19:55,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:19:55,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585028615] [2025-03-16 19:19:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585028615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957896237] [2025-03-16 19:19:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:55,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:55,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:55,966 INFO L87 Difference]: Start difference. First operand 2510 states and 3540 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,991 INFO L93 Difference]: Finished difference Result 4925 states and 6955 transitions. [2025-03-16 19:19:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2025-03-16 19:19:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,998 INFO L225 Difference]: With dead ends: 4925 [2025-03-16 19:19:55,998 INFO L226 Difference]: Without dead ends: 2516 [2025-03-16 19:19:56,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:56,001 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:56,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-03-16 19:19:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2516. [2025-03-16 19:19:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2514 states have (on average 1.4105011933174225) internal successors, (3546), 2515 states have internal predecessors, (3546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 3546 transitions. [2025-03-16 19:19:56,040 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 3546 transitions. Word has length 99 [2025-03-16 19:19:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:56,040 INFO L471 AbstractCegarLoop]: Abstraction has 2516 states and 3546 transitions. [2025-03-16 19:19:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 3546 transitions. [2025-03-16 19:19:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:19:56,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:56,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:56,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:19:56,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:56,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:56,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1079741028, now seen corresponding path program 1 times [2025-03-16 19:19:56,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:56,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228473367] [2025-03-16 19:19:56,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:56,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:56,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:19:56,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:19:56,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:56,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228473367] [2025-03-16 19:19:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228473367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545832275] [2025-03-16 19:19:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:56,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:56,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:56,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:56,310 INFO L87 Difference]: Start difference. First operand 2516 states and 3546 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:56,337 INFO L93 Difference]: Finished difference Result 4995 states and 7041 transitions. [2025-03-16 19:19:56,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:56,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 100 [2025-03-16 19:19:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:56,343 INFO L225 Difference]: With dead ends: 4995 [2025-03-16 19:19:56,343 INFO L226 Difference]: Without dead ends: 2510 [2025-03-16 19:19:56,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:56,346 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 14 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:56,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1068 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:56,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2025-03-16 19:19:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2510. [2025-03-16 19:19:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 2508 states have (on average 1.4090909090909092) internal successors, (3534), 2509 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3534 transitions. [2025-03-16 19:19:56,385 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3534 transitions. Word has length 100 [2025-03-16 19:19:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:56,385 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 3534 transitions. [2025-03-16 19:19:56,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3534 transitions. [2025-03-16 19:19:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:19:56,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:56,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:56,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:19:56,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:56,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1701963369, now seen corresponding path program 1 times [2025-03-16 19:19:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282150006] [2025-03-16 19:19:56,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:56,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:19:56,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:19:56,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:56,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282150006] [2025-03-16 19:19:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282150006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:56,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:56,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578586126] [2025-03-16 19:19:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:56,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:56,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:56,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:56,462 INFO L87 Difference]: Start difference. First operand 2510 states and 3534 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:56,500 INFO L93 Difference]: Finished difference Result 5587 states and 7950 transitions. [2025-03-16 19:19:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-03-16 19:19:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:56,510 INFO L225 Difference]: With dead ends: 5587 [2025-03-16 19:19:56,510 INFO L226 Difference]: Without dead ends: 3756 [2025-03-16 19:19:56,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:56,514 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 261 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:56,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 914 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2025-03-16 19:19:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3699. [2025-03-16 19:19:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3699 states, 3697 states have (on average 1.384906681092778) internal successors, (5120), 3698 states have internal predecessors, (5120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 5120 transitions. [2025-03-16 19:19:56,573 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 5120 transitions. Word has length 100 [2025-03-16 19:19:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:56,573 INFO L471 AbstractCegarLoop]: Abstraction has 3699 states and 5120 transitions. [2025-03-16 19:19:56,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 5120 transitions. [2025-03-16 19:19:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:19:56,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:56,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:56,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:19:56,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:56,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash 557570232, now seen corresponding path program 1 times [2025-03-16 19:19:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627132163] [2025-03-16 19:19:56,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:56,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:19:56,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:19:56,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:56,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:56,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627132163] [2025-03-16 19:19:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627132163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:56,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267087278] [2025-03-16 19:19:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:56,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:56,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:56,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:56,795 INFO L87 Difference]: Start difference. First operand 3699 states and 5120 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:56,867 INFO L93 Difference]: Finished difference Result 6857 states and 9496 transitions. [2025-03-16 19:19:56,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:56,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2025-03-16 19:19:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:56,876 INFO L225 Difference]: With dead ends: 6857 [2025-03-16 19:19:56,876 INFO L226 Difference]: Without dead ends: 3411 [2025-03-16 19:19:56,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:19:56,882 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 273 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:56,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 986 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2025-03-16 19:19:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 3364. [2025-03-16 19:19:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 3362 states have (on average 1.3723973825104105) internal successors, (4614), 3363 states have internal predecessors, (4614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4614 transitions. [2025-03-16 19:19:56,941 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4614 transitions. Word has length 102 [2025-03-16 19:19:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:56,941 INFO L471 AbstractCegarLoop]: Abstraction has 3364 states and 4614 transitions. [2025-03-16 19:19:56,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4614 transitions. [2025-03-16 19:19:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:19:56,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:56,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:56,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:19:56,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:56,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash -203858570, now seen corresponding path program 1 times [2025-03-16 19:19:56,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:56,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937298304] [2025-03-16 19:19:56,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:56,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:19:56,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:19:56,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:56,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937298304] [2025-03-16 19:19:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937298304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921331358] [2025-03-16 19:19:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:57,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:57,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:57,129 INFO L87 Difference]: Start difference. First operand 3364 states and 4614 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:57,182 INFO L93 Difference]: Finished difference Result 6670 states and 9267 transitions. [2025-03-16 19:19:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:57,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2025-03-16 19:19:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:57,199 INFO L225 Difference]: With dead ends: 6670 [2025-03-16 19:19:57,199 INFO L226 Difference]: Without dead ends: 5002 [2025-03-16 19:19:57,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:57,203 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 606 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:57,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1100 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2025-03-16 19:19:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 3462. [2025-03-16 19:19:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 3460 states have (on average 1.3684971098265897) internal successors, (4735), 3461 states have internal predecessors, (4735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 4735 transitions. [2025-03-16 19:19:57,268 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 4735 transitions. Word has length 104 [2025-03-16 19:19:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:57,268 INFO L471 AbstractCegarLoop]: Abstraction has 3462 states and 4735 transitions. [2025-03-16 19:19:57,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4735 transitions. [2025-03-16 19:19:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:19:57,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:57,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:57,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:19:57,272 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1766805223, now seen corresponding path program 1 times [2025-03-16 19:19:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:57,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294624680] [2025-03-16 19:19:57,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:57,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:57,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:19:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:19:57,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:57,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:57,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:57,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294624680] [2025-03-16 19:19:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294624680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:57,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:57,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:57,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202978225] [2025-03-16 19:19:57,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:57,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:57,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:57,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:57,318 INFO L87 Difference]: Start difference. First operand 3462 states and 4735 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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-16 19:19:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:57,344 INFO L93 Difference]: Finished difference Result 6453 states and 8918 transitions. [2025-03-16 19:19:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:57,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 105 [2025-03-16 19:19:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:57,350 INFO L225 Difference]: With dead ends: 6453 [2025-03-16 19:19:57,350 INFO L226 Difference]: Without dead ends: 3478 [2025-03-16 19:19:57,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:57,356 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:57,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2025-03-16 19:19:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3478. [2025-03-16 19:19:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3476 states have (on average 1.3668009205983889) internal successors, (4751), 3477 states have internal predecessors, (4751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4751 transitions. [2025-03-16 19:19:57,411 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4751 transitions. Word has length 105 [2025-03-16 19:19:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:57,411 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 4751 transitions. [2025-03-16 19:19:57,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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-16 19:19:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4751 transitions. [2025-03-16 19:19:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:19:57,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:57,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:57,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:19:57,415 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:57,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:57,415 INFO L85 PathProgramCache]: Analyzing trace with hash 787174014, now seen corresponding path program 1 times [2025-03-16 19:19:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051520938] [2025-03-16 19:19:57,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:57,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:19:57,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:19:57,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:57,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:57,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051520938] [2025-03-16 19:19:57,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051520938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:57,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:57,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038406206] [2025-03-16 19:19:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:57,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:57,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:57,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:57,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:57,666 INFO L87 Difference]: Start difference. First operand 3478 states and 4751 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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-16 19:19:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:57,697 INFO L93 Difference]: Finished difference Result 6845 states and 9350 transitions. [2025-03-16 19:19:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:57,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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 106 [2025-03-16 19:19:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:57,704 INFO L225 Difference]: With dead ends: 6845 [2025-03-16 19:19:57,704 INFO L226 Difference]: Without dead ends: 3462 [2025-03-16 19:19:57,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:57,708 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 4 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:57,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1036 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2025-03-16 19:19:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3462. [2025-03-16 19:19:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 3460 states have (on average 1.3653179190751445) internal successors, (4724), 3461 states have internal predecessors, (4724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 4724 transitions. [2025-03-16 19:19:57,756 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 4724 transitions. Word has length 106 [2025-03-16 19:19:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:57,756 INFO L471 AbstractCegarLoop]: Abstraction has 3462 states and 4724 transitions. [2025-03-16 19:19:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 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-16 19:19:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4724 transitions. [2025-03-16 19:19:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:19:57,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:57,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:57,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:19:57,760 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:57,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash 164951673, now seen corresponding path program 1 times [2025-03-16 19:19:57,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:57,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251395395] [2025-03-16 19:19:57,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:57,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:57,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:19:57,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:19:57,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:57,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251395395] [2025-03-16 19:19:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251395395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412889141] [2025-03-16 19:19:57,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:57,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:19:57,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:57,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:19:57,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:19:57,962 INFO L87 Difference]: Start difference. First operand 3462 states and 4724 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 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-16 19:19:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:58,017 INFO L93 Difference]: Finished difference Result 6594 states and 8964 transitions. [2025-03-16 19:19:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:58,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 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 106 [2025-03-16 19:19:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:58,022 INFO L225 Difference]: With dead ends: 6594 [2025-03-16 19:19:58,022 INFO L226 Difference]: Without dead ends: 3376 [2025-03-16 19:19:58,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:19:58,026 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 270 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:58,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1769 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2025-03-16 19:19:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3215. [2025-03-16 19:19:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3213 states have (on average 1.3423591658885776) internal successors, (4313), 3214 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4313 transitions. [2025-03-16 19:19:58,066 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4313 transitions. Word has length 106 [2025-03-16 19:19:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:58,066 INFO L471 AbstractCegarLoop]: Abstraction has 3215 states and 4313 transitions. [2025-03-16 19:19:58,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 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-16 19:19:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4313 transitions. [2025-03-16 19:19:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:19:58,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:58,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:58,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:19:58,069 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:58,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1906661293, now seen corresponding path program 1 times [2025-03-16 19:19:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682679467] [2025-03-16 19:19:58,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:58,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:19:58,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:19:58,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682679467] [2025-03-16 19:19:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682679467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:58,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:58,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822284268] [2025-03-16 19:19:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:58,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:58,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:58,116 INFO L87 Difference]: Start difference. First operand 3215 states and 4313 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-16 19:19:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:58,135 INFO L93 Difference]: Finished difference Result 5725 states and 7782 transitions. [2025-03-16 19:19:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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 107 [2025-03-16 19:19:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:58,141 INFO L225 Difference]: With dead ends: 5725 [2025-03-16 19:19:58,141 INFO L226 Difference]: Without dead ends: 4262 [2025-03-16 19:19:58,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:58,144 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 293 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:58,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 871 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2025-03-16 19:19:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 3215. [2025-03-16 19:19:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3213 states have (on average 1.3408029878618113) internal successors, (4308), 3214 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4308 transitions. [2025-03-16 19:19:58,186 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4308 transitions. Word has length 107 [2025-03-16 19:19:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:58,187 INFO L471 AbstractCegarLoop]: Abstraction has 3215 states and 4308 transitions. [2025-03-16 19:19:58,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-16 19:19:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4308 transitions. [2025-03-16 19:19:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:19:58,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:58,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:58,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:19:58,190 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1675563732, now seen corresponding path program 1 times [2025-03-16 19:19:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003048097] [2025-03-16 19:19:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:58,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:19:58,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:19:58,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:19:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003048097] [2025-03-16 19:19:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003048097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:58,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644345287] [2025-03-16 19:19:58,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:58,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:19:58,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:58,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:19:58,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:19:58,278 INFO L87 Difference]: Start difference. First operand 3215 states and 4308 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 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-16 19:19:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:58,382 INFO L93 Difference]: Finished difference Result 5297 states and 7298 transitions. [2025-03-16 19:19:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 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 108 [2025-03-16 19:19:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:58,387 INFO L225 Difference]: With dead ends: 5297 [2025-03-16 19:19:58,387 INFO L226 Difference]: Without dead ends: 3215 [2025-03-16 19:19:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:19:58,390 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 823 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:58,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 327 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:19:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2025-03-16 19:19:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3215. [2025-03-16 19:19:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3213 states have (on average 1.3246187363834423) internal successors, (4256), 3214 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4256 transitions. [2025-03-16 19:19:58,450 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4256 transitions. Word has length 108 [2025-03-16 19:19:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:58,451 INFO L471 AbstractCegarLoop]: Abstraction has 3215 states and 4256 transitions. [2025-03-16 19:19:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 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-16 19:19:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4256 transitions. [2025-03-16 19:19:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:19:58,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:58,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:58,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:19:58,454 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:58,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1291776565, now seen corresponding path program 1 times [2025-03-16 19:19:58,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:58,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439790778] [2025-03-16 19:19:58,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:58,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:58,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:19:58,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:19:58,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:19:58,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 19:19:58,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:19:58,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:19:58,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:19:58,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 19:19:58,574 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 19:19:58,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-16 19:19:58,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-16 19:19:58,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:19:58,578 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:58,714 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 19:19:58,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 07:19:58 BoogieIcfgContainer [2025-03-16 19:19:58,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 19:19:58,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 19:19:58,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 19:19:58,718 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 19:19:58,719 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:19:52" (3/4) ... [2025-03-16 19:19:58,719 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 19:19:58,877 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 95. [2025-03-16 19:19:58,964 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 19:19:58,964 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 19:19:58,964 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 19:19:58,968 INFO L158 Benchmark]: Toolchain (without parser) took 7733.89ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 121.0MB in the beginning and 215.8MB in the end (delta: -94.8MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2025-03-16 19:19:58,968 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:19:58,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.47ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 97.2MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 19:19:58,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.26ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 92.3MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:19:58,968 INFO L158 Benchmark]: Boogie Preprocessor took 53.78ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 88.4MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 19:19:58,968 INFO L158 Benchmark]: IcfgBuilder took 926.09ms. Allocated memory is still 167.8MB. Free memory was 88.4MB in the beginning and 94.3MB in the end (delta: -5.9MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2025-03-16 19:19:58,968 INFO L158 Benchmark]: TraceAbstraction took 6005.86ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 94.3MB in the beginning and 257.7MB in the end (delta: -163.4MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2025-03-16 19:19:58,969 INFO L158 Benchmark]: Witness Printer took 245.78ms. Allocated memory is still 394.3MB. Free memory was 257.7MB in the beginning and 215.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 19:19:58,969 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.47ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 97.2MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.26ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 92.3MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.78ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 88.4MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 926.09ms. Allocated memory is still 167.8MB. Free memory was 88.4MB in the beginning and 94.3MB in the end (delta: -5.9MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6005.86ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 94.3MB in the beginning and 257.7MB in the end (delta: -163.4MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 245.78ms. Allocated memory is still 394.3MB. Free memory was 257.7MB in the beginning and 215.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 527]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 = 0; [L27] char p12_old = '\x0'; [L28] char p12_new = '\x0'; [L29] _Bool ep12 = 0; [L30] port_t p13 = 0; [L31] char p13_old = '\x0'; [L32] char p13_new = '\x0'; [L33] _Bool ep13 = 0; [L34] port_t p21 = 0; [L35] char p21_old = '\x0'; [L36] char p21_new = '\x0'; [L37] _Bool ep21 = 0; [L38] port_t p23 = 0; [L39] char p23_old = '\x0'; [L40] char p23_new = '\x0'; [L41] _Bool ep23 = 0; [L42] port_t p31 = 0; [L43] char p31_old = '\x0'; [L44] char p31_new = '\x0'; [L45] _Bool ep31 = 0; [L46] port_t p32 = 0; [L47] char p32_old = '\x0'; [L48] char p32_new = '\x0'; [L49] _Bool ep32 = 0; [L50] char id1 = '\x0'; [L51] char r1 = '\x0'; [L52] char st1 = '\x0'; [L53] char nl1 = '\x0'; [L54] char m1 = '\x0'; [L55] char max1 = '\x0'; [L56] _Bool mode1 = 0; [L57] char id2 = '\x0'; [L58] char r2 = '\x0'; [L59] char st2 = '\x0'; [L60] char nl2 = '\x0'; [L61] char m2 = '\x0'; [L62] char max2 = '\x0'; [L63] _Bool mode2 = 0; [L64] char id3 = '\x0'; [L65] char r3 = '\x0'; [L66] char st3 = '\x0'; [L67] char nl3 = '\x0'; [L68] char m3 = '\x0'; [L69] char max3 = '\x0'; [L70] _Bool mode3 = 0; [L74] void (*nodes[3])() = { &node1, &node2, &node3 }; [L78] int __return_1131; [L79] int __return_1259; [L80] int __return_1679; [L81] int __return_1378; [L82] int __tmp_1379_0; [L83] int __return_1487; [L84] int __return_1392; [L87] int main__c1; [L88] int main__i2; [L89] main__c1 = 0 [L90] ep12 = __VERIFIER_nondet_bool() [L91] ep13 = __VERIFIER_nondet_bool() [L92] ep21 = __VERIFIER_nondet_bool() [L93] ep23 = __VERIFIER_nondet_bool() [L94] ep31 = __VERIFIER_nondet_bool() [L95] ep32 = __VERIFIER_nondet_bool() [L96] id1 = __VERIFIER_nondet_char() [L97] r1 = __VERIFIER_nondet_char() [L98] st1 = __VERIFIER_nondet_char() [L99] nl1 = __VERIFIER_nondet_char() [L100] m1 = __VERIFIER_nondet_char() [L101] max1 = __VERIFIER_nondet_char() [L102] mode1 = __VERIFIER_nondet_bool() [L103] id2 = __VERIFIER_nondet_char() [L104] r2 = __VERIFIER_nondet_char() [L105] st2 = __VERIFIER_nondet_char() [L106] nl2 = __VERIFIER_nondet_char() [L107] m2 = __VERIFIER_nondet_char() [L108] max2 = __VERIFIER_nondet_char() [L109] mode2 = __VERIFIER_nondet_bool() [L110] id3 = __VERIFIER_nondet_char() [L111] r3 = __VERIFIER_nondet_char() [L112] st3 = __VERIFIER_nondet_char() [L113] nl3 = __VERIFIER_nondet_char() [L114] m3 = __VERIFIER_nondet_char() [L115] max3 = __VERIFIER_nondet_char() [L116] mode3 = __VERIFIER_nondet_bool() [L118] _Bool init__r121; [L119] _Bool init__r131; [L120] _Bool init__r211; [L121] _Bool init__r231; [L122] _Bool init__r311; [L123] _Bool init__r321; [L124] _Bool init__r122; [L125] int init__tmp; [L126] _Bool init__r132; [L127] int init__tmp___0; [L128] _Bool init__r212; [L129] int init__tmp___1; [L130] _Bool init__r232; [L131] int init__tmp___2; [L132] _Bool init__r312; [L133] int init__tmp___3; [L134] _Bool init__r322; [L135] int init__tmp___4; [L136] int init__tmp___5; [L137] init__r121 = ep12 [L138] init__r131 = ep13 [L139] init__r211 = ep21 [L140] init__r231 = ep23 [L141] init__r311 = ep31 [L142] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(init__r121 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1812] COND TRUE !(init__r131 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1814] COND TRUE !(ep32 == 0) [L1816] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND TRUE !(init__r131 == 0) [L150] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___0=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r211 == 0) [L155] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___1=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(init__r231 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1743] COND TRUE !(init__r211 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1745] COND TRUE !(ep13 == 0) [L1747] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, init__tmp___2=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(init__r311 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1720] COND TRUE !(init__r321 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1722] COND TRUE !(ep21 == 0) [L1724] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, init__tmp___3=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r321=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE !(init__r321 == 0) [L170] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L225] COND TRUE ((int)mode3) == 0 [L227] init__tmp___5 = 1 [L228] __return_1131 = init__tmp___5 [L229] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE main__i2 != 0 [L232] p12_old = nomsg [L233] p12_new = nomsg [L234] p13_old = nomsg [L235] p13_new = nomsg [L236] p21_old = nomsg [L237] p21_new = nomsg [L238] p23_old = nomsg [L239] p23_new = nomsg [L240] p31_old = nomsg [L241] p31_new = nomsg [L242] p32_old = nomsg [L243] p32_new = nomsg [L244] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L248] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE !(ep13 == 0) [L269] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L270] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] COND TRUE p13_new == nomsg [L274] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L276] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L280] COND FALSE !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L288] COND TRUE !(ep21 == 0) [L290] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L291] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] COND TRUE p21_new == nomsg [L295] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND TRUE ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L331] COND TRUE !(ep32 == 0) [L333] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L334] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L336] COND TRUE p32_new == nomsg [L338] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L340] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=5, p13_old=-1, p21=0, p21_new=0, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=4, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] mode3 = 1 [L343] p12_old = p12_new [L344] p12_new = nomsg [L345] p13_old = p13_new [L346] p13_new = nomsg [L347] p21_old = p21_new [L348] p21_new = nomsg [L349] p23_old = p23_new [L350] p23_new = nomsg [L351] p31_old = p31_new [L352] p31_new = nomsg [L353] p32_old = p32_new [L354] p32_new = nomsg [L356] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L361] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L381] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((int)r1) < 2 [L385] check__tmp = 1 [L386] __return_1259 = check__tmp [L387] main__c1 = __return_1259 [L389] _Bool __tmp_1; [L390] __tmp_1 = main__c1 [L391] _Bool assert__arg; [L392] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND FALSE !(assert__arg == 0) [L399] int main____CPAchecker_TMP_0 = main__i2; [L400] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L404] COND TRUE !(mode1 == 0) [L406] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE !(ep21 == 0) [L409] m1 = p21_old [L410] p21_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L411] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE ((int)max1) == ((int)id1) [L427] st1 = 1 [L428] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L430] COND TRUE !(mode2 == 0) [L432] r2 = (char)(((int)r2) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L433] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L441] COND TRUE !(ep32 == 0) [L443] m2 = p32_old [L444] p32_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=0, max3=4, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L445] COND TRUE ((int)m2) > ((int)max2) [L447] max2 = m2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=4, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L449] COND FALSE !(((int)r2) == 2) [L455] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=4, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L457] COND TRUE !(mode3 == 0) [L459] r3 = (char)(((int)r3) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=4, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=5, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L460] COND TRUE !(ep13 == 0) [L462] m3 = p13_old [L463] p13_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=4, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L464] COND TRUE ((int)m3) > ((int)max3) [L466] max3 = m3 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L468] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND FALSE !(((int)r3) == 2) [L482] mode3 = 0 [L483] p12_old = p12_new [L484] p12_new = nomsg [L485] p13_old = p13_new [L486] p13_new = nomsg [L487] p21_old = p21_new [L488] p21_new = nomsg [L489] p23_old = p23_new [L490] p23_new = nomsg [L491] p31_old = p31_new [L492] p31_new = nomsg [L493] p32_old = p32_new [L494] p32_new = nomsg [L496] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L501] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L503] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L505] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L517] check__tmp = 0 [L518] __return_1679 = check__tmp [L519] main__c1 = __return_1679 [L521] _Bool __tmp_2; [L522] __tmp_2 = main__c1 [L523] _Bool assert__arg; [L524] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L525] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L527] reach_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=5, id2=0, id3=4, init__r121=0, init__r311=0, m1=0, m2=4, m3=5, main____CPAchecker_TMP_0=0, main__i2=1, max1=5, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - UnprovableResult [Line: 728]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 236 locations, 421 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5479 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5479 mSDsluCounter, 19330 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10373 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 8957 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3699occurred in iteration=12, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 5998 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1989 NumberOfCodeBlocks, 1989 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 5758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-16 19:19:58,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE