./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-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_opt-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 a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:38:09,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:38:09,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:38:09,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:38:09,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:38:09,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:38:09,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:38:09,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:38:09,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:38:09,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:38:09,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:38:09,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:38:09,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:38:09,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:38:09,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:38:09,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:38:09,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:38:09,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:38:09,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:38:09,460 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 -> a89ee9f7aa9454ab38fa86354119089629ffb03b95267a7d67f4e51e7c7ae615 [2025-03-16 19:38:09,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:38:09,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:38:09,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:38:09,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:38:09,683 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:38:09,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:38:10,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a42539de/cfef4e63632348e8b6f014ec829f3019/FLAG778a2145d [2025-03-16 19:38:11,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:38:11,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:38:11,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a42539de/cfef4e63632348e8b6f014ec829f3019/FLAG778a2145d [2025-03-16 19:38:11,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a42539de/cfef4e63632348e8b6f014ec829f3019 [2025-03-16 19:38:11,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:38:11,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:38:11,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:38:11,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:38:11,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:38:11,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0069a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11, skipping insertion in model container [2025-03-16 19:38:11,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:38:11,638 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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2025-03-16 19:38:11,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:38:11,694 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:38:11,736 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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[10710,10723] [2025-03-16 19:38:11,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:38:11,770 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:38:11,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11 WrapperNode [2025-03-16 19:38:11,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:38:11,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:38:11,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:38:11,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:38:11,777 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:38:11" (1/1) ... [2025-03-16 19:38:11,786 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:38:11" (1/1) ... [2025-03-16 19:38:11,821 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1023 [2025-03-16 19:38:11,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:38:11,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:38:11,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:38:11,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:38:11,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,852 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:38:11,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:38:11,881 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:38:11,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:38:11,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:38:11,882 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (1/1) ... [2025-03-16 19:38:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:38:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:38:11,911 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:38:11,913 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:38:11,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:38:11,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:38:11,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:38:11,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:38:12,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:38:12,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:38:12,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1100: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:38:12,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L870: havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:38:12,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~check__tmp~2#1; [2025-03-16 19:38:12,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L985: havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:38:12,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node3__newmax~2#1; [2025-03-16 19:38:12,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node2__newmax~2#1; [2025-03-16 19:38:12,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L595: havoc main_~node1__newmax~2#1;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_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~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_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~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:38:12,775 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-16 19:38:12,775 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:38:12,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:38:12,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:38:12,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:38:12 BoogieIcfgContainer [2025-03-16 19:38:12,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:38:12,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:38:12,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:38:12,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:38:12,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:38:11" (1/3) ... [2025-03-16 19:38:12,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbfbe46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:38:12, skipping insertion in model container [2025-03-16 19:38:12,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:11" (2/3) ... [2025-03-16 19:38:12,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbfbe46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:38:12, skipping insertion in model container [2025-03-16 19:38:12,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:38:12" (3/3) ... [2025-03-16 19:38:12,798 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-16 19:38:12,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:38:12,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 240 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:38:12,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:38:12,861 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;@237336f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:38:12,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:38:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.76890756302521) internal successors, (421), 239 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:38:12,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:12,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] [2025-03-16 19:38:12,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:12,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash -179239959, now seen corresponding path program 1 times [2025-03-16 19:38:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533966887] [2025-03-16 19:38:12,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:12,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:38:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:38:13,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:13,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:13,649 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:38:13,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:13,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533966887] [2025-03-16 19:38:13,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533966887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:13,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:13,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:13,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643376447] [2025-03-16 19:38:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:13,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:13,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:13,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:13,672 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.76890756302521) internal successors, (421), 239 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 24.75) 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:38:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:13,785 INFO L93 Difference]: Finished difference Result 897 states and 1578 transitions. [2025-03-16 19:38:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) 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:38:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:13,795 INFO L225 Difference]: With dead ends: 897 [2025-03-16 19:38:13,795 INFO L226 Difference]: Without dead ends: 674 [2025-03-16 19:38:13,798 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:38:13,799 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 748 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1342 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:13,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1342 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-16 19:38:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 455. [2025-03-16 19:38:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.4779735682819384) internal successors, (671), 454 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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:38:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 671 transitions. [2025-03-16 19:38:13,844 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 671 transitions. Word has length 99 [2025-03-16 19:38:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:13,845 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 671 transitions. [2025-03-16 19:38:13,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) 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:38:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 671 transitions. [2025-03-16 19:38:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:38:13,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:13,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:38:13,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1031955818, now seen corresponding path program 1 times [2025-03-16 19:38:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141861919] [2025-03-16 19:38:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:13,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:38:13,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:38:13,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:13,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:13,958 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:38:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141861919] [2025-03-16 19:38:13,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141861919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:13,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788490160] [2025-03-16 19:38:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:13,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:13,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:13,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:13,963 INFO L87 Difference]: Start difference. First operand 455 states and 671 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:13,991 INFO L93 Difference]: Finished difference Result 885 states and 1299 transitions. [2025-03-16 19:38:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 19:38:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:13,993 INFO L225 Difference]: With dead ends: 885 [2025-03-16 19:38:13,994 INFO L226 Difference]: Without dead ends: 457 [2025-03-16 19:38:13,995 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:38:13,997 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 702 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:38:13,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-16 19:38:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-03-16 19:38:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.4758771929824561) internal successors, (673), 456 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:38:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 673 transitions. [2025-03-16 19:38:14,020 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 673 transitions. Word has length 100 [2025-03-16 19:38:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 673 transitions. [2025-03-16 19:38:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 673 transitions. [2025-03-16 19:38:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:38:14,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:14,025 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:38:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:38:14,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1424426172, now seen corresponding path program 1 times [2025-03-16 19:38:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:14,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356698881] [2025-03-16 19:38:14,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:14,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:14,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:38:14,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:38:14,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:14,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:14,112 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:38:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356698881] [2025-03-16 19:38:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356698881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:14,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:14,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788130213] [2025-03-16 19:38:14,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:14,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:14,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:14,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:14,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:14,115 INFO L87 Difference]: Start difference. First operand 457 states and 673 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) 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:38:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:14,149 INFO L93 Difference]: Finished difference Result 940 states and 1438 transitions. [2025-03-16 19:38:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:14,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) 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:38:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:14,153 INFO L225 Difference]: With dead ends: 940 [2025-03-16 19:38:14,153 INFO L226 Difference]: Without dead ends: 611 [2025-03-16 19:38:14,154 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:38:14,155 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 225 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:14,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 717 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-16 19:38:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 599. [2025-03-16 19:38:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.5167224080267558) internal successors, (907), 598 states have internal predecessors, (907), 0 states have call successors, (0), 0 states 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:38:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 907 transitions. [2025-03-16 19:38:14,172 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 907 transitions. Word has length 101 [2025-03-16 19:38:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:14,173 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 907 transitions. [2025-03-16 19:38:14,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) 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:38:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 907 transitions. [2025-03-16 19:38:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:38:14,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:14,178 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:38:14,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:38:14,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1176142305, now seen corresponding path program 1 times [2025-03-16 19:38:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062670254] [2025-03-16 19:38:14,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:14,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:38:14,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:38:14,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:14,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:14,519 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:38:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062670254] [2025-03-16 19:38:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062670254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:14,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:14,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488603286] [2025-03-16 19:38:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:14,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:14,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:14,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:14,521 INFO L87 Difference]: Start difference. First operand 599 states and 907 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:38:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:14,561 INFO L93 Difference]: Finished difference Result 1185 states and 1793 transitions. [2025-03-16 19:38:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:38:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:14,564 INFO L225 Difference]: With dead ends: 1185 [2025-03-16 19:38:14,564 INFO L226 Difference]: Without dead ends: 599 [2025-03-16 19:38:14,565 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:38:14,565 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 20 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1118 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:38:14,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1118 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-16 19:38:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2025-03-16 19:38:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.5125628140703518) internal successors, (903), 597 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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:38:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 903 transitions. [2025-03-16 19:38:14,578 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 903 transitions. Word has length 101 [2025-03-16 19:38:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:14,578 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 903 transitions. [2025-03-16 19:38:14,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:38:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 903 transitions. [2025-03-16 19:38:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:38:14,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:14,579 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:38:14,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:38:14,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:14,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1492180282, now seen corresponding path program 1 times [2025-03-16 19:38:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085009941] [2025-03-16 19:38:14,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:14,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:38:14,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:38:14,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:14,659 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:38:14,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:14,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085009941] [2025-03-16 19:38:14,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085009941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:14,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:14,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:14,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110581936] [2025-03-16 19:38:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:14,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:14,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:14,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:14,661 INFO L87 Difference]: Start difference. First operand 598 states and 903 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) 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:38:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:14,693 INFO L93 Difference]: Finished difference Result 1557 states and 2375 transitions. [2025-03-16 19:38:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:14,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) 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:38:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:14,698 INFO L225 Difference]: With dead ends: 1557 [2025-03-16 19:38:14,698 INFO L226 Difference]: Without dead ends: 1152 [2025-03-16 19:38:14,699 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:38:14,699 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 279 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 933 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:38:14,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 933 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-16 19:38:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1150. [2025-03-16 19:38:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4978241949521323) internal successors, (1721), 1149 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states 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:38:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1721 transitions. [2025-03-16 19:38:14,734 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1721 transitions. Word has length 101 [2025-03-16 19:38:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:14,735 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1721 transitions. [2025-03-16 19:38:14,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) 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:38:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1721 transitions. [2025-03-16 19:38:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:38:14,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:14,736 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:38:14,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:38:14,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:14,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash 896383748, now seen corresponding path program 1 times [2025-03-16 19:38:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29648398] [2025-03-16 19:38:14,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:14,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:38:14,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:38:14,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:14,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:15,017 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:38:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29648398] [2025-03-16 19:38:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29648398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:15,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:15,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834371138] [2025-03-16 19:38:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:15,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:15,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:15,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:15,018 INFO L87 Difference]: Start difference. First operand 1150 states and 1721 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:38:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:15,056 INFO L93 Difference]: Finished difference Result 1848 states and 2790 transitions. [2025-03-16 19:38:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:15,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:38:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:15,059 INFO L225 Difference]: With dead ends: 1848 [2025-03-16 19:38:15,059 INFO L226 Difference]: Without dead ends: 879 [2025-03-16 19:38:15,060 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:38:15,060 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 23 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1122 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:38:15,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1122 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-16 19:38:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2025-03-16 19:38:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.4908883826879271) internal successors, (1309), 878 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states 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:38:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1309 transitions. [2025-03-16 19:38:15,103 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1309 transitions. Word has length 101 [2025-03-16 19:38:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:15,104 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1309 transitions. [2025-03-16 19:38:15,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:38:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1309 transitions. [2025-03-16 19:38:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:38:15,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:15,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:38:15,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1840123758, now seen corresponding path program 1 times [2025-03-16 19:38:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:15,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699251952] [2025-03-16 19:38:15,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:15,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:38:15,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:38:15,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:15,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:15,167 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:38:15,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:15,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699251952] [2025-03-16 19:38:15,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699251952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:15,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:15,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:15,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443095295] [2025-03-16 19:38:15,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:15,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:15,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:15,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:15,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:15,169 INFO L87 Difference]: Start difference. First operand 879 states and 1309 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:38:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:15,203 INFO L93 Difference]: Finished difference Result 1894 states and 2935 transitions. [2025-03-16 19:38:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:15,204 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:38:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:15,208 INFO L225 Difference]: With dead ends: 1894 [2025-03-16 19:38:15,208 INFO L226 Difference]: Without dead ends: 1283 [2025-03-16 19:38:15,209 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:38:15,209 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 237 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:15,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 684 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-03-16 19:38:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1251. [2025-03-16 19:38:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 1.5288) internal successors, (1911), 1250 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states 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:38:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1911 transitions. [2025-03-16 19:38:15,232 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1911 transitions. Word has length 103 [2025-03-16 19:38:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:15,232 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1911 transitions. [2025-03-16 19:38:15,232 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:38:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1911 transitions. [2025-03-16 19:38:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:38:15,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:15,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:15,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:38:15,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:15,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1972011331, now seen corresponding path program 1 times [2025-03-16 19:38:15,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:15,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217225965] [2025-03-16 19:38:15,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:15,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:15,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:38:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:38:15,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:15,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:15,450 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:38:15,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217225965] [2025-03-16 19:38:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217225965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:15,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297644627] [2025-03-16 19:38:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:15,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:15,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:15,451 INFO L87 Difference]: Start difference. First operand 1251 states and 1911 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:15,513 INFO L93 Difference]: Finished difference Result 3169 states and 4854 transitions. [2025-03-16 19:38:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-16 19:38:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:15,519 INFO L225 Difference]: With dead ends: 3169 [2025-03-16 19:38:15,519 INFO L226 Difference]: Without dead ends: 1944 [2025-03-16 19:38:15,520 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:38:15,521 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 284 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1440 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:38:15,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1440 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-03-16 19:38:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1942. [2025-03-16 19:38:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1941 states have (on average 1.5229263266357547) internal successors, (2956), 1941 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states 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:38:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2956 transitions. [2025-03-16 19:38:15,557 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2956 transitions. Word has length 104 [2025-03-16 19:38:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:15,557 INFO L471 AbstractCegarLoop]: Abstraction has 1942 states and 2956 transitions. [2025-03-16 19:38:15,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2956 transitions. [2025-03-16 19:38:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:38:15,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:15,558 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:38:15,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:38:15,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:15,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1774136384, now seen corresponding path program 1 times [2025-03-16 19:38:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610456740] [2025-03-16 19:38:15,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:15,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:38:15,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:38:15,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:15,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:15,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:15,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610456740] [2025-03-16 19:38:15,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610456740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:15,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:15,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:15,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751072892] [2025-03-16 19:38:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:15,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:15,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:15,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:15,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:15,619 INFO L87 Difference]: Start difference. First operand 1942 states and 2956 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:38:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:15,667 INFO L93 Difference]: Finished difference Result 4536 states and 6999 transitions. [2025-03-16 19:38:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:15,668 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:38:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:15,675 INFO L225 Difference]: With dead ends: 4536 [2025-03-16 19:38:15,675 INFO L226 Difference]: Without dead ends: 2948 [2025-03-16 19:38:15,677 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:38:15,677 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 276 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 751 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:38:15,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 751 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2025-03-16 19:38:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2946. [2025-03-16 19:38:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2945 states have (on average 1.5134125636672326) internal successors, (4457), 2945 states have internal predecessors, (4457), 0 states have call successors, (0), 0 states 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:38:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4457 transitions. [2025-03-16 19:38:15,740 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4457 transitions. Word has length 106 [2025-03-16 19:38:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:15,740 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4457 transitions. [2025-03-16 19:38:15,740 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:38:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4457 transitions. [2025-03-16 19:38:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:38:15,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:15,742 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:38:15,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:38:15,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2094664586, now seen corresponding path program 1 times [2025-03-16 19:38:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030708718] [2025-03-16 19:38:15,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:15,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:38:15,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:38:15,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:15,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:15,805 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:38:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030708718] [2025-03-16 19:38:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030708718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:15,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236561888] [2025-03-16 19:38:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:15,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:15,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:15,806 INFO L87 Difference]: Start difference. First operand 2946 states and 4457 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:38:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:15,859 INFO L93 Difference]: Finished difference Result 7384 states and 11466 transitions. [2025-03-16 19:38:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:15,859 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:38:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:15,872 INFO L225 Difference]: With dead ends: 7384 [2025-03-16 19:38:15,873 INFO L226 Difference]: Without dead ends: 4774 [2025-03-16 19:38:15,876 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:38:15,876 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 225 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:15,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 692 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4774 states. [2025-03-16 19:38:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4774 to 4632. [2025-03-16 19:38:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.545238609371626) internal successors, (7156), 4631 states have internal predecessors, (7156), 0 states have call successors, (0), 0 states 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:38:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 7156 transitions. [2025-03-16 19:38:15,958 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 7156 transitions. Word has length 108 [2025-03-16 19:38:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:15,959 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 7156 transitions. [2025-03-16 19:38:15,959 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:38:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 7156 transitions. [2025-03-16 19:38:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:38:15,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:15,961 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:38:15,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:38:15,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:15,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1649510705, now seen corresponding path program 1 times [2025-03-16 19:38:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571608114] [2025-03-16 19:38:15,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:15,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:38:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:38:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:16,153 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:38:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:16,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571608114] [2025-03-16 19:38:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571608114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:16,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433527651] [2025-03-16 19:38:16,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:16,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:16,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:16,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:16,155 INFO L87 Difference]: Start difference. First operand 4632 states and 7156 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:38:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:16,295 INFO L93 Difference]: Finished difference Result 21141 states and 32607 transitions. [2025-03-16 19:38:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:16,296 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:38:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:16,338 INFO L225 Difference]: With dead ends: 21141 [2025-03-16 19:38:16,338 INFO L226 Difference]: Without dead ends: 16547 [2025-03-16 19:38:16,349 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:38:16,350 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 927 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:16,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1459 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16547 states. [2025-03-16 19:38:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16547 to 8318. [2025-03-16 19:38:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8318 states, 8317 states have (on average 1.526992906095948) internal successors, (12700), 8317 states have internal predecessors, (12700), 0 states have call successors, (0), 0 states 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:38:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8318 states to 8318 states and 12700 transitions. [2025-03-16 19:38:16,600 INFO L78 Accepts]: Start accepts. Automaton has 8318 states and 12700 transitions. Word has length 109 [2025-03-16 19:38:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:16,600 INFO L471 AbstractCegarLoop]: Abstraction has 8318 states and 12700 transitions. [2025-03-16 19:38:16,600 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:38:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 8318 states and 12700 transitions. [2025-03-16 19:38:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:38:16,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:16,603 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] [2025-03-16 19:38:16,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:38:16,603 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:16,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1549485036, now seen corresponding path program 1 times [2025-03-16 19:38:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923841422] [2025-03-16 19:38:16,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:16,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:38:16,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:38:16,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:16,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:16,651 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:38:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923841422] [2025-03-16 19:38:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923841422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:16,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:16,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361596890] [2025-03-16 19:38:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:16,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:16,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:16,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:16,653 INFO L87 Difference]: Start difference. First operand 8318 states and 12700 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:16,719 INFO L93 Difference]: Finished difference Result 16537 states and 25271 transitions. [2025-03-16 19:38:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:38:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:16,736 INFO L225 Difference]: With dead ends: 16537 [2025-03-16 19:38:16,736 INFO L226 Difference]: Without dead ends: 8324 [2025-03-16 19:38:16,745 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:38:16,745 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 0 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:16,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2025-03-16 19:38:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 8324. [2025-03-16 19:38:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8324 states, 8323 states have (on average 1.526613000120149) internal successors, (12706), 8323 states have internal predecessors, (12706), 0 states have call successors, (0), 0 states 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:38:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8324 states to 8324 states and 12706 transitions. [2025-03-16 19:38:16,941 INFO L78 Accepts]: Start accepts. Automaton has 8324 states and 12706 transitions. Word has length 110 [2025-03-16 19:38:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:16,941 INFO L471 AbstractCegarLoop]: Abstraction has 8324 states and 12706 transitions. [2025-03-16 19:38:16,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 8324 states and 12706 transitions. [2025-03-16 19:38:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:38:16,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:16,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:38:16,944 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1543167801, now seen corresponding path program 1 times [2025-03-16 19:38:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293972639] [2025-03-16 19:38:16,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:16,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:38:16,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:38:16,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:16,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:17,260 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:38:17,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:17,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293972639] [2025-03-16 19:38:17,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293972639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:17,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:17,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:17,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573812714] [2025-03-16 19:38:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:17,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:17,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:17,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:17,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:17,262 INFO L87 Difference]: Start difference. First operand 8324 states and 12706 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:38:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:17,321 INFO L93 Difference]: Finished difference Result 16541 states and 25274 transitions. [2025-03-16 19:38:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:38:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:17,336 INFO L225 Difference]: With dead ends: 16541 [2025-03-16 19:38:17,337 INFO L226 Difference]: Without dead ends: 8324 [2025-03-16 19:38:17,347 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:38:17,348 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 10 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1070 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:38:17,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1070 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2025-03-16 19:38:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 8321. [2025-03-16 19:38:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8321 states, 8320 states have (on average 1.5263221153846154) internal successors, (12699), 8320 states have internal predecessors, (12699), 0 states have call successors, (0), 0 states 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:38:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8321 states to 8321 states and 12699 transitions. [2025-03-16 19:38:17,526 INFO L78 Accepts]: Start accepts. Automaton has 8321 states and 12699 transitions. Word has length 111 [2025-03-16 19:38:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:17,526 INFO L471 AbstractCegarLoop]: Abstraction has 8321 states and 12699 transitions. [2025-03-16 19:38:17,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:38:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8321 states and 12699 transitions. [2025-03-16 19:38:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:38:17,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:17,530 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:38:17,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:38:17,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:17,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1259027988, now seen corresponding path program 1 times [2025-03-16 19:38:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174936380] [2025-03-16 19:38:17,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:17,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:38:17,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:38:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:17,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:17,610 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:38:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174936380] [2025-03-16 19:38:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174936380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:17,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780319975] [2025-03-16 19:38:17,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:17,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:17,612 INFO L87 Difference]: Start difference. First operand 8321 states and 12699 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:38:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:17,696 INFO L93 Difference]: Finished difference Result 22586 states and 34591 transitions. [2025-03-16 19:38:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:38:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:17,723 INFO L225 Difference]: With dead ends: 22586 [2025-03-16 19:38:17,723 INFO L226 Difference]: Without dead ends: 15016 [2025-03-16 19:38:17,736 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:38:17,736 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 258 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 934 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:38:17,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 934 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15016 states. [2025-03-16 19:38:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15016 to 15014. [2025-03-16 19:38:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15014 states, 15013 states have (on average 1.5054286285219476) internal successors, (22601), 15013 states have internal predecessors, (22601), 0 states have call successors, (0), 0 states 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:38:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 22601 transitions. [2025-03-16 19:38:18,041 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 22601 transitions. Word has length 111 [2025-03-16 19:38:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:18,042 INFO L471 AbstractCegarLoop]: Abstraction has 15014 states and 22601 transitions. [2025-03-16 19:38:18,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:38:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 22601 transitions. [2025-03-16 19:38:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:38:18,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:18,046 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:38:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:38:18,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:18,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash 130266026, now seen corresponding path program 1 times [2025-03-16 19:38:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919206615] [2025-03-16 19:38:18,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:18,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:38:18,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:38:18,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:18,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:18,258 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:38:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919206615] [2025-03-16 19:38:18,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919206615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:18,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:18,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261258937] [2025-03-16 19:38:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:18,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:18,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:18,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:18,260 INFO L87 Difference]: Start difference. First operand 15014 states and 22601 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:38:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:18,360 INFO L93 Difference]: Finished difference Result 26373 states and 39887 transitions. [2025-03-16 19:38:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:18,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:38:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:18,379 INFO L225 Difference]: With dead ends: 26373 [2025-03-16 19:38:18,379 INFO L226 Difference]: Without dead ends: 12034 [2025-03-16 19:38:18,393 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:38:18,393 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 13 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1074 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:38:18,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1074 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12034 states. [2025-03-16 19:38:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12034 to 12034. [2025-03-16 19:38:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12034 states, 12033 states have (on average 1.502202277071387) internal successors, (18076), 12033 states have internal predecessors, (18076), 0 states have call successors, (0), 0 states 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:38:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12034 states to 12034 states and 18076 transitions. [2025-03-16 19:38:18,554 INFO L78 Accepts]: Start accepts. Automaton has 12034 states and 18076 transitions. Word has length 111 [2025-03-16 19:38:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:18,554 INFO L471 AbstractCegarLoop]: Abstraction has 12034 states and 18076 transitions. [2025-03-16 19:38:18,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:38:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12034 states and 18076 transitions. [2025-03-16 19:38:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:38:18,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:18,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:18,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:38:18,558 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:18,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash -826943911, now seen corresponding path program 1 times [2025-03-16 19:38:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357008355] [2025-03-16 19:38:18,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:18,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:18,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:38:18,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:38:18,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:18,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357008355] [2025-03-16 19:38:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357008355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:18,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:18,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:18,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298661405] [2025-03-16 19:38:18,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:38:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:18,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:38:18,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:38:18,858 INFO L87 Difference]: Start difference. First operand 12034 states and 18076 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:38:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:19,036 INFO L93 Difference]: Finished difference Result 32826 states and 50362 transitions. [2025-03-16 19:38:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-16 19:38:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:19,074 INFO L225 Difference]: With dead ends: 32826 [2025-03-16 19:38:19,074 INFO L226 Difference]: Without dead ends: 22478 [2025-03-16 19:38:19,091 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:38:19,093 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1480 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 809 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:38:19,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 809 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22478 states. [2025-03-16 19:38:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22478 to 22476. [2025-03-16 19:38:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22476 states, 22475 states have (on average 1.5207119021134594) internal successors, (34178), 22475 states have internal predecessors, (34178), 0 states have call successors, (0), 0 states 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:38:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22476 states to 22476 states and 34178 transitions. [2025-03-16 19:38:19,369 INFO L78 Accepts]: Start accepts. Automaton has 22476 states and 34178 transitions. Word has length 114 [2025-03-16 19:38:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:19,369 INFO L471 AbstractCegarLoop]: Abstraction has 22476 states and 34178 transitions. [2025-03-16 19:38:19,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:38:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22476 states and 34178 transitions. [2025-03-16 19:38:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:38:19,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:19,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:19,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:38:19,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:19,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash -960957417, now seen corresponding path program 1 times [2025-03-16 19:38:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687852191] [2025-03-16 19:38:19,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:19,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:38:19,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:38:19,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:19,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:19,626 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:38:19,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:19,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687852191] [2025-03-16 19:38:19,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687852191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:19,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:19,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:19,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814697188] [2025-03-16 19:38:19,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:19,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:19,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:19,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:19,627 INFO L87 Difference]: Start difference. First operand 22476 states and 34178 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:38:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:19,880 INFO L93 Difference]: Finished difference Result 61632 states and 95596 transitions. [2025-03-16 19:38:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-16 19:38:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:19,963 INFO L225 Difference]: With dead ends: 61632 [2025-03-16 19:38:19,964 INFO L226 Difference]: Without dead ends: 42054 [2025-03-16 19:38:19,989 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:38:19,990 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 598 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:19,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 890 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42054 states. [2025-03-16 19:38:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42054 to 42052. [2025-03-16 19:38:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42052 states, 42051 states have (on average 1.5184894532829183) internal successors, (63854), 42051 states have internal predecessors, (63854), 0 states have call successors, (0), 0 states 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:38:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42052 states to 42052 states and 63854 transitions. [2025-03-16 19:38:20,691 INFO L78 Accepts]: Start accepts. Automaton has 42052 states and 63854 transitions. Word has length 114 [2025-03-16 19:38:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:20,691 INFO L471 AbstractCegarLoop]: Abstraction has 42052 states and 63854 transitions. [2025-03-16 19:38:20,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:38:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 42052 states and 63854 transitions. [2025-03-16 19:38:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:38:20,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:20,697 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, 1, 1, 1] [2025-03-16 19:38:20,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:38:20,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:20,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1336417001, now seen corresponding path program 1 times [2025-03-16 19:38:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:20,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144646638] [2025-03-16 19:38:20,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:20,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:38:20,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:38:20,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:20,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:21,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:38:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144646638] [2025-03-16 19:38:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144646638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533064400] [2025-03-16 19:38:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:21,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:21,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:21,012 INFO L87 Difference]: Start difference. First operand 42052 states and 63854 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:38:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:21,187 INFO L93 Difference]: Finished difference Result 69756 states and 105967 transitions. [2025-03-16 19:38:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:21,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-16 19:38:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:21,257 INFO L225 Difference]: With dead ends: 69756 [2025-03-16 19:38:21,257 INFO L226 Difference]: Without dead ends: 39056 [2025-03-16 19:38:21,282 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:38:21,283 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 272 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:21,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 969 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39056 states. [2025-03-16 19:38:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 39014. [2025-03-16 19:38:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39014 states, 39013 states have (on average 1.5168789890549303) internal successors, (59178), 39013 states have internal predecessors, (59178), 0 states have call successors, (0), 0 states 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:38:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39014 states to 39014 states and 59178 transitions. [2025-03-16 19:38:21,730 INFO L78 Accepts]: Start accepts. Automaton has 39014 states and 59178 transitions. Word has length 114 [2025-03-16 19:38:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:21,730 INFO L471 AbstractCegarLoop]: Abstraction has 39014 states and 59178 transitions. [2025-03-16 19:38:21,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:38:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 39014 states and 59178 transitions. [2025-03-16 19:38:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 19:38:21,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:21,734 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, 1, 1, 1, 1, 1] [2025-03-16 19:38:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:38:21,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:21,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash -349307951, now seen corresponding path program 1 times [2025-03-16 19:38:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604694826] [2025-03-16 19:38:21,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:21,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 19:38:21,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 19:38:21,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:21,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:21,790 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:38:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:21,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604694826] [2025-03-16 19:38:21,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604694826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:21,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:21,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665686938] [2025-03-16 19:38:21,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:21,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:21,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:21,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:21,792 INFO L87 Difference]: Start difference. First operand 39014 states and 59178 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:38:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:22,165 INFO L93 Difference]: Finished difference Result 113823 states and 173381 transitions. [2025-03-16 19:38:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:22,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-16 19:38:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:22,310 INFO L225 Difference]: With dead ends: 113823 [2025-03-16 19:38:22,310 INFO L226 Difference]: Without dead ends: 76671 [2025-03-16 19:38:22,351 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:38:22,352 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 230 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:22,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 730 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76671 states. [2025-03-16 19:38:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76671 to 76669. [2025-03-16 19:38:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76669 states, 76668 states have (on average 1.5121171805707727) internal successors, (115931), 76668 states have internal predecessors, (115931), 0 states have call successors, (0), 0 states 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:38:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76669 states to 76669 states and 115931 transitions. [2025-03-16 19:38:23,290 INFO L78 Accepts]: Start accepts. Automaton has 76669 states and 115931 transitions. Word has length 116 [2025-03-16 19:38:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:23,290 INFO L471 AbstractCegarLoop]: Abstraction has 76669 states and 115931 transitions. [2025-03-16 19:38:23,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:38:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 76669 states and 115931 transitions. [2025-03-16 19:38:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 19:38:23,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:23,297 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, 1, 1, 1, 1, 1] [2025-03-16 19:38:23,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:38:23,297 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:23,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:23,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1001418286, now seen corresponding path program 1 times [2025-03-16 19:38:23,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:23,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533127555] [2025-03-16 19:38:23,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:23,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 19:38:23,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 19:38:23,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:23,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:23,484 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:38:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533127555] [2025-03-16 19:38:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533127555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:23,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178078361] [2025-03-16 19:38:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:23,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:23,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:23,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:23,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:23,486 INFO L87 Difference]: Start difference. First operand 76669 states and 115931 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:38:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:24,556 INFO L93 Difference]: Finished difference Result 230092 states and 347895 transitions. [2025-03-16 19:38:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:24,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-16 19:38:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:24,792 INFO L225 Difference]: With dead ends: 230092 [2025-03-16 19:38:24,792 INFO L226 Difference]: Without dead ends: 153579 [2025-03-16 19:38:24,837 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:38:24,840 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 905 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:24,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1378 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153579 states. [2025-03-16 19:38:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153579 to 76793. [2025-03-16 19:38:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76793 states, 76792 states have (on average 1.5114074382748204) internal successors, (116064), 76792 states have internal predecessors, (116064), 0 states have call successors, (0), 0 states 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:38:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76793 states to 76793 states and 116064 transitions. [2025-03-16 19:38:26,261 INFO L78 Accepts]: Start accepts. Automaton has 76793 states and 116064 transitions. Word has length 116 [2025-03-16 19:38:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:26,262 INFO L471 AbstractCegarLoop]: Abstraction has 76793 states and 116064 transitions. [2025-03-16 19:38:26,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:38:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 76793 states and 116064 transitions. [2025-03-16 19:38:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:38:26,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:26,268 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, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:26,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:38:26,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:26,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash 872228863, now seen corresponding path program 1 times [2025-03-16 19:38:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838797663] [2025-03-16 19:38:26,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:26,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:38:26,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:38:26,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:26,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:26,324 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:38:26,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838797663] [2025-03-16 19:38:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838797663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:26,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:26,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399272166] [2025-03-16 19:38:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:26,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:26,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:26,326 INFO L87 Difference]: Start difference. First operand 76793 states and 116064 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:38:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:26,674 INFO L93 Difference]: Finished difference Result 133772 states and 202210 transitions. [2025-03-16 19:38:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-16 19:38:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:27,139 INFO L225 Difference]: With dead ends: 133772 [2025-03-16 19:38:27,139 INFO L226 Difference]: Without dead ends: 76803 [2025-03-16 19:38:27,159 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:38:27,160 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 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:38:27,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76803 states. [2025-03-16 19:38:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76803 to 76803. [2025-03-16 19:38:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76803 states, 76802 states have (on average 1.511340850498685) internal successors, (116074), 76802 states have internal predecessors, (116074), 0 states have call successors, (0), 0 states 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:38:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76803 states to 76803 states and 116074 transitions. [2025-03-16 19:38:28,119 INFO L78 Accepts]: Start accepts. Automaton has 76803 states and 116074 transitions. Word has length 117 [2025-03-16 19:38:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:28,119 INFO L471 AbstractCegarLoop]: Abstraction has 76803 states and 116074 transitions. [2025-03-16 19:38:28,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:38:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 76803 states and 116074 transitions. [2025-03-16 19:38:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:38:28,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:28,125 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:28,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:38:28,125 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:28,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -815964530, now seen corresponding path program 1 times [2025-03-16 19:38:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045771339] [2025-03-16 19:38:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:28,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:38:28,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:38:28,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:28,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045771339] [2025-03-16 19:38:28,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045771339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:28,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:28,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:28,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365644663] [2025-03-16 19:38:28,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:28,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:28,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:28,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:28,216 INFO L87 Difference]: Start difference. First operand 76803 states and 116074 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:38:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:28,606 INFO L93 Difference]: Finished difference Result 133658 states and 203141 transitions. [2025-03-16 19:38:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 19:38:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:28,687 INFO L225 Difference]: With dead ends: 133658 [2025-03-16 19:38:28,688 INFO L226 Difference]: Without dead ends: 58822 [2025-03-16 19:38:28,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:28,739 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 847 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:28,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 347 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58822 states. [2025-03-16 19:38:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58822 to 39127. [2025-03-16 19:38:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39127 states, 39126 states have (on average 1.5032203649746971) internal successors, (58815), 39126 states have internal predecessors, (58815), 0 states have call successors, (0), 0 states 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:38:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39127 states to 39127 states and 58815 transitions. [2025-03-16 19:38:29,580 INFO L78 Accepts]: Start accepts. Automaton has 39127 states and 58815 transitions. Word has length 118 [2025-03-16 19:38:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:29,580 INFO L471 AbstractCegarLoop]: Abstraction has 39127 states and 58815 transitions. [2025-03-16 19:38:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:38:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 39127 states and 58815 transitions. [2025-03-16 19:38:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:38:29,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:29,687 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:29,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:38:29,691 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:29,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1909591055, now seen corresponding path program 1 times [2025-03-16 19:38:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914529021] [2025-03-16 19:38:29,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:29,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:38:29,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:38:29,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:29,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:29,853 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:38:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914529021] [2025-03-16 19:38:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914529021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:29,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:29,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:29,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427913827] [2025-03-16 19:38:29,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:29,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:29,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:29,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:29,854 INFO L87 Difference]: Start difference. First operand 39127 states and 58815 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:38:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:29,986 INFO L93 Difference]: Finished difference Result 67743 states and 101988 transitions. [2025-03-16 19:38:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 19:38:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:30,032 INFO L225 Difference]: With dead ends: 67743 [2025-03-16 19:38:30,033 INFO L226 Difference]: Without dead ends: 39661 [2025-03-16 19:38:30,058 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:38:30,058 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 512 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:30,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39661 states. [2025-03-16 19:38:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39661 to 39396. [2025-03-16 19:38:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39396 states, 39395 states have (on average 1.5003680670135804) internal successors, (59107), 39395 states have internal predecessors, (59107), 0 states have call successors, (0), 0 states 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:38:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39396 states to 39396 states and 59107 transitions. [2025-03-16 19:38:30,504 INFO L78 Accepts]: Start accepts. Automaton has 39396 states and 59107 transitions. Word has length 118 [2025-03-16 19:38:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:30,505 INFO L471 AbstractCegarLoop]: Abstraction has 39396 states and 59107 transitions. [2025-03-16 19:38:30,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:38:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 39396 states and 59107 transitions. [2025-03-16 19:38:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:38:30,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:30,508 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:30,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:38:30,508 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1595532262, now seen corresponding path program 1 times [2025-03-16 19:38:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029985835] [2025-03-16 19:38:30,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:30,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:38:30,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:38:30,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:30,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:30,661 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:38:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:30,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029985835] [2025-03-16 19:38:30,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029985835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:30,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715984372] [2025-03-16 19:38:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:30,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:30,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:30,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:30,663 INFO L87 Difference]: Start difference. First operand 39396 states and 59107 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:38:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:30,905 INFO L93 Difference]: Finished difference Result 65450 states and 98195 transitions. [2025-03-16 19:38:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 19:38:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:30,938 INFO L225 Difference]: With dead ends: 65450 [2025-03-16 19:38:30,938 INFO L226 Difference]: Without dead ends: 36177 [2025-03-16 19:38:30,949 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:38:30,950 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 3 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:30,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1030 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36177 states. [2025-03-16 19:38:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36177 to 36177. [2025-03-16 19:38:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36177 states, 36176 states have (on average 1.5003869969040247) internal successors, (54278), 36176 states have internal predecessors, (54278), 0 states have call successors, (0), 0 states 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:38:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36177 states to 36177 states and 54278 transitions. [2025-03-16 19:38:31,283 INFO L78 Accepts]: Start accepts. Automaton has 36177 states and 54278 transitions. Word has length 118 [2025-03-16 19:38:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:31,283 INFO L471 AbstractCegarLoop]: Abstraction has 36177 states and 54278 transitions. [2025-03-16 19:38:31,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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:38:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 36177 states and 54278 transitions. [2025-03-16 19:38:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 19:38:31,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:31,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:31,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:38:31,286 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:31,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:31,287 INFO L85 PathProgramCache]: Analyzing trace with hash 440522450, now seen corresponding path program 1 times [2025-03-16 19:38:31,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:31,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107386144] [2025-03-16 19:38:31,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:31,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:31,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:38:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:38:31,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:31,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:38:31,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 19:38:31,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:38:31,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:38:31,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:31,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:38:31,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 19:38:31,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 19:38:31,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 19:38:31,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:38:31,528 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, 1, 1, 1, 1, 1] [2025-03-16 19:38:31,674 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 19:38:31,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 07:38:31 BoogieIcfgContainer [2025-03-16 19:38:31,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 19:38:31,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 19:38:31,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 19:38:31,677 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 19:38:31,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:38:12" (3/4) ... [2025-03-16 19:38:31,678 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 19:38:31,833 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 101. [2025-03-16 19:38:31,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 19:38:31,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 19:38:31,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 19:38:31,908 INFO L158 Benchmark]: Toolchain (without parser) took 20506.72ms. Allocated memory was 167.8MB in the beginning and 10.2GB in the end (delta: 10.0GB). Free memory was 121.6MB in the beginning and 8.9GB in the end (delta: -8.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-16 19:38:31,908 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:38:31,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.34ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 98.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 19:38:31,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.31ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.1MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:38:31,910 INFO L158 Benchmark]: Boogie Preprocessor took 58.68ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 89.3MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 19:38:31,910 INFO L158 Benchmark]: IcfgBuilder took 910.11ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 95.5MB in the end (delta: -6.2MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2025-03-16 19:38:31,911 INFO L158 Benchmark]: TraceAbstraction took 18883.85ms. Allocated memory was 167.8MB in the beginning and 10.2GB in the end (delta: 10.0GB). Free memory was 94.6MB in the beginning and 8.9GB in the end (delta: -8.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-16 19:38:31,911 INFO L158 Benchmark]: Witness Printer took 230.54ms. Allocated memory is still 10.2GB. Free memory was 8.9GB in the beginning and 8.9GB in the end (delta: 46.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 19:38:31,912 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.34ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 98.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.31ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.1MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.68ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 89.3MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 910.11ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 95.5MB in the end (delta: -6.2MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18883.85ms. Allocated memory was 167.8MB in the beginning and 10.2GB in the end (delta: 10.0GB). Free memory was 94.6MB in the beginning and 8.9GB in the end (delta: -8.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 230.54ms. Allocated memory is still 10.2GB. Free memory was 8.9GB in the beginning and 8.9GB in the end (delta: 46.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 586]: 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] _Bool newmax1 = 0; [L58] char id2 = '\x0'; [L59] char r2 = '\x0'; [L60] char st2 = '\x0'; [L61] char nl2 = '\x0'; [L62] char m2 = '\x0'; [L63] char max2 = '\x0'; [L64] _Bool mode2 = 0; [L65] _Bool newmax2 = 0; [L66] char id3 = '\x0'; [L67] char r3 = '\x0'; [L68] char st3 = '\x0'; [L69] char nl3 = '\x0'; [L70] char m3 = '\x0'; [L71] char max3 = '\x0'; [L72] _Bool mode3 = 0; [L73] _Bool newmax3 = 0; [L77] void (*nodes[3])() = { &node1, &node2, &node3 }; [L81] int __return_1237; [L82] int __return_1383; [L83] int __return_1517; [L84] int __tmp_1518_0; [L85] int __return_1641; [L86] int __return_1531; [L89] int main__c1; [L90] int main__i2; [L91] main__c1 = 0 [L92] ep12 = __VERIFIER_nondet_bool() [L93] ep13 = __VERIFIER_nondet_bool() [L94] ep21 = __VERIFIER_nondet_bool() [L95] ep23 = __VERIFIER_nondet_bool() [L96] ep31 = __VERIFIER_nondet_bool() [L97] ep32 = __VERIFIER_nondet_bool() [L98] id1 = __VERIFIER_nondet_char() [L99] r1 = __VERIFIER_nondet_char() [L100] st1 = __VERIFIER_nondet_char() [L101] nl1 = __VERIFIER_nondet_char() [L102] m1 = __VERIFIER_nondet_char() [L103] max1 = __VERIFIER_nondet_char() [L104] mode1 = __VERIFIER_nondet_bool() [L105] newmax1 = __VERIFIER_nondet_bool() [L106] id2 = __VERIFIER_nondet_char() [L107] r2 = __VERIFIER_nondet_char() [L108] st2 = __VERIFIER_nondet_char() [L109] nl2 = __VERIFIER_nondet_char() [L110] m2 = __VERIFIER_nondet_char() [L111] max2 = __VERIFIER_nondet_char() [L112] mode2 = __VERIFIER_nondet_bool() [L113] newmax2 = __VERIFIER_nondet_bool() [L114] id3 = __VERIFIER_nondet_char() [L115] r3 = __VERIFIER_nondet_char() [L116] st3 = __VERIFIER_nondet_char() [L117] nl3 = __VERIFIER_nondet_char() [L118] m3 = __VERIFIER_nondet_char() [L119] max3 = __VERIFIER_nondet_char() [L120] mode3 = __VERIFIER_nondet_bool() [L121] newmax3 = __VERIFIER_nondet_bool() [L123] _Bool init__r121; [L124] _Bool init__r131; [L125] _Bool init__r211; [L126] _Bool init__r231; [L127] _Bool init__r311; [L128] _Bool init__r321; [L129] _Bool init__r122; [L130] int init__tmp; [L131] _Bool init__r132; [L132] int init__tmp___0; [L133] _Bool init__r212; [L134] int init__tmp___1; [L135] _Bool init__r232; [L136] int init__tmp___2; [L137] _Bool init__r312; [L138] int init__tmp___3; [L139] _Bool init__r322; [L140] int init__tmp___4; [L141] int init__tmp___5; [L142] init__r121 = ep12 [L143] init__r131 = ep13 [L144] init__r211 = ep21 [L145] init__r231 = ep23 [L146] init__r311 = ep31 [L147] init__r321 = ep32 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND TRUE !(init__r121 == 0) [L150] init__tmp = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r122 = (_Bool)init__tmp VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND FALSE !(!(init__r131 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r121=1, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1755] COND TRUE !(init__r121 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1757] COND TRUE !(ep23 == 0) [L1759] init__tmp___0 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp___0=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r132 = (_Bool)init__tmp___0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(init__r211 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1732] COND TRUE !(init__r231 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1734] COND TRUE !(ep31 == 0) [L1736] init__tmp___1 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp___1=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r212 = (_Bool)init__tmp___1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND TRUE !(init__r231 == 0) [L165] init__tmp___2 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r311=1, init__r321=0, init__tmp___2=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] init__r232 = (_Bool)init__tmp___2 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE !(init__r311 == 0) [L170] init__tmp___3 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r321=0, init__tmp___3=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] init__r312 = (_Bool)init__tmp___3 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(init__r321 == 0)) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r311=1, init__r312=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1663] COND TRUE !(init__r311 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L1665] COND TRUE !(ep12 == 0) [L1667] init__tmp___4 = 1 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] init__r322 = (_Bool)init__tmp___4 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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) != ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id1) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id2) != ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id1) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id2) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)id3) >= 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 ((int)r1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 ((int)r2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 ((int)r3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r122=1, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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__r122 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r132=1, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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__r132 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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__r212 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 !(init__r232 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 !(init__r312 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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 !(init__r322 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)max1) == ((int)id1) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)max2) == ((int)id2) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)max3) == ((int)id3) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)st1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)st2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)st3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)nl1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)nl2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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)nl3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L226] COND TRUE ((int)mode1) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L228] COND TRUE ((int)mode2) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE ((int)mode3) == 0 VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L232] COND TRUE !(newmax1 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L234] COND TRUE !(newmax2 == 0) VAL [__return_1237=0, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L236] COND TRUE !(newmax3 == 0) [L238] init__tmp___5 = 1 [L239] __return_1237 = init__tmp___5 [L240] main__i2 = __return_1237 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=1, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, 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] [L241] COND TRUE main__i2 != 0 [L243] p12_old = nomsg [L244] p12_new = nomsg [L245] p13_old = nomsg [L246] p13_new = nomsg [L247] p21_old = nomsg [L248] p21_new = nomsg [L249] p23_old = nomsg [L250] p23_new = nomsg [L251] p31_old = nomsg [L252] p31_new = nomsg [L253] p32_old = nomsg [L254] p32_new = nomsg [L255] main__i2 = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND TRUE main__i2 < 6 [L259] _Bool node1__newmax; [L260] node1__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L261] COND FALSE !(!(mode1 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L269] COND TRUE !(ep12 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE !(newmax1 == 0) [L273] int node1____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L274] COND TRUE max1 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L276] COND TRUE p12_new == nomsg [L278] node1____CPAchecker_TMP_0 = max1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=127, 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] [L280] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L282] COND FALSE !(!(ep13 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L295] mode1 = 1 [L297] _Bool node2__newmax; [L298] node2__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L299] COND FALSE !(!(mode2 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L305] COND TRUE ((int)r2) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L307] COND FALSE !(!(ep21 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L320] COND TRUE !(ep23 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L322] COND TRUE !(newmax2 == 0) [L324] int node2____CPAchecker_TMP_1; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L325] COND TRUE max2 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, 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] [L327] COND TRUE p23_new == nomsg [L329] node2____CPAchecker_TMP_1 = max2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=126, nomsg=-1, p12=0, p12_new=127, 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] [L331] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] mode2 = 1 [L335] _Bool node3__newmax; [L336] node3__newmax = 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L337] COND FALSE !(!(mode3 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L343] COND TRUE ((int)r3) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L345] COND TRUE !(ep31 == 0) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L347] COND TRUE !(newmax3 == 0) [L349] int node3____CPAchecker_TMP_0; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L350] COND TRUE max3 != nomsg VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L352] COND TRUE p31_new == nomsg [L354] node3____CPAchecker_TMP_0 = max3 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_0=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, 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] [L356] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L358] COND FALSE !(!(ep32 == 0)) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=127, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=126, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] mode3 = 1 [L372] p12_old = p12_new [L373] p12_new = nomsg [L374] p13_old = p13_new [L375] p13_new = nomsg [L376] p21_old = p21_new [L377] p21_new = nomsg [L378] p23_old = p23_new [L379] p23_new = nomsg [L380] p31_old = p31_new [L381] p31_new = nomsg [L382] p32_old = p32_new [L383] p32_new = nomsg [L385] int check__tmp; VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L386] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L388] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L390] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L392] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L394] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE ((int)r1) < 2 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L404] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L410] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1237=1, __return_1383=0, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int)r1) < 2 [L414] check__tmp = 1 [L415] __return_1383 = check__tmp [L416] main__c1 = __return_1383 [L418] _Bool __tmp_1; [L419] __tmp_1 = main__c1 [L420] _Bool assert__arg; [L421] assert__arg = __tmp_1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L422] COND FALSE !(assert__arg == 0) [L428] int main____CPAchecker_TMP_0 = main__i2; [L429] main__i2 = main__i2 + 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE main__i2 < 6 [L433] _Bool node1__newmax; [L434] node1__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L435] COND TRUE !(mode1 == 0) [L437] r1 = (char)(((int)r1) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND FALSE !(!(ep21 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE !(ep31 == 0) [L449] m1 = p31_old [L450] p31_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L451] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] newmax1 = node1__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE ((int)r1) == 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND TRUE ((int)max1) == ((int)id1) [L461] st1 = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L463] mode1 = 0 [L465] _Bool node2__newmax; [L466] node2__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L467] COND TRUE !(mode2 == 0) [L469] r2 = (char)(((int)r2) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, 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] [L470] COND TRUE !(ep12 == 0) [L472] m2 = p12_old [L473] p12_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=126, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=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=126, 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] [L474] COND TRUE ((int)m2) > ((int)max2) [L476] max2 = m2 [L477] node2__newmax = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=1, 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=126, 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] [L479] COND FALSE !(!(ep32 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node2__newmax=1, 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=126, 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] [L488] newmax2 = node2__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=126, 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] [L489] COND FALSE !(((int)r2) == 2) [L495] mode2 = 0 [L497] _Bool node3__newmax; [L498] node3__newmax = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=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=126, 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] [L499] COND TRUE !(mode3 == 0) [L501] r3 = (char)(((int)r3) + 1) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=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=126, 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] [L502] COND FALSE !(!(ep13 == 0)) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=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=126, 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 TRUE !(ep23 == 0) [L513] m3 = p23_old [L514] p23_old = nomsg VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=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] [L515] COND TRUE ((int)m3) > ((int)max3) [L517] max3 = m3 [L518] node3__newmax = 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node3__newmax=1, 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] [L520] newmax3 = node3__newmax VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=1, newmax3=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] [L521] COND FALSE !(((int)r3) == 2) [L527] mode3 = 0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L541] int check__tmp; VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L542] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L544] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L546] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L548] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L550] COND FALSE !(((int)r1) >= 2) VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L556] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1181] check__tmp = 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L574] __return_1517 = check__tmp [L575] main__c1 = __return_1517 [L576] __tmp_1518_0 = main____CPAchecker_TMP_0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main__c1=0, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L578] main____CPAchecker_TMP_0 = __tmp_1518_0 [L580] _Bool __tmp_2; [L581] __tmp_2 = main__c1 [L582] _Bool assert__arg; [L583] assert__arg = __tmp_2 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, assert__arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L584] COND TRUE assert__arg == 0 VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L586] reach_error() VAL [__return_1237=1, __return_1383=1, __return_1517=0, __return_1531=0, __return_1641=0, __return_main=0, __tmp_1518_0=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=127, id2=126, id3=0, init__r211=0, m1=0, m2=127, m3=126, main__i2=1, max1=127, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 240 locations, 421 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8372 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8372 mSDsluCounter, 22378 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11750 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 10628 mSDtfsCounter, 639 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76803occurred in iteration=21, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 105440 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2741 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2597 ConstructedInterpolants, 0 QuantifiedInterpolants, 7739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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:38:31,934 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