./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+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fc8deb48660011a55df6a125b576e7008308183eeefddcba409d6b7b87cd69f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:19:49,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:19:49,393 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,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:19:49,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:19:49,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:19:49,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:19:49,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:19:49,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:19:49,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:19:49,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:19:49,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:19:49,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:19:49,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:19:49,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:19:49,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:19:49,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:19:49,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:19:49,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:19:49,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:19:49,428 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 -> 9fc8deb48660011a55df6a125b576e7008308183eeefddcba409d6b7b87cd69f [2025-03-16 19:19:49,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:19:49,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:19:49,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:19:49,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:19:49,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:19:49,636 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+nlh-reducer.c [2025-03-16 19:19:50,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7ea0005/c13dfb1f319e44448f86ae09879eda22/FLAG107b67ee9 [2025-03-16 19:19:50,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:19:50,959 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+nlh-reducer.c [2025-03-16 19:19:50,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7ea0005/c13dfb1f319e44448f86ae09879eda22/FLAG107b67ee9 [2025-03-16 19:19:51,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7ea0005/c13dfb1f319e44448f86ae09879eda22 [2025-03-16 19:19:51,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:19:51,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:19:51,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:19:51,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:19:51,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:19:51,277 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,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6309b45f 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,278 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,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:19:51,485 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+nlh-reducer.c[9863,9876] [2025-03-16 19:19:51,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:19:51,563 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:19:51,602 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+nlh-reducer.c[9863,9876] [2025-03-16 19:19:51,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:19:51,643 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:19:51,644 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,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:19:51,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:19:51,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:19:51,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:19:51,650 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,661 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,684 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 930 [2025-03-16 19:19:51,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:19:51,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:19:51,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:19:51,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:19:51,691 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,691 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,694 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,713 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,713 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,713 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,726 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,728 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,733 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,735 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,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:19:51,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:19:51,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:19:51,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:19:51,746 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,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:19:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:19:51,775 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,781 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,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:19:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:19:51,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:19:51,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:19:51,884 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:19:51,886 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:19:52,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;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,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1008: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:19:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc main_~check__tmp~2#1; [2025-03-16 19:19:52,651 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-16 19:19:52,652 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:19:52,660 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:19:52,661 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:19:52,661 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,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:19:52,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:19:52,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:19:52,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:19:52,666 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,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9cb830 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,667 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,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9cb830 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,667 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,668 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:19:52,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:19:52,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 217 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:19:52,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:19:52,724 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;@76df88dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:19:52,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:19:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 215 states have (on average 1.7813953488372094) internal successors, (383), 216 states have internal predecessors, (383), 0 states have call successors, (0), 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,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:19:52,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:52,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:19:52,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:52,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:52,737 INFO L85 PathProgramCache]: Analyzing trace with hash -279057519, now seen corresponding path program 1 times [2025-03-16 19:19:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275349129] [2025-03-16 19:19:52,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:19:52,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:19:52,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:52,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:53,468 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,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275349129] [2025-03-16 19:19:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275349129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612467529] [2025-03-16 19:19:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:53,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:53,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:53,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:53,495 INFO L87 Difference]: Start difference. First operand has 217 states, 215 states have (on average 1.7813953488372094) internal successors, (383), 216 states have internal predecessors, (383), 0 states have call successors, (0), 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 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:53,611 INFO L93 Difference]: Finished difference Result 809 states and 1434 transitions. [2025-03-16 19:19:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 19:19:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:53,627 INFO L225 Difference]: With dead ends: 809 [2025-03-16 19:19:53,628 INFO L226 Difference]: Without dead ends: 609 [2025-03-16 19:19:53,632 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,634 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 678 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:53,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1311 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:19:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-16 19:19:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 411. [2025-03-16 19:19:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.475609756097561) internal successors, (605), 410 states have internal predecessors, (605), 0 states have call successors, (0), 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,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 605 transitions. [2025-03-16 19:19:53,695 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 605 transitions. Word has length 93 [2025-03-16 19:19:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:53,696 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 605 transitions. [2025-03-16 19:19:53,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 605 transitions. [2025-03-16 19:19:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:19:53,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:53,700 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:53,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:19:53,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:53,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1709858339, now seen corresponding path program 1 times [2025-03-16 19:19:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:53,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764965939] [2025-03-16 19:19:53,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:53,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:19:53,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:19:53,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:53,800 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,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:53,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764965939] [2025-03-16 19:19:53,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764965939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:53,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:53,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650120634] [2025-03-16 19:19:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:53,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:53,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:53,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:53,803 INFO L87 Difference]: Start difference. First operand 411 states and 605 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) 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:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:53,834 INFO L93 Difference]: Finished difference Result 797 states and 1167 transitions. [2025-03-16 19:19:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) 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:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:53,837 INFO L225 Difference]: With dead ends: 797 [2025-03-16 19:19:53,837 INFO L226 Difference]: Without dead ends: 413 [2025-03-16 19:19:53,840 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,840 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 632 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,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 632 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,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-16 19:19:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-16 19:19:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4733009708737863) internal successors, (607), 412 states have internal predecessors, (607), 0 states have call successors, (0), 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,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 607 transitions. [2025-03-16 19:19:53,858 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 607 transitions. Word has length 94 [2025-03-16 19:19:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:53,858 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 607 transitions. [2025-03-16 19:19:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) 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:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 607 transitions. [2025-03-16 19:19:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:19:53,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:53,860 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:53,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:19:53,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:53,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash 587073577, now seen corresponding path program 1 times [2025-03-16 19:19:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:53,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195418278] [2025-03-16 19:19:53,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:53,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:53,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:19:53,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:19:53,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:53,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,217 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,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195418278] [2025-03-16 19:19:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195418278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277381114] [2025-03-16 19:19:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:54,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:54,221 INFO L87 Difference]: Start difference. First operand 413 states and 607 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 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,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:54,243 INFO L93 Difference]: Finished difference Result 813 states and 1193 transitions. [2025-03-16 19:19:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:54,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 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,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:54,246 INFO L225 Difference]: With dead ends: 813 [2025-03-16 19:19:54,246 INFO L226 Difference]: Without dead ends: 413 [2025-03-16 19:19:54,247 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,249 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 20 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1019 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,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1019 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,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-16 19:19:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 412. [2025-03-16 19:19:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.467153284671533) internal successors, (603), 411 states have internal predecessors, (603), 0 states have call successors, (0), 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,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 603 transitions. [2025-03-16 19:19:54,259 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 603 transitions. Word has length 95 [2025-03-16 19:19:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:54,259 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 603 transitions. [2025-03-16 19:19:54,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 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,260 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 603 transitions. [2025-03-16 19:19:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:19:54,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:54,262 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,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:19:54,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2091022542, now seen corresponding path program 1 times [2025-03-16 19:19:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:54,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733523667] [2025-03-16 19:19:54,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:54,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:19:54,287 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,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:54,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,355 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,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733523667] [2025-03-16 19:19:54,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733523667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:54,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903520669] [2025-03-16 19:19:54,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:54,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:54,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:54,357 INFO L87 Difference]: Start difference. First operand 412 states and 603 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,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:54,382 INFO L93 Difference]: Finished difference Result 1032 states and 1528 transitions. [2025-03-16 19:19:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:54,382 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,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:54,385 INFO L225 Difference]: With dead ends: 1032 [2025-03-16 19:19:54,385 INFO L226 Difference]: Without dead ends: 796 [2025-03-16 19:19:54,387 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,388 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 249 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:54,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 849 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-16 19:19:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 794. [2025-03-16 19:19:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.4539722572509457) internal successors, (1153), 793 states have internal predecessors, (1153), 0 states have call successors, (0), 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,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1153 transitions. [2025-03-16 19:19:54,413 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1153 transitions. Word has length 95 [2025-03-16 19:19:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:54,413 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1153 transitions. [2025-03-16 19:19:54,413 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:54,414 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1153 transitions. [2025-03-16 19:19:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:19:54,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:54,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] [2025-03-16 19:19:54,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:19:54,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:54,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2062522252, now seen corresponding path program 1 times [2025-03-16 19:19:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:54,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065089805] [2025-03-16 19:19:54,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:54,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:19:54,468 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,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:54,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,704 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,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065089805] [2025-03-16 19:19:54,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065089805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:54,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660482954] [2025-03-16 19:19:54,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:54,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:54,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:54,707 INFO L87 Difference]: Start difference. First operand 794 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 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,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:54,728 INFO L93 Difference]: Finished difference Result 1234 states and 1809 transitions. [2025-03-16 19:19:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 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,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:54,730 INFO L225 Difference]: With dead ends: 1234 [2025-03-16 19:19:54,731 INFO L226 Difference]: Without dead ends: 606 [2025-03-16 19:19:54,732 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,733 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 23 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1023 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,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1023 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,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-16 19:19:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2025-03-16 19:19:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 1.4462809917355373) internal successors, (875), 605 states have internal predecessors, (875), 0 states have call successors, (0), 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 875 transitions. [2025-03-16 19:19:54,751 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 875 transitions. Word has length 95 [2025-03-16 19:19:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:54,752 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 875 transitions. [2025-03-16 19:19:54,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 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,752 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 875 transitions. [2025-03-16 19:19:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:19:54,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:54,753 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] [2025-03-16 19:19:54,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:19:54,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:54,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash -337062037, now seen corresponding path program 1 times [2025-03-16 19:19:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863431476] [2025-03-16 19:19:54,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:54,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:19:54,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:19:54,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:54,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:54,972 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,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863431476] [2025-03-16 19:19:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863431476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17337932] [2025-03-16 19:19:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:54,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:54,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:54,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:54,974 INFO L87 Difference]: Start difference. First operand 606 states and 875 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,039 INFO L93 Difference]: Finished difference Result 1472 states and 2126 transitions. [2025-03-16 19:19:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:55,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 19:19:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,042 INFO L225 Difference]: With dead ends: 1472 [2025-03-16 19:19:55,042 INFO L226 Difference]: Without dead ends: 892 [2025-03-16 19:19:55,043 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,043 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 257 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:55,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1228 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-03-16 19:19:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 890. [2025-03-16 19:19:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.4353205849268842) internal successors, (1276), 889 states have internal predecessors, (1276), 0 states have call successors, (0), 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,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1276 transitions. [2025-03-16 19:19:55,061 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1276 transitions. Word has length 97 [2025-03-16 19:19:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,061 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1276 transitions. [2025-03-16 19:19:55,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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,061 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1276 transitions. [2025-03-16 19:19:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:19:55,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,065 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,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:19:55,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 322126952, now seen corresponding path program 1 times [2025-03-16 19:19:55,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371841636] [2025-03-16 19:19:55,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:19:55,089 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,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,138 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,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371841636] [2025-03-16 19:19:55,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371841636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:55,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97306417] [2025-03-16 19:19:55,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:55,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:55,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:55,140 INFO L87 Difference]: Start difference. First operand 890 states and 1276 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,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,170 INFO L93 Difference]: Finished difference Result 1883 states and 2757 transitions. [2025-03-16 19:19:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:55,170 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,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,175 INFO L225 Difference]: With dead ends: 1883 [2025-03-16 19:19:55,176 INFO L226 Difference]: Without dead ends: 1316 [2025-03-16 19:19:55,178 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,178 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 245 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 870 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:55,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 870 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:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2025-03-16 19:19:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1314. [2025-03-16 19:19:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.4287890327494288) internal successors, (1876), 1313 states have internal predecessors, (1876), 0 states have call successors, (0), 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,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1876 transitions. [2025-03-16 19:19:55,208 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1876 transitions. Word has length 99 [2025-03-16 19:19:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,208 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1876 transitions. [2025-03-16 19:19:55,208 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:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1876 transitions. [2025-03-16 19:19:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:19:55,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,210 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] [2025-03-16 19:19:55,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:19:55,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash -796682581, now seen corresponding path program 1 times [2025-03-16 19:19:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540884124] [2025-03-16 19:19:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:19:55,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:19:55,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,427 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,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540884124] [2025-03-16 19:19:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540884124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870526799] [2025-03-16 19:19:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:55,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:55,429 INFO L87 Difference]: Start difference. First operand 1314 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,495 INFO L93 Difference]: Finished difference Result 4919 states and 7009 transitions. [2025-03-16 19:19:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:55,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-16 19:19:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,506 INFO L225 Difference]: With dead ends: 4919 [2025-03-16 19:19:55,507 INFO L226 Difference]: Without dead ends: 3655 [2025-03-16 19:19:55,509 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:55,509 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 523 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:55,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1048 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2025-03-16 19:19:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 2487. [2025-03-16 19:19:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.415124698310539) internal successors, (3518), 2486 states have internal predecessors, (3518), 0 states have call successors, (0), 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,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3518 transitions. [2025-03-16 19:19:55,571 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3518 transitions. Word has length 101 [2025-03-16 19:19:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,571 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3518 transitions. [2025-03-16 19:19:55,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3518 transitions. [2025-03-16 19:19:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:19:55,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,574 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:55,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:19:55,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1726607853, now seen corresponding path program 1 times [2025-03-16 19:19:55,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066102696] [2025-03-16 19:19:55,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:19:55,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:19:55,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,620 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,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066102696] [2025-03-16 19:19:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066102696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724948949] [2025-03-16 19:19:55,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:55,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:55,622 INFO L87 Difference]: Start difference. First operand 2487 states and 3518 transitions. Second operand has 3 states, 3 states have (on average 34.0) 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:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:55,651 INFO L93 Difference]: Finished difference Result 4879 states and 6908 transitions. [2025-03-16 19:19:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:55,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) 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:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:55,658 INFO L225 Difference]: With dead ends: 4879 [2025-03-16 19:19:55,658 INFO L226 Difference]: Without dead ends: 2493 [2025-03-16 19:19:55,661 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,661 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 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:55,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 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:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2025-03-16 19:19:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2493. [2025-03-16 19:19:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2492 states have (on average 1.4141252006420546) internal successors, (3524), 2492 states have internal predecessors, (3524), 0 states have call successors, (0), 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,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3524 transitions. [2025-03-16 19:19:55,730 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3524 transitions. Word has length 102 [2025-03-16 19:19:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:55,730 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 3524 transitions. [2025-03-16 19:19:55,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) 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:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3524 transitions. [2025-03-16 19:19:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:19:55,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:55,733 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] [2025-03-16 19:19:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:19:55,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1304175293, now seen corresponding path program 1 times [2025-03-16 19:19:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:55,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043812697] [2025-03-16 19:19:55,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:55,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:19:55,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:19:55,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:55,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:55,982 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,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043812697] [2025-03-16 19:19:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043812697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:55,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:55,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061580297] [2025-03-16 19:19:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:55,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:55,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:55,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:55,984 INFO L87 Difference]: Start difference. First operand 2493 states and 3524 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:56,014 INFO L93 Difference]: Finished difference Result 4949 states and 6994 transitions. [2025-03-16 19:19:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:56,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-16 19:19:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:56,022 INFO L225 Difference]: With dead ends: 4949 [2025-03-16 19:19:56,022 INFO L226 Difference]: Without dead ends: 2487 [2025-03-16 19:19:56,024 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,025 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 14 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 995 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,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 995 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,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-03-16 19:19:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2487. [2025-03-16 19:19:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.412711182622687) internal successors, (3512), 2486 states have internal predecessors, (3512), 0 states have call successors, (0), 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,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3512 transitions. [2025-03-16 19:19:56,087 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3512 transitions. Word has length 103 [2025-03-16 19:19:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:56,087 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3512 transitions. [2025-03-16 19:19:56,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3512 transitions. [2025-03-16 19:19:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:19:56,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:56,090 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] [2025-03-16 19:19:56,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:19:56,090 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:56,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash -851086488, now seen corresponding path program 1 times [2025-03-16 19:19:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106236277] [2025-03-16 19:19:56,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:56,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:19:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:19:56,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:56,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:56,149 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,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:56,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106236277] [2025-03-16 19:19:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106236277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:56,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:56,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105850524] [2025-03-16 19:19:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:56,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:56,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:56,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:56,151 INFO L87 Difference]: Start difference. First operand 2487 states and 3512 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:56,193 INFO L93 Difference]: Finished difference Result 5502 states and 7854 transitions. [2025-03-16 19:19:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-16 19:19:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:56,205 INFO L225 Difference]: With dead ends: 5502 [2025-03-16 19:19:56,206 INFO L226 Difference]: Without dead ends: 3694 [2025-03-16 19:19:56,208 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,209 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 236 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 841 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,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 841 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,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2025-03-16 19:19:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3692. [2025-03-16 19:19:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3691 states have (on average 1.3876998103494989) internal successors, (5122), 3691 states have internal predecessors, (5122), 0 states have call successors, (0), 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,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5122 transitions. [2025-03-16 19:19:56,284 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5122 transitions. Word has length 103 [2025-03-16 19:19:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 3692 states and 5122 transitions. [2025-03-16 19:19:56,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5122 transitions. [2025-03-16 19:19:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:19:56,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:56,288 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:56,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:19:56,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:56,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:56,289 INFO L85 PathProgramCache]: Analyzing trace with hash 772621990, now seen corresponding path program 1 times [2025-03-16 19:19:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:56,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943781828] [2025-03-16 19:19:56,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:56,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:19:56,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:19:56,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:56,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:56,596 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,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:56,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943781828] [2025-03-16 19:19:56,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943781828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:56,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:19:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606150758] [2025-03-16 19:19:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:56,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:19:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:56,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:19:56,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:19:56,598 INFO L87 Difference]: Start difference. First operand 3692 states and 5122 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:56,703 INFO L93 Difference]: Finished difference Result 8048 states and 11728 transitions. [2025-03-16 19:19:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-16 19:19:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:56,718 INFO L225 Difference]: With dead ends: 8048 [2025-03-16 19:19:56,718 INFO L226 Difference]: Without dead ends: 5906 [2025-03-16 19:19:56,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:19:56,723 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1339 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:56,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 763 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:19:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5906 states. [2025-03-16 19:19:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5906 to 5904. [2025-03-16 19:19:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5904 states, 5903 states have (on average 1.4284262239539218) internal successors, (8432), 5903 states have internal predecessors, (8432), 0 states have call successors, (0), 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,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5904 states to 5904 states and 8432 transitions. [2025-03-16 19:19:56,818 INFO L78 Accepts]: Start accepts. Automaton has 5904 states and 8432 transitions. Word has length 105 [2025-03-16 19:19:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:56,819 INFO L471 AbstractCegarLoop]: Abstraction has 5904 states and 8432 transitions. [2025-03-16 19:19:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5904 states and 8432 transitions. [2025-03-16 19:19:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:19:56,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:56,823 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:56,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:19:56,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:56,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 991476708, now seen corresponding path program 1 times [2025-03-16 19:19:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044934329] [2025-03-16 19:19:56,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:56,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:19:56,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:19:56,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:56,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:57,010 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,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044934329] [2025-03-16 19:19:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044934329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:19:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673407421] [2025-03-16 19:19:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:57,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:19:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:57,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:19:57,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:19:57,012 INFO L87 Difference]: Start difference. First operand 5904 states and 8432 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 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,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:57,162 INFO L93 Difference]: Finished difference Result 12428 states and 18850 transitions. [2025-03-16 19:19:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 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,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:57,194 INFO L225 Difference]: With dead ends: 12428 [2025-03-16 19:19:57,194 INFO L226 Difference]: Without dead ends: 9166 [2025-03-16 19:19:57,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:19:57,201 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 180 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:57,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1007 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:19:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2025-03-16 19:19:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 9164. [2025-03-16 19:19:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9164 states, 9163 states have (on average 1.4702608316053694) internal successors, (13472), 9163 states have internal predecessors, (13472), 0 states have call successors, (0), 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,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 13472 transitions. [2025-03-16 19:19:57,386 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 13472 transitions. Word has length 105 [2025-03-16 19:19:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:57,386 INFO L471 AbstractCegarLoop]: Abstraction has 9164 states and 13472 transitions. [2025-03-16 19:19:57,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 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,387 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 13472 transitions. [2025-03-16 19:19:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:19:57,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:57,391 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,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:19:57,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash 913170600, now seen corresponding path program 1 times [2025-03-16 19:19:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177089622] [2025-03-16 19:19:57,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:57,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:19:57,445 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,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:57,614 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,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177089622] [2025-03-16 19:19:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177089622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:57,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:57,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748371750] [2025-03-16 19:19:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:57,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:57,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:57,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:57,615 INFO L87 Difference]: Start difference. First operand 9164 states and 13472 transitions. Second operand has 4 states, 4 states have (on average 26.25) 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,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:57,689 INFO L93 Difference]: Finished difference Result 17111 states and 25164 transitions. [2025-03-16 19:19:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) 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,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:57,702 INFO L225 Difference]: With dead ends: 17111 [2025-03-16 19:19:57,703 INFO L226 Difference]: Without dead ends: 8214 [2025-03-16 19:19:57,712 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:57,712 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 246 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:57,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1241 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2025-03-16 19:19:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 8177. [2025-03-16 19:19:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 8176 states have (on average 1.4626956947162426) internal successors, (11959), 8176 states have internal predecessors, (11959), 0 states have call successors, (0), 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,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 11959 transitions. [2025-03-16 19:19:57,856 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 11959 transitions. Word has length 105 [2025-03-16 19:19:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:57,858 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 11959 transitions. [2025-03-16 19:19:57,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) 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,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 11959 transitions. [2025-03-16 19:19:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:19:57,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:57,862 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,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:19:57,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:57,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash -402735806, now seen corresponding path program 1 times [2025-03-16 19:19:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619556335] [2025-03-16 19:19:57,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:57,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:19:57,878 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,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:57,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:57,908 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,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:57,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619556335] [2025-03-16 19:19:57,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619556335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72376751] [2025-03-16 19:19:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:57,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:57,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:57,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:57,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:57,909 INFO L87 Difference]: Start difference. First operand 8177 states and 11959 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:57,945 INFO L93 Difference]: Finished difference Result 15437 states and 22740 transitions. [2025-03-16 19:19:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:57,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:57,964 INFO L225 Difference]: With dead ends: 15437 [2025-03-16 19:19:57,964 INFO L226 Difference]: Without dead ends: 11058 [2025-03-16 19:19:57,973 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,974 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 282 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 815 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:57,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 815 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:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11058 states. [2025-03-16 19:19:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11058 to 8177. [2025-03-16 19:19:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 8176 states have (on average 1.4624510763209393) internal successors, (11957), 8176 states have internal predecessors, (11957), 0 states have call successors, (0), 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,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 11957 transitions. [2025-03-16 19:19:58,114 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 11957 transitions. Word has length 106 [2025-03-16 19:19:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:58,115 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 11957 transitions. [2025-03-16 19:19:58,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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,115 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 11957 transitions. [2025-03-16 19:19:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:19:58,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:58,118 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,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:19:58,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:58,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1958001957, now seen corresponding path program 1 times [2025-03-16 19:19:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647810404] [2025-03-16 19:19:58,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:58,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:58,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:19:58,175 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,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:58,314 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,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647810404] [2025-03-16 19:19:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647810404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895077907] [2025-03-16 19:19:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:58,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:58,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:58,317 INFO L87 Difference]: Start difference. First operand 8177 states and 11957 transitions. Second operand has 4 states, 4 states have (on average 26.75) 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,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:58,420 INFO L93 Difference]: Finished difference Result 24463 states and 35800 transitions. [2025-03-16 19:19:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:19:58,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) 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,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:58,448 INFO L225 Difference]: With dead ends: 24463 [2025-03-16 19:19:58,448 INFO L226 Difference]: Without dead ends: 16436 [2025-03-16 19:19:58,462 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:58,463 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 817 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:58,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1186 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16436 states. [2025-03-16 19:19:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16436 to 8269. [2025-03-16 19:19:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8269 states, 8268 states have (on average 1.458030962747944) internal successors, (12055), 8268 states have internal predecessors, (12055), 0 states have call successors, (0), 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,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 12055 transitions. [2025-03-16 19:19:58,650 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 12055 transitions. Word has length 107 [2025-03-16 19:19:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:58,650 INFO L471 AbstractCegarLoop]: Abstraction has 8269 states and 12055 transitions. [2025-03-16 19:19:58,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) 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,650 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 12055 transitions. [2025-03-16 19:19:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:19:58,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:58,654 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,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:19:58,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:58,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 499783869, now seen corresponding path program 1 times [2025-03-16 19:19:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:58,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547312276] [2025-03-16 19:19:58,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:58,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:19:58,673 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,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:58,703 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,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547312276] [2025-03-16 19:19:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547312276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933642037] [2025-03-16 19:19:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:19:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:58,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:19:58,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:19:58,705 INFO L87 Difference]: Start difference. First operand 8269 states and 12055 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 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,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:58,737 INFO L93 Difference]: Finished difference Result 14134 states and 20741 transitions. [2025-03-16 19:19:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:19:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 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,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:58,751 INFO L225 Difference]: With dead ends: 14134 [2025-03-16 19:19:58,751 INFO L226 Difference]: Without dead ends: 8279 [2025-03-16 19:19:58,759 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,759 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 614 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:58,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 614 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:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2025-03-16 19:19:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8279. [2025-03-16 19:19:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8279 states, 8278 states have (on average 1.4574776516066683) internal successors, (12065), 8278 states have internal predecessors, (12065), 0 states have call successors, (0), 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,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 12065 transitions. [2025-03-16 19:19:58,865 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 12065 transitions. Word has length 108 [2025-03-16 19:19:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:58,865 INFO L471 AbstractCegarLoop]: Abstraction has 8279 states and 12065 transitions. [2025-03-16 19:19:58,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 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,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 12065 transitions. [2025-03-16 19:19:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:19:58,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:58,870 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, 1] [2025-03-16 19:19:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:19:58,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:58,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1403711875, now seen corresponding path program 1 times [2025-03-16 19:19:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:58,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074743787] [2025-03-16 19:19:58,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:58,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:19:58,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:19:58,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:58,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:59,131 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:59,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074743787] [2025-03-16 19:19:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074743787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:59,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:19:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567395102] [2025-03-16 19:19:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:59,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:59,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:59,133 INFO L87 Difference]: Start difference. First operand 8279 states and 12065 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:59,178 INFO L93 Difference]: Finished difference Result 15069 states and 22060 transitions. [2025-03-16 19:19:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:59,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:19:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:59,193 INFO L225 Difference]: With dead ends: 15069 [2025-03-16 19:19:59,193 INFO L226 Difference]: Without dead ends: 8279 [2025-03-16 19:19:59,202 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:59,202 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 946 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:59,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 946 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:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2025-03-16 19:19:59,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8274. [2025-03-16 19:19:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8274 states, 8273 states have (on average 1.4567871388855314) internal successors, (12052), 8273 states have internal predecessors, (12052), 0 states have call successors, (0), 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:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 12052 transitions. [2025-03-16 19:19:59,347 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 12052 transitions. Word has length 109 [2025-03-16 19:19:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:59,347 INFO L471 AbstractCegarLoop]: Abstraction has 8274 states and 12052 transitions. [2025-03-16 19:19:59,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 12052 transitions. [2025-03-16 19:19:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:19:59,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:59,353 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, 1] [2025-03-16 19:19:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:19:59,353 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:59,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash -950623070, now seen corresponding path program 1 times [2025-03-16 19:19:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137414026] [2025-03-16 19:19:59,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:59,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:19:59,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:19:59,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:59,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:19:59,546 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:59,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:19:59,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137414026] [2025-03-16 19:19:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137414026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:19:59,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:19:59,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:19:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997393724] [2025-03-16 19:19:59,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:19:59,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:19:59,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:19:59,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:19:59,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:19:59,547 INFO L87 Difference]: Start difference. First operand 8274 states and 12052 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:19:59,599 INFO L93 Difference]: Finished difference Result 12807 states and 18804 transitions. [2025-03-16 19:19:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:19:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:19:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:19:59,612 INFO L225 Difference]: With dead ends: 12807 [2025-03-16 19:19:59,612 INFO L226 Difference]: Without dead ends: 7621 [2025-03-16 19:19:59,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:59,619 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 475 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:19:59,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 613 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:19:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7621 states. [2025-03-16 19:19:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7621 to 7381. [2025-03-16 19:19:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7381 states, 7380 states have (on average 1.4440379403794037) internal successors, (10657), 7380 states have internal predecessors, (10657), 0 states have call successors, (0), 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:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7381 states to 7381 states and 10657 transitions. [2025-03-16 19:19:59,734 INFO L78 Accepts]: Start accepts. Automaton has 7381 states and 10657 transitions. Word has length 109 [2025-03-16 19:19:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:19:59,734 INFO L471 AbstractCegarLoop]: Abstraction has 7381 states and 10657 transitions. [2025-03-16 19:19:59,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:19:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 7381 states and 10657 transitions. [2025-03-16 19:19:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:19:59,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:19:59,738 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, 1, 1, 1] [2025-03-16 19:19:59,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:19:59,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:19:59,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:19:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash -142245099, now seen corresponding path program 1 times [2025-03-16 19:19:59,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:19:59,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240185048] [2025-03-16 19:19:59,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:19:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:19:59,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:19:59,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:19:59,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:59,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:19:59,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 19:19:59,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:19:59,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:19:59,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:19:59,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:19:59,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 19:19:59,884 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 19:19:59,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 19:19:59,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:19:59,888 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:20:00,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 19:20:00,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 07:20:00 BoogieIcfgContainer [2025-03-16 19:20:00,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 19:20:00,031 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 19:20:00,031 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 19:20:00,031 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 19:20:00,032 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:20:00,033 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 19:20:00,176 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 95. [2025-03-16 19:20:00,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 19:20:00,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 19:20:00,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 19:20:00,256 INFO L158 Benchmark]: Toolchain (without parser) took 8983.26ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 122.9MB in the beginning and 413.0MB in the end (delta: -290.1MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB. [2025-03-16 19:20:00,257 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:20:00,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.97ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 100.5MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 19:20:00,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.66ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 95.9MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:20:00,257 INFO L158 Benchmark]: Boogie Preprocessor took 60.42ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 92.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:20:00,257 INFO L158 Benchmark]: IcfgBuilder took 915.75ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 107.0MB in the end (delta: -14.4MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2025-03-16 19:20:00,257 INFO L158 Benchmark]: TraceAbstraction took 7367.85ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 106.1MB in the beginning and 459.1MB in the end (delta: -353.0MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2025-03-16 19:20:00,257 INFO L158 Benchmark]: Witness Printer took 224.65ms. Allocated memory is still 629.1MB. Free memory was 459.1MB in the beginning and 413.0MB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 19:20:00,258 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.19ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.97ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 100.5MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.66ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 95.9MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.42ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 92.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 915.75ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 107.0MB in the end (delta: -14.4MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7367.85ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 106.1MB in the beginning and 459.1MB in the end (delta: -353.0MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Witness Printer took 224.65ms. Allocated memory is still 629.1MB. Free memory was 459.1MB in the beginning and 413.0MB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. 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: 541]: 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_1378; [L81] int __tmp_1379_0; [L82] int __return_1487; [L83] int __return_1392; [L86] int main__c1; [L87] int main__i2; [L88] main__c1 = 0 [L89] ep12 = __VERIFIER_nondet_bool() [L90] ep13 = __VERIFIER_nondet_bool() [L91] ep21 = __VERIFIER_nondet_bool() [L92] ep23 = __VERIFIER_nondet_bool() [L93] ep31 = __VERIFIER_nondet_bool() [L94] ep32 = __VERIFIER_nondet_bool() [L95] id1 = __VERIFIER_nondet_char() [L96] r1 = __VERIFIER_nondet_char() [L97] st1 = __VERIFIER_nondet_char() [L98] nl1 = __VERIFIER_nondet_char() [L99] m1 = __VERIFIER_nondet_char() [L100] max1 = __VERIFIER_nondet_char() [L101] mode1 = __VERIFIER_nondet_bool() [L102] id2 = __VERIFIER_nondet_char() [L103] r2 = __VERIFIER_nondet_char() [L104] st2 = __VERIFIER_nondet_char() [L105] nl2 = __VERIFIER_nondet_char() [L106] m2 = __VERIFIER_nondet_char() [L107] max2 = __VERIFIER_nondet_char() [L108] mode2 = __VERIFIER_nondet_bool() [L109] id3 = __VERIFIER_nondet_char() [L110] r3 = __VERIFIER_nondet_char() [L111] st3 = __VERIFIER_nondet_char() [L112] nl3 = __VERIFIER_nondet_char() [L113] m3 = __VERIFIER_nondet_char() [L114] max3 = __VERIFIER_nondet_char() [L115] mode3 = __VERIFIER_nondet_bool() [L117] _Bool init__r121; [L118] _Bool init__r131; [L119] _Bool init__r211; [L120] _Bool init__r231; [L121] _Bool init__r311; [L122] _Bool init__r321; [L123] _Bool init__r122; [L124] int init__tmp; [L125] _Bool init__r132; [L126] int init__tmp___0; [L127] _Bool init__r212; [L128] int init__tmp___1; [L129] _Bool init__r232; [L130] int init__tmp___2; [L131] _Bool init__r312; [L132] int init__tmp___3; [L133] _Bool init__r322; [L134] int init__tmp___4; [L135] int init__tmp___5; [L136] init__r121 = ep12 [L137] init__r131 = ep13 [L138] init__r211 = ep21 [L139] init__r231 = ep23 [L140] init__r311 = ep31 [L141] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L142] COND FALSE !(!(init__r121 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L1631] COND TRUE !(init__r131 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L1633] COND TRUE !(ep32 == 0) [L1635] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L146] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] COND TRUE !(init__r131 == 0) [L149] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L151] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] COND TRUE !(init__r211 == 0) [L154] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L156] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] COND FALSE !(!(init__r231 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L1562] COND TRUE !(init__r211 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L1564] COND TRUE !(ep13 == 0) [L1566] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L161] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] COND FALSE !(!(init__r311 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L1539] COND TRUE !(init__r321 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L1541] COND TRUE !(ep21 == 0) [L1543] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L166] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] COND TRUE !(init__r321 == 0) [L169] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L171] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L174] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L176] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L178] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L180] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L182] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L184] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L186] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L188] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L190] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L192] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, 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=6, max2=4, max3=5, 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] [L194] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L196] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L198] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L200] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L202] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L204] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L206] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L208] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L210] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L212] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L214] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L216] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L218] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L220] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L222] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=6, max2=4, max3=5, 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] [L224] COND TRUE ((int)mode3) == 0 [L226] init__tmp___5 = 1 [L227] __return_1131 = init__tmp___5 [L228] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=6, max2=4, max3=5, 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] [L229] COND TRUE main__i2 != 0 [L231] p12_old = nomsg [L232] p12_new = nomsg [L233] p13_old = nomsg [L234] p13_new = nomsg [L235] p21_old = nomsg [L236] p21_new = nomsg [L237] p23_old = nomsg [L238] p23_new = nomsg [L239] p31_old = nomsg [L240] p31_new = nomsg [L241] p32_old = nomsg [L242] p32_new = nomsg [L243] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L244] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L247] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L253] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L255] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND TRUE !(ep13 == 0) [L268] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE p13_new == nomsg [L273] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=6, 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] [L275] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, 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=6, 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] [L277] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, 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] [L279] COND FALSE !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, 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] [L285] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, 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] [L287] COND TRUE !(ep21 == 0) [L289] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, 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] [L290] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, 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] [L292] COND TRUE p21_new == nomsg [L294] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, 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] [L296] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L298] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L309] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L311] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L317] COND TRUE ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L319] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L330] COND TRUE !(ep32 == 0) [L332] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L333] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, 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] [L335] COND TRUE p32_new == nomsg [L337] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=6, p13_old=-1, p21=0, p21_new=4, 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] [L339] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=5, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L341] mode3 = 1 [L342] p12_old = p12_new [L343] p12_new = nomsg [L344] p13_old = p13_new [L345] p13_new = nomsg [L346] p21_old = p21_new [L347] p21_new = nomsg [L348] p23_old = p23_new [L349] p23_new = nomsg [L350] p31_old = p31_new [L351] p31_new = nomsg [L352] p32_old = p32_new [L353] p32_new = nomsg [L355] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L356] 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L360] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L362] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L364] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L370] 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L372] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L374] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L380] 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L382] COND TRUE ((int)r1) < 2 [L384] check__tmp = 1 [L385] __return_1259 = check__tmp [L386] main__c1 = __return_1259 [L388] _Bool __tmp_1; [L389] __tmp_1 = main__c1 [L390] _Bool assert__arg; [L391] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND FALSE !(assert__arg == 0) [L398] int main____CPAchecker_TMP_0 = main__i2; [L399] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND TRUE !(mode1 == 0) [L405] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND TRUE !(ep21 == 0) [L408] m1 = p21_old [L409] p21_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L422] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE ((int)max1) == ((int)id1) [L426] st1 = 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L428] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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=5, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=4, max3=5, 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=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=5, 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=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, 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=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, 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=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, 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] [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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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) [L1079] check__tmp = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, check__tmp=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main____CPAchecker_TMP_0=0, main__i2=1, max1=6, max2=5, max3=6, 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] [L529] __return_1378 = check__tmp [L530] main__c1 = __return_1378 [L531] __tmp_1379_0 = main____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main__c1=0, main__i2=1, max1=6, max2=5, max3=6, 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] [L533] main____CPAchecker_TMP_0 = __tmp_1379_0 [L535] _Bool __tmp_2; [L536] __tmp_2 = main__c1 [L537] _Bool assert__arg; [L538] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main__i2=1, max1=6, max2=5, max3=6, 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] [L539] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main__i2=1, max1=6, max2=5, max3=6, 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] [L541] reach_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=6, id2=4, id3=5, init__r121=0, init__r311=0, m1=4, m2=5, m3=6, main__i2=1, max1=6, max2=5, max3=6, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 217 locations, 383 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5584 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5584 mSDsluCounter, 17625 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9454 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 8171 mSDtfsCounter, 419 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9164occurred in iteration=13, 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: 1.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 12709 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2042 NumberOfCodeBlocks, 2042 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1912 ConstructedInterpolants, 0 QuantifiedInterpolants, 6110 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:20:00,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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