./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f43d028ba6ad7288ae454484b752e467a139fa9128b5cbd8640720a39b09e4f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:12:32,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:12:32,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:12:32,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:12:32,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:12:32,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:12:32,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:12:32,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:12:32,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:12:32,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:12:32,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:12:32,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:12:32,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:12:32,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:12:32,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:12:32,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:12:32,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:12:32,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:12:32,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:12:32,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:12:32,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:12:32,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:12:32,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:12:32,579 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 -> f43d028ba6ad7288ae454484b752e467a139fa9128b5cbd8640720a39b09e4f4 [2025-03-08 06:12:32,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:12:32,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:12:32,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:12:32,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:12:32,826 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:12:32,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:12:34,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db42601d5/59c06e77d92a4f0d8926fce57d459e16/FLAGed9d31b50 [2025-03-08 06:12:34,283 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:12:34,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:12:34,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db42601d5/59c06e77d92a4f0d8926fce57d459e16/FLAGed9d31b50 [2025-03-08 06:12:34,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db42601d5/59c06e77d92a4f0d8926fce57d459e16 [2025-03-08 06:12:34,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:12:34,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:12:34,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:12:34,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:12:34,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:12:34,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff61055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34, skipping insertion in model container [2025-03-08 06:12:34,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:12:34,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14043,14056] [2025-03-08 06:12:34,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:12:34,598 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:12:34,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14043,14056] [2025-03-08 06:12:34,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:12:34,719 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:12:34,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34 WrapperNode [2025-03-08 06:12:34,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:12:34,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:12:34,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:12:34,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:12:34,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,797 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1216 [2025-03-08 06:12:34,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:12:34,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:12:34,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:12:34,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:12:34,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,842 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-08 06:12:34,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:12:34,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:12:34,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:12:34,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:12:34,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (1/1) ... [2025-03-08 06:12:34,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:12:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:12:34,903 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-08 06:12:34,910 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-08 06:12:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:12:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:12:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:12:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:12:35,015 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:12:35,016 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:12:35,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L830: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-08 06:12:35,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1326: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:12:35,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:12:35,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L950: havoc main_~check__tmp~4#1; [2025-03-08 06:12:35,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1220: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:12:35,997 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-08 06:12:35,997 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:12:36,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:12:36,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:12:36,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:12:36 BoogieIcfgContainer [2025-03-08 06:12:36,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:12:36,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:12:36,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:12:36,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:12:36,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:12:34" (1/3) ... [2025-03-08 06:12:36,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556ed3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:12:36, skipping insertion in model container [2025-03-08 06:12:36,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:12:34" (2/3) ... [2025-03-08 06:12:36,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556ed3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:12:36, skipping insertion in model container [2025-03-08 06:12:36,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:12:36" (3/3) ... [2025-03-08 06:12:36,024 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-08 06:12:36,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:12:36,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 301 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:12:36,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:12:36,133 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;@52a09fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:12:36,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:12:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 299 states have (on average 1.7892976588628762) internal successors, (535), 300 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:12:36,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:36,146 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, 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-08 06:12:36,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:36,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1869510791, now seen corresponding path program 1 times [2025-03-08 06:12:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753653845] [2025-03-08 06:12:36,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:36,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:12:36,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:12:36,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:36,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:37,113 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-08 06:12:37,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:37,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753653845] [2025-03-08 06:12:37,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753653845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:37,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:37,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:37,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810961000] [2025-03-08 06:12:37,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:37,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:37,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:37,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:37,146 INFO L87 Difference]: Start difference. First operand has 301 states, 299 states have (on average 1.7892976588628762) internal successors, (535), 300 states have internal predecessors, (535), 0 states have call successors, (0), 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 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:37,341 INFO L93 Difference]: Finished difference Result 1446 states and 2582 transitions. [2025-03-08 06:12:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:12:37,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-03-08 06:12:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:37,370 INFO L225 Difference]: With dead ends: 1446 [2025-03-08 06:12:37,370 INFO L226 Difference]: Without dead ends: 1146 [2025-03-08 06:12:37,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 06:12:37,378 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 1561 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:37,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 2322 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:12:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-08 06:12:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 577. [2025-03-08 06:12:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4513888888888888) internal successors, (836), 576 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 836 transitions. [2025-03-08 06:12:37,451 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 836 transitions. Word has length 143 [2025-03-08 06:12:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:37,452 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 836 transitions. [2025-03-08 06:12:37,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 836 transitions. [2025-03-08 06:12:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 06:12:37,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:37,457 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, 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-08 06:12:37,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:12:37,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:37,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 942950656, now seen corresponding path program 1 times [2025-03-08 06:12:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:37,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949160621] [2025-03-08 06:12:37,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:37,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 06:12:37,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 06:12:37,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:37,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:37,605 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-08 06:12:37,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:37,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949160621] [2025-03-08 06:12:37,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949160621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:37,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:37,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:12:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26993816] [2025-03-08 06:12:37,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:37,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:12:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:37,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:12:37,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:12:37,608 INFO L87 Difference]: Start difference. First operand 577 states and 836 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:37,628 INFO L93 Difference]: Finished difference Result 1128 states and 1629 transitions. [2025-03-08 06:12:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:12:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-03-08 06:12:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:37,631 INFO L225 Difference]: With dead ends: 1128 [2025-03-08 06:12:37,631 INFO L226 Difference]: Without dead ends: 579 [2025-03-08 06:12:37,632 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-08 06:12:37,635 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 868 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-08 06:12:37,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 868 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-08 06:12:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2025-03-08 06:12:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4498269896193772) internal successors, (838), 578 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 838 transitions. [2025-03-08 06:12:37,659 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 838 transitions. Word has length 144 [2025-03-08 06:12:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:37,660 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 838 transitions. [2025-03-08 06:12:37,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 838 transitions. [2025-03-08 06:12:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:12:37,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:37,666 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, 1, 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-08 06:12:37,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:12:37,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1570576463, now seen corresponding path program 1 times [2025-03-08 06:12:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916104143] [2025-03-08 06:12:37,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:37,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:12:37,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:12:37,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:37,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:38,150 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-08 06:12:38,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:38,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916104143] [2025-03-08 06:12:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916104143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:38,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:38,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114825598] [2025-03-08 06:12:38,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:38,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:38,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:38,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:38,154 INFO L87 Difference]: Start difference. First operand 579 states and 838 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:38,179 INFO L93 Difference]: Finished difference Result 1144 states and 1655 transitions. [2025-03-08 06:12:38,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:12:38,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-08 06:12:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:38,182 INFO L225 Difference]: With dead ends: 1144 [2025-03-08 06:12:38,183 INFO L226 Difference]: Without dead ends: 579 [2025-03-08 06:12:38,183 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-08 06:12:38,184 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 20 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1373 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-08 06:12:38,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-08 06:12:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 578. [2025-03-08 06:12:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4471403812824957) internal successors, (835), 577 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 835 transitions. [2025-03-08 06:12:38,196 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 835 transitions. Word has length 145 [2025-03-08 06:12:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:38,196 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 835 transitions. [2025-03-08 06:12:38,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 835 transitions. [2025-03-08 06:12:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:12:38,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:38,199 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, 1, 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-08 06:12:38,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:12:38,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1954629046, now seen corresponding path program 1 times [2025-03-08 06:12:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808990922] [2025-03-08 06:12:38,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:38,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:12:38,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:12:38,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:38,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:38,302 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-08 06:12:38,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808990922] [2025-03-08 06:12:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808990922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:38,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:38,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:12:38,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462895686] [2025-03-08 06:12:38,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:38,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:12:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:38,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:12:38,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:12:38,304 INFO L87 Difference]: Start difference. First operand 578 states and 835 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:38,344 INFO L93 Difference]: Finished difference Result 1520 states and 2208 transitions. [2025-03-08 06:12:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:12:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-08 06:12:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:38,349 INFO L225 Difference]: With dead ends: 1520 [2025-03-08 06:12:38,349 INFO L226 Difference]: Without dead ends: 1117 [2025-03-08 06:12:38,350 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-08 06:12:38,350 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 363 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:38,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1177 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-08 06:12:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1115. [2025-03-08 06:12:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.4326750448833034) internal successors, (1596), 1114 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1596 transitions. [2025-03-08 06:12:38,382 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1596 transitions. Word has length 145 [2025-03-08 06:12:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:38,383 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1596 transitions. [2025-03-08 06:12:38,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1596 transitions. [2025-03-08 06:12:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 06:12:38,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:38,385 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, 1, 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-08 06:12:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:12:38,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:38,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2110609588, now seen corresponding path program 1 times [2025-03-08 06:12:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153558298] [2025-03-08 06:12:38,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:38,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 06:12:38,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 06:12:38,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:38,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:38,702 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-08 06:12:38,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153558298] [2025-03-08 06:12:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153558298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:38,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:12:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211267681] [2025-03-08 06:12:38,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:38,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:12:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:38,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:12:38,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:12:38,705 INFO L87 Difference]: Start difference. First operand 1115 states and 1596 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:38,766 INFO L93 Difference]: Finished difference Result 2647 states and 3781 transitions. [2025-03-08 06:12:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:12:38,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-08 06:12:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:38,771 INFO L225 Difference]: With dead ends: 2647 [2025-03-08 06:12:38,771 INFO L226 Difference]: Without dead ends: 1561 [2025-03-08 06:12:38,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:12:38,776 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 380 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:38,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1819 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2025-03-08 06:12:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1559. [2025-03-08 06:12:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.41591784338896) internal successors, (2206), 1558 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2206 transitions. [2025-03-08 06:12:38,810 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2206 transitions. Word has length 145 [2025-03-08 06:12:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:38,810 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2206 transitions. [2025-03-08 06:12:38,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2206 transitions. [2025-03-08 06:12:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:12:38,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:38,816 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, 1, 1, 1, 1, 1, 1, 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-08 06:12:38,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:12:38,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 273811044, now seen corresponding path program 1 times [2025-03-08 06:12:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724868402] [2025-03-08 06:12:38,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:38,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:12:38,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:12:38,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:38,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:38,893 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-08 06:12:38,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:38,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724868402] [2025-03-08 06:12:38,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724868402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:38,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:38,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:12:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622701320] [2025-03-08 06:12:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:38,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:12:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:38,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:12:38,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:12:38,895 INFO L87 Difference]: Start difference. First operand 1559 states and 2206 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:38,941 INFO L93 Difference]: Finished difference Result 3529 states and 5055 transitions. [2025-03-08 06:12:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:12:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-08 06:12:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:38,949 INFO L225 Difference]: With dead ends: 3529 [2025-03-08 06:12:38,949 INFO L226 Difference]: Without dead ends: 2399 [2025-03-08 06:12:38,950 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-08 06:12:38,951 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 360 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:38,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1188 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2025-03-08 06:12:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2397. [2025-03-08 06:12:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2396 states have (on average 1.406093489148581) internal successors, (3369), 2396 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3369 transitions. [2025-03-08 06:12:39,002 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3369 transitions. Word has length 150 [2025-03-08 06:12:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:39,002 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3369 transitions. [2025-03-08 06:12:39,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3369 transitions. [2025-03-08 06:12:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:12:39,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:39,006 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, 1, 1, 1, 1, 1, 1, 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-08 06:12:39,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:12:39,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:39,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:39,006 INFO L85 PathProgramCache]: Analyzing trace with hash -54268860, now seen corresponding path program 1 times [2025-03-08 06:12:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912201652] [2025-03-08 06:12:39,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:39,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:12:39,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:12:39,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:39,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:39,234 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-08 06:12:39,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:39,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912201652] [2025-03-08 06:12:39,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912201652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:39,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:39,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:12:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303992522] [2025-03-08 06:12:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:39,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:12:39,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:39,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:12:39,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:12:39,236 INFO L87 Difference]: Start difference. First operand 2397 states and 3369 transitions. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:39,680 INFO L93 Difference]: Finished difference Result 7231 states and 10790 transitions. [2025-03-08 06:12:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:12:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-08 06:12:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:39,697 INFO L225 Difference]: With dead ends: 7231 [2025-03-08 06:12:39,697 INFO L226 Difference]: Without dead ends: 5283 [2025-03-08 06:12:39,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:12:39,703 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 4918 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4918 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:39,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 1163 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:12:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5283 states. [2025-03-08 06:12:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5283 to 3395. [2025-03-08 06:12:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3395 states, 3394 states have (on average 1.4457866823806718) internal successors, (4907), 3394 states have internal predecessors, (4907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 4907 transitions. [2025-03-08 06:12:39,792 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 4907 transitions. Word has length 150 [2025-03-08 06:12:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:39,793 INFO L471 AbstractCegarLoop]: Abstraction has 3395 states and 4907 transitions. [2025-03-08 06:12:39,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 4907 transitions. [2025-03-08 06:12:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:12:39,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:39,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:12:39,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:39,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash -447295870, now seen corresponding path program 1 times [2025-03-08 06:12:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740131799] [2025-03-08 06:12:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:39,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:12:39,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:12:39,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:39,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:40,084 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-08 06:12:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740131799] [2025-03-08 06:12:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740131799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750450199] [2025-03-08 06:12:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:40,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:40,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:40,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:40,086 INFO L87 Difference]: Start difference. First operand 3395 states and 4907 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:40,121 INFO L93 Difference]: Finished difference Result 5925 states and 8568 transitions. [2025-03-08 06:12:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:12:40,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-08 06:12:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:40,130 INFO L225 Difference]: With dead ends: 5925 [2025-03-08 06:12:40,130 INFO L226 Difference]: Without dead ends: 2711 [2025-03-08 06:12:40,134 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-08 06:12:40,135 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 23 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1356 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-08 06:12:40,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1356 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-08 06:12:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2711. [2025-03-08 06:12:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.4361623616236163) internal successors, (3892), 2710 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3892 transitions. [2025-03-08 06:12:40,193 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3892 transitions. Word has length 150 [2025-03-08 06:12:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:40,193 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3892 transitions. [2025-03-08 06:12:40,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3892 transitions. [2025-03-08 06:12:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 06:12:40,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:40,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:40,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:12:40,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:40,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1666522241, now seen corresponding path program 1 times [2025-03-08 06:12:40,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:40,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503121525] [2025-03-08 06:12:40,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:40,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:40,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 06:12:40,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 06:12:40,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:40,429 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-08 06:12:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:40,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503121525] [2025-03-08 06:12:40,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503121525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:40,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:40,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:12:40,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097304260] [2025-03-08 06:12:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:40,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:12:40,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:40,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:12:40,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:12:40,431 INFO L87 Difference]: Start difference. First operand 2711 states and 3892 transitions. Second operand has 8 states, 8 states have (on average 19.125) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:40,946 INFO L93 Difference]: Finished difference Result 7502 states and 11115 transitions. [2025-03-08 06:12:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:12:40,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-03-08 06:12:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:40,962 INFO L225 Difference]: With dead ends: 7502 [2025-03-08 06:12:40,963 INFO L226 Difference]: Without dead ends: 5085 [2025-03-08 06:12:40,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:12:40,969 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 4880 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4880 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:40,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4880 Valid, 1137 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:12:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2025-03-08 06:12:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 3171. [2025-03-08 06:12:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 3170 states have (on average 1.4321766561514195) internal successors, (4540), 3170 states have internal predecessors, (4540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4540 transitions. [2025-03-08 06:12:41,055 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4540 transitions. Word has length 153 [2025-03-08 06:12:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:41,056 INFO L471 AbstractCegarLoop]: Abstraction has 3171 states and 4540 transitions. [2025-03-08 06:12:41,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4540 transitions. [2025-03-08 06:12:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 06:12:41,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:41,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:41,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:12:41,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:41,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -327622465, now seen corresponding path program 1 times [2025-03-08 06:12:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:41,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729865645] [2025-03-08 06:12:41,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:41,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 06:12:41,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 06:12:41,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:41,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:41,313 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-08 06:12:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729865645] [2025-03-08 06:12:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729865645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587311998] [2025-03-08 06:12:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:41,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:41,315 INFO L87 Difference]: Start difference. First operand 3171 states and 4540 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:41,448 INFO L93 Difference]: Finished difference Result 15185 states and 21786 transitions. [2025-03-08 06:12:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:12:41,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-03-08 06:12:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:41,479 INFO L225 Difference]: With dead ends: 15185 [2025-03-08 06:12:41,479 INFO L226 Difference]: Without dead ends: 12053 [2025-03-08 06:12:41,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 06:12:41,487 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 1149 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:41,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1748 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:12:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12053 states. [2025-03-08 06:12:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12053 to 6069. [2025-03-08 06:12:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6069 states, 6068 states have (on average 1.4218852999340805) internal successors, (8628), 6068 states have internal predecessors, (8628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 8628 transitions. [2025-03-08 06:12:41,669 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 8628 transitions. Word has length 153 [2025-03-08 06:12:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:41,669 INFO L471 AbstractCegarLoop]: Abstraction has 6069 states and 8628 transitions. [2025-03-08 06:12:41,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 8628 transitions. [2025-03-08 06:12:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 06:12:41,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:41,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:41,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:12:41,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:41,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1345746248, now seen corresponding path program 1 times [2025-03-08 06:12:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601351373] [2025-03-08 06:12:41,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 06:12:41,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 06:12:41,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:41,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:41,756 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-08 06:12:41,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601351373] [2025-03-08 06:12:41,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601351373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:41,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:41,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:12:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782992500] [2025-03-08 06:12:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:41,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:12:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:41,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:12:41,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:12:41,758 INFO L87 Difference]: Start difference. First operand 6069 states and 8628 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:41,803 INFO L93 Difference]: Finished difference Result 12043 states and 17131 transitions. [2025-03-08 06:12:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:12:41,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-08 06:12:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:41,815 INFO L225 Difference]: With dead ends: 12043 [2025-03-08 06:12:41,816 INFO L226 Difference]: Without dead ends: 6075 [2025-03-08 06:12:41,822 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-08 06:12:41,823 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 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-08 06:12:41,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2025-03-08 06:12:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 6075. [2025-03-08 06:12:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6075 states, 6074 states have (on average 1.421468554494567) internal successors, (8634), 6074 states have internal predecessors, (8634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 8634 transitions. [2025-03-08 06:12:41,938 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 8634 transitions. Word has length 154 [2025-03-08 06:12:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:41,938 INFO L471 AbstractCegarLoop]: Abstraction has 6075 states and 8634 transitions. [2025-03-08 06:12:41,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 8634 transitions. [2025-03-08 06:12:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 06:12:41,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:41,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:41,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:12:41,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:41,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:41,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1962220409, now seen corresponding path program 1 times [2025-03-08 06:12:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484679349] [2025-03-08 06:12:41,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:41,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 06:12:41,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 06:12:41,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:41,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:42,246 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-08 06:12:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:42,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484679349] [2025-03-08 06:12:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484679349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:42,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:42,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093481568] [2025-03-08 06:12:42,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:42,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:42,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:42,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:42,248 INFO L87 Difference]: Start difference. First operand 6075 states and 8634 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:42,290 INFO L93 Difference]: Finished difference Result 12112 states and 17216 transitions. [2025-03-08 06:12:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:12:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-08 06:12:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:42,300 INFO L225 Difference]: With dead ends: 12112 [2025-03-08 06:12:42,300 INFO L226 Difference]: Without dead ends: 6069 [2025-03-08 06:12:42,307 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-08 06:12:42,308 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 14 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1305 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-08 06:12:42,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1305 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2025-03-08 06:12:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 6069. [2025-03-08 06:12:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6069 states, 6068 states have (on average 1.42089650626236) internal successors, (8622), 6068 states have internal predecessors, (8622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 8622 transitions. [2025-03-08 06:12:42,405 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 8622 transitions. Word has length 155 [2025-03-08 06:12:42,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:42,405 INFO L471 AbstractCegarLoop]: Abstraction has 6069 states and 8622 transitions. [2025-03-08 06:12:42,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 8622 transitions. [2025-03-08 06:12:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 06:12:42,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:42,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:42,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:12:42,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:42,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1255416254, now seen corresponding path program 1 times [2025-03-08 06:12:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:42,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149884286] [2025-03-08 06:12:42,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:42,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 06:12:42,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 06:12:42,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:42,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:12:42,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:42,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149884286] [2025-03-08 06:12:42,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149884286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:42,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:42,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:12:42,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998704571] [2025-03-08 06:12:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:42,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:12:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:42,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:12:42,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:12:42,477 INFO L87 Difference]: Start difference. First operand 6069 states and 8622 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:42,530 INFO L93 Difference]: Finished difference Result 14438 states and 20612 transitions. [2025-03-08 06:12:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:12:42,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-03-08 06:12:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:42,547 INFO L225 Difference]: With dead ends: 14438 [2025-03-08 06:12:42,547 INFO L226 Difference]: Without dead ends: 9040 [2025-03-08 06:12:42,556 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-08 06:12:42,557 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 337 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:42,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1118 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9040 states. [2025-03-08 06:12:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9040 to 9038. [2025-03-08 06:12:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9038 states, 9037 states have (on average 1.4004647560030983) internal successors, (12656), 9037 states have internal predecessors, (12656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9038 states to 9038 states and 12656 transitions. [2025-03-08 06:12:42,732 INFO L78 Accepts]: Start accepts. Automaton has 9038 states and 12656 transitions. Word has length 155 [2025-03-08 06:12:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:42,733 INFO L471 AbstractCegarLoop]: Abstraction has 9038 states and 12656 transitions. [2025-03-08 06:12:42,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 9038 states and 12656 transitions. [2025-03-08 06:12:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 06:12:42,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:42,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:42,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:12:42,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:42,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:42,741 INFO L85 PathProgramCache]: Analyzing trace with hash -422731649, now seen corresponding path program 1 times [2025-03-08 06:12:42,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:42,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82537532] [2025-03-08 06:12:42,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:42,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:42,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:12:42,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:12:42,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:42,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:43,287 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-08 06:12:43,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82537532] [2025-03-08 06:12:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82537532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:43,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:43,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:12:43,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364566248] [2025-03-08 06:12:43,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:43,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:12:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:43,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:12:43,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:12:43,289 INFO L87 Difference]: Start difference. First operand 9038 states and 12656 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:43,482 INFO L93 Difference]: Finished difference Result 22578 states and 32690 transitions. [2025-03-08 06:12:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:12:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-08 06:12:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:43,512 INFO L225 Difference]: With dead ends: 22578 [2025-03-08 06:12:43,513 INFO L226 Difference]: Without dead ends: 16611 [2025-03-08 06:12:43,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:12:43,527 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1015 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:43,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 2309 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:12:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16611 states. [2025-03-08 06:12:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16611 to 16609. [2025-03-08 06:12:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16609 states, 16608 states have (on average 1.416847302504817) internal successors, (23531), 16608 states have internal predecessors, (23531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16609 states to 16609 states and 23531 transitions. [2025-03-08 06:12:43,844 INFO L78 Accepts]: Start accepts. Automaton has 16609 states and 23531 transitions. Word has length 161 [2025-03-08 06:12:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:43,844 INFO L471 AbstractCegarLoop]: Abstraction has 16609 states and 23531 transitions. [2025-03-08 06:12:43,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 16609 states and 23531 transitions. [2025-03-08 06:12:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 06:12:43,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:43,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:43,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:12:43,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:43,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:43,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2066797313, now seen corresponding path program 1 times [2025-03-08 06:12:43,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:43,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641812634] [2025-03-08 06:12:43,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:43,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:43,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:12:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:12:43,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:44,595 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-08 06:12:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641812634] [2025-03-08 06:12:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641812634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:44,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:12:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557712800] [2025-03-08 06:12:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:44,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:12:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:44,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:12:44,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:12:44,597 INFO L87 Difference]: Start difference. First operand 16609 states and 23531 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:45,242 INFO L93 Difference]: Finished difference Result 27433 states and 38821 transitions. [2025-03-08 06:12:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:12:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-08 06:12:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:45,281 INFO L225 Difference]: With dead ends: 27433 [2025-03-08 06:12:45,281 INFO L226 Difference]: Without dead ends: 23341 [2025-03-08 06:12:45,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:12:45,293 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 2393 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:45,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 3527 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:12:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23341 states. [2025-03-08 06:12:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23341 to 18075. [2025-03-08 06:12:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18075 states, 18074 states have (on average 1.3943233373907271) internal successors, (25201), 18074 states have internal predecessors, (25201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18075 states to 18075 states and 25201 transitions. [2025-03-08 06:12:45,590 INFO L78 Accepts]: Start accepts. Automaton has 18075 states and 25201 transitions. Word has length 161 [2025-03-08 06:12:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:45,591 INFO L471 AbstractCegarLoop]: Abstraction has 18075 states and 25201 transitions. [2025-03-08 06:12:45,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18075 states and 25201 transitions. [2025-03-08 06:12:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 06:12:45,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:45,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:45,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:12:45,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:45,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2128836927, now seen corresponding path program 1 times [2025-03-08 06:12:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:45,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088838663] [2025-03-08 06:12:45,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:45,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 06:12:45,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 06:12:45,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:45,835 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-08 06:12:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088838663] [2025-03-08 06:12:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088838663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167191910] [2025-03-08 06:12:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:45,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:45,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:45,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:45,837 INFO L87 Difference]: Start difference. First operand 18075 states and 25201 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:46,021 INFO L93 Difference]: Finished difference Result 34003 states and 47352 transitions. [2025-03-08 06:12:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:12:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-08 06:12:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:46,049 INFO L225 Difference]: With dead ends: 34003 [2025-03-08 06:12:46,050 INFO L226 Difference]: Without dead ends: 16253 [2025-03-08 06:12:46,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 06:12:46,062 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 348 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:46,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1578 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2025-03-08 06:12:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 16212. [2025-03-08 06:12:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16212 states, 16211 states have (on average 1.3862192338535562) internal successors, (22472), 16211 states have internal predecessors, (22472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16212 states to 16212 states and 22472 transitions. [2025-03-08 06:12:46,336 INFO L78 Accepts]: Start accepts. Automaton has 16212 states and 22472 transitions. Word has length 161 [2025-03-08 06:12:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:46,336 INFO L471 AbstractCegarLoop]: Abstraction has 16212 states and 22472 transitions. [2025-03-08 06:12:46,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16212 states and 22472 transitions. [2025-03-08 06:12:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 06:12:46,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:46,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:46,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:12:46,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:46,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1574212994, now seen corresponding path program 1 times [2025-03-08 06:12:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:46,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8329679] [2025-03-08 06:12:46,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:46,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 06:12:46,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 06:12:46,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:46,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:46,652 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-08 06:12:46,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:46,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8329679] [2025-03-08 06:12:46,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8329679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:46,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40216317] [2025-03-08 06:12:46,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:46,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:46,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:46,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:46,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:46,654 INFO L87 Difference]: Start difference. First operand 16212 states and 22472 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:46,839 INFO L93 Difference]: Finished difference Result 48685 states and 67468 transitions. [2025-03-08 06:12:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:12:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-03-08 06:12:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:46,902 INFO L225 Difference]: With dead ends: 48685 [2025-03-08 06:12:46,902 INFO L226 Difference]: Without dead ends: 32622 [2025-03-08 06:12:46,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 06:12:46,929 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 1116 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:46,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 1726 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:12:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32622 states. [2025-03-08 06:12:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32622 to 16321. [2025-03-08 06:12:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16321 states, 16320 states have (on average 1.3840073529411765) internal successors, (22587), 16320 states have internal predecessors, (22587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16321 states to 16321 states and 22587 transitions. [2025-03-08 06:12:47,260 INFO L78 Accepts]: Start accepts. Automaton has 16321 states and 22587 transitions. Word has length 163 [2025-03-08 06:12:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:47,260 INFO L471 AbstractCegarLoop]: Abstraction has 16321 states and 22587 transitions. [2025-03-08 06:12:47,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 16321 states and 22587 transitions. [2025-03-08 06:12:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 06:12:47,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:47,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:47,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:12:47,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:47,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash -588382155, now seen corresponding path program 1 times [2025-03-08 06:12:47,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:47,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829236116] [2025-03-08 06:12:47,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:47,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:47,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 06:12:47,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 06:12:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:47,380 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-08 06:12:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829236116] [2025-03-08 06:12:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829236116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:47,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:12:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815176421] [2025-03-08 06:12:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:47,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:12:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:47,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:12:47,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:12:47,383 INFO L87 Difference]: Start difference. First operand 16321 states and 22587 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:47,447 INFO L93 Difference]: Finished difference Result 28657 states and 39681 transitions. [2025-03-08 06:12:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:12:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-08 06:12:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:47,477 INFO L225 Difference]: With dead ends: 28657 [2025-03-08 06:12:47,477 INFO L226 Difference]: Without dead ends: 16331 [2025-03-08 06:12:47,490 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-08 06:12:47,490 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 822 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-08 06:12:47,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 822 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16331 states. [2025-03-08 06:12:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16331 to 16331. [2025-03-08 06:12:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16331 states, 16330 states have (on average 1.3837721984078384) internal successors, (22597), 16330 states have internal predecessors, (22597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16331 states to 16331 states and 22597 transitions. [2025-03-08 06:12:47,689 INFO L78 Accepts]: Start accepts. Automaton has 16331 states and 22597 transitions. Word has length 164 [2025-03-08 06:12:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:47,689 INFO L471 AbstractCegarLoop]: Abstraction has 16331 states and 22597 transitions. [2025-03-08 06:12:47,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 16331 states and 22597 transitions. [2025-03-08 06:12:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:12:47,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:47,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:47,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:12:47,712 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 806865546, now seen corresponding path program 1 times [2025-03-08 06:12:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:47,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134067900] [2025-03-08 06:12:47,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:47,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:12:47,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:12:47,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:47,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:12:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:47,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134067900] [2025-03-08 06:12:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134067900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390586321] [2025-03-08 06:12:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:47,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:47,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:47,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:47,983 INFO L87 Difference]: Start difference. First operand 16331 states and 22597 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:48,046 INFO L93 Difference]: Finished difference Result 29107 states and 40179 transitions. [2025-03-08 06:12:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:12:48,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-08 06:12:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:48,076 INFO L225 Difference]: With dead ends: 29107 [2025-03-08 06:12:48,076 INFO L226 Difference]: Without dead ends: 16321 [2025-03-08 06:12:48,090 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-08 06:12:48,090 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 3 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1267 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-08 06:12:48,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16321 states. [2025-03-08 06:12:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16321 to 16321. [2025-03-08 06:12:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16321 states, 16320 states have (on average 1.383700980392157) internal successors, (22582), 16320 states have internal predecessors, (22582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16321 states to 16321 states and 22582 transitions. [2025-03-08 06:12:48,274 INFO L78 Accepts]: Start accepts. Automaton has 16321 states and 22582 transitions. Word has length 165 [2025-03-08 06:12:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 16321 states and 22582 transitions. [2025-03-08 06:12:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 16321 states and 22582 transitions. [2025-03-08 06:12:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:12:48,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:48,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:48,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:12:48,285 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:48,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash 157249221, now seen corresponding path program 1 times [2025-03-08 06:12:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109040714] [2025-03-08 06:12:48,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:48,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:12:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:12:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:48,553 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-08 06:12:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109040714] [2025-03-08 06:12:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109040714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:48,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:12:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257948362] [2025-03-08 06:12:48,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:48,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:12:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:48,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:12:48,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:12:48,554 INFO L87 Difference]: Start difference. First operand 16321 states and 22582 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:48,639 INFO L93 Difference]: Finished difference Result 25110 states and 34851 transitions. [2025-03-08 06:12:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:12:48,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-03-08 06:12:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:48,666 INFO L225 Difference]: With dead ends: 25110 [2025-03-08 06:12:48,666 INFO L226 Difference]: Without dead ends: 14685 [2025-03-08 06:12:48,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-08 06:12:48,679 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 353 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:48,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1368 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14685 states. [2025-03-08 06:12:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14685 to 14408. [2025-03-08 06:12:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14408 states, 14407 states have (on average 1.37766363573263) internal successors, (19848), 14407 states have internal predecessors, (19848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14408 states to 14408 states and 19848 transitions. [2025-03-08 06:12:48,842 INFO L78 Accepts]: Start accepts. Automaton has 14408 states and 19848 transitions. Word has length 165 [2025-03-08 06:12:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:48,842 INFO L471 AbstractCegarLoop]: Abstraction has 14408 states and 19848 transitions. [2025-03-08 06:12:48,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14408 states and 19848 transitions. [2025-03-08 06:12:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 06:12:48,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:48,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:48,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:12:48,853 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:48,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1830584732, now seen corresponding path program 1 times [2025-03-08 06:12:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:48,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124397815] [2025-03-08 06:12:48,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:48,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:12:48,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:12:48,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:48,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:49,235 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-08 06:12:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124397815] [2025-03-08 06:12:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124397815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:49,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:49,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:12:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119305270] [2025-03-08 06:12:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:49,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:12:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:49,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:12:49,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:12:49,236 INFO L87 Difference]: Start difference. First operand 14408 states and 19848 transitions. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:49,514 INFO L93 Difference]: Finished difference Result 34843 states and 49795 transitions. [2025-03-08 06:12:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:12:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-08 06:12:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:49,554 INFO L225 Difference]: With dead ends: 34843 [2025-03-08 06:12:49,555 INFO L226 Difference]: Without dead ends: 26255 [2025-03-08 06:12:49,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:12:49,565 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 981 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:49,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 2323 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:12:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26255 states. [2025-03-08 06:12:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26255 to 26253. [2025-03-08 06:12:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26253 states, 26252 states have (on average 1.3928462593326223) internal successors, (36565), 26252 states have internal predecessors, (36565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26253 states to 26253 states and 36565 transitions. [2025-03-08 06:12:49,834 INFO L78 Accepts]: Start accepts. Automaton has 26253 states and 36565 transitions. Word has length 170 [2025-03-08 06:12:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:49,834 INFO L471 AbstractCegarLoop]: Abstraction has 26253 states and 36565 transitions. [2025-03-08 06:12:49,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 26253 states and 36565 transitions. [2025-03-08 06:12:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 06:12:49,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:49,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:49,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:12:49,844 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:49,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash -689375202, now seen corresponding path program 1 times [2025-03-08 06:12:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:49,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236867008] [2025-03-08 06:12:49,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:49,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:12:49,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:12:49,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:49,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:49,971 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-08 06:12:49,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:49,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236867008] [2025-03-08 06:12:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236867008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:12:49,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456522015] [2025-03-08 06:12:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:49,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:12:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:49,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:12:49,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:12:49,973 INFO L87 Difference]: Start difference. First operand 26253 states and 36565 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:50,183 INFO L93 Difference]: Finished difference Result 47112 states and 68038 transitions. [2025-03-08 06:12:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:12:50,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-08 06:12:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:50,261 INFO L225 Difference]: With dead ends: 47112 [2025-03-08 06:12:50,261 INFO L226 Difference]: Without dead ends: 43033 [2025-03-08 06:12:50,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:12:50,280 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 908 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:50,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1352 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:12:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43033 states. [2025-03-08 06:12:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43033 to 34909. [2025-03-08 06:12:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34909 states, 34908 states have (on average 1.4176979488942363) internal successors, (49489), 34908 states have internal predecessors, (49489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34909 states to 34909 states and 49489 transitions. [2025-03-08 06:12:50,875 INFO L78 Accepts]: Start accepts. Automaton has 34909 states and 49489 transitions. Word has length 170 [2025-03-08 06:12:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 34909 states and 49489 transitions. [2025-03-08 06:12:50,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 34909 states and 49489 transitions. [2025-03-08 06:12:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 06:12:50,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:50,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:50,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:12:50,888 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:50,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1969238880, now seen corresponding path program 1 times [2025-03-08 06:12:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:50,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585125454] [2025-03-08 06:12:50,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:50,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:50,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:12:50,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:12:50,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:50,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:50,981 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-08 06:12:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585125454] [2025-03-08 06:12:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585125454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:12:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280973781] [2025-03-08 06:12:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:50,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:12:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:50,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:12:50,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:12:50,982 INFO L87 Difference]: Start difference. First operand 34909 states and 49489 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:51,224 INFO L93 Difference]: Finished difference Result 86934 states and 126372 transitions. [2025-03-08 06:12:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:12:51,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-08 06:12:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:51,330 INFO L225 Difference]: With dead ends: 86934 [2025-03-08 06:12:51,331 INFO L226 Difference]: Without dead ends: 61034 [2025-03-08 06:12:51,366 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-08 06:12:51,367 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 236 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:51,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 695 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:12:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61034 states. [2025-03-08 06:12:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61034 to 61032. [2025-03-08 06:12:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61032 states, 61031 states have (on average 1.4232439252183318) internal successors, (86862), 61031 states have internal predecessors, (86862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61032 states to 61032 states and 86862 transitions. [2025-03-08 06:12:52,218 INFO L78 Accepts]: Start accepts. Automaton has 61032 states and 86862 transitions. Word has length 170 [2025-03-08 06:12:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:52,219 INFO L471 AbstractCegarLoop]: Abstraction has 61032 states and 86862 transitions. [2025-03-08 06:12:52,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 61032 states and 86862 transitions. [2025-03-08 06:12:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 06:12:52,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:52,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:12:52,233 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:52,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1543292448, now seen corresponding path program 1 times [2025-03-08 06:12:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250053979] [2025-03-08 06:12:52,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:52,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:12:52,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:12:52,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:52,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:12:52,852 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-08 06:12:52,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:12:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250053979] [2025-03-08 06:12:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250053979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:12:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:12:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:12:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697226077] [2025-03-08 06:12:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:12:52,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:12:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:12:52,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:12:52,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:12:52,853 INFO L87 Difference]: Start difference. First operand 61032 states and 86862 transitions. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:12:53,808 INFO L93 Difference]: Finished difference Result 110521 states and 158440 transitions. [2025-03-08 06:12:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:12:53,808 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-08 06:12:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:12:53,931 INFO L225 Difference]: With dead ends: 110521 [2025-03-08 06:12:53,932 INFO L226 Difference]: Without dead ends: 88985 [2025-03-08 06:12:53,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:12:53,977 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 1918 mSDsluCounter, 3835 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 4328 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:12:53,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 4328 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:12:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88985 states. [2025-03-08 06:12:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88985 to 63640. [2025-03-08 06:12:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63640 states, 63639 states have (on average 1.4114458115306652) internal successors, (89823), 63639 states have internal predecessors, (89823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63640 states to 63640 states and 89823 transitions. [2025-03-08 06:12:54,981 INFO L78 Accepts]: Start accepts. Automaton has 63640 states and 89823 transitions. Word has length 170 [2025-03-08 06:12:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:12:54,982 INFO L471 AbstractCegarLoop]: Abstraction has 63640 states and 89823 transitions. [2025-03-08 06:12:54,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:12:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 63640 states and 89823 transitions. [2025-03-08 06:12:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 06:12:54,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:12:54,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:12:54,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:12:54,997 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:12:54,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:12:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1683841058, now seen corresponding path program 1 times [2025-03-08 06:12:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:12:54,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420130450] [2025-03-08 06:12:54,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:12:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:12:55,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:12:55,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:12:55,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:55,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 06:12:55,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 06:12:55,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 06:12:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 06:12:55,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:12:55,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 06:12:55,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 06:12:55,206 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 06:12:55,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 06:12:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:12:55,210 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-08 06:12:55,522 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 06:12:55,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 06:12:55 BoogieIcfgContainer [2025-03-08 06:12:55,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 06:12:55,525 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 06:12:55,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 06:12:55,526 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 06:12:55,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:12:36" (3/4) ... [2025-03-08 06:12:55,527 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 06:12:55,700 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 147. [2025-03-08 06:12:55,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 06:12:55,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 06:12:55,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 06:12:55,796 INFO L158 Benchmark]: Toolchain (without parser) took 21475.92ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 104.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 322.8MB. Max. memory is 16.1GB. [2025-03-08 06:12:55,796 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 06:12:55,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.27ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 77.5MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 06:12:55,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.67ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 71.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 06:12:55,796 INFO L158 Benchmark]: Boogie Preprocessor took 67.71ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 67.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 06:12:55,797 INFO L158 Benchmark]: IcfgBuilder took 1146.17ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 36.2MB in the end (delta: 31.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2025-03-08 06:12:55,797 INFO L158 Benchmark]: TraceAbstraction took 19509.22ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 35.5MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 604.4MB. Max. memory is 16.1GB. [2025-03-08 06:12:55,797 INFO L158 Benchmark]: Witness Printer took 270.95ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 62.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 06:12:55,797 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.27ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 77.5MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.67ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 71.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.71ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 67.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1146.17ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 36.2MB in the end (delta: 31.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19509.22ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 35.5MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 604.4MB. Max. memory is 16.1GB. * Witness Printer took 270.95ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 62.9MB). Peak memory consumption was 67.1MB. 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: 837]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] port_t p12 = 0; [L28] char p12_old = '\x0'; [L29] char p12_new = '\x0'; [L30] _Bool ep12 = 0; [L31] port_t p13 = 0; [L32] char p13_old = '\x0'; [L33] char p13_new = '\x0'; [L34] _Bool ep13 = 0; [L35] port_t p21 = 0; [L36] char p21_old = '\x0'; [L37] char p21_new = '\x0'; [L38] _Bool ep21 = 0; [L39] port_t p23 = 0; [L40] char p23_old = '\x0'; [L41] char p23_new = '\x0'; [L42] _Bool ep23 = 0; [L43] port_t p31 = 0; [L44] char p31_old = '\x0'; [L45] char p31_new = '\x0'; [L46] _Bool ep31 = 0; [L47] port_t p32 = 0; [L48] char p32_old = '\x0'; [L49] char p32_new = '\x0'; [L50] _Bool ep32 = 0; [L51] char id1 = '\x0'; [L52] unsigned char r1 = '\x0'; [L53] char st1 = '\x0'; [L54] char nl1 = '\x0'; [L55] char m1 = '\x0'; [L56] char max1 = '\x0'; [L57] _Bool mode1 = 0; [L58] char id2 = '\x0'; [L59] unsigned char r2 = '\x0'; [L60] char st2 = '\x0'; [L61] char nl2 = '\x0'; [L62] char m2 = '\x0'; [L63] char max2 = '\x0'; [L64] _Bool mode2 = 0; [L65] char id3 = '\x0'; [L66] unsigned char r3 = '\x0'; [L67] char st3 = '\x0'; [L68] char nl3 = '\x0'; [L69] char m3 = '\x0'; [L70] char max3 = '\x0'; [L71] _Bool mode3 = 0; [L75] void (*nodes[3])() = { &node1, &node2, &node3 }; [L79] int __return_1719; [L80] int __return_1847; [L81] int __return_1965; [L82] int __return_2067; [L83] int __return_2190; [L84] int __return_2300; VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L87] int main__c1; [L88] int main__i2; [L89] main__c1 = 0 [L90] ep12 = __VERIFIER_nondet_bool() [L91] ep13 = __VERIFIER_nondet_bool() [L92] ep21 = __VERIFIER_nondet_bool() [L93] ep23 = __VERIFIER_nondet_bool() [L94] ep31 = __VERIFIER_nondet_bool() [L95] ep32 = __VERIFIER_nondet_bool() [L96] id1 = __VERIFIER_nondet_char() [L97] r1 = __VERIFIER_nondet_uchar() [L98] st1 = __VERIFIER_nondet_char() [L99] nl1 = __VERIFIER_nondet_char() [L100] m1 = __VERIFIER_nondet_char() [L101] max1 = __VERIFIER_nondet_char() [L102] mode1 = __VERIFIER_nondet_bool() [L103] id2 = __VERIFIER_nondet_char() [L104] r2 = __VERIFIER_nondet_uchar() [L105] st2 = __VERIFIER_nondet_char() [L106] nl2 = __VERIFIER_nondet_char() [L107] m2 = __VERIFIER_nondet_char() [L108] max2 = __VERIFIER_nondet_char() [L109] mode2 = __VERIFIER_nondet_bool() [L110] id3 = __VERIFIER_nondet_char() [L111] r3 = __VERIFIER_nondet_uchar() [L112] st3 = __VERIFIER_nondet_char() [L113] nl3 = __VERIFIER_nondet_char() [L114] m3 = __VERIFIER_nondet_char() [L115] max3 = __VERIFIER_nondet_char() [L116] mode3 = __VERIFIER_nondet_bool() [L118] _Bool init__r121; [L119] _Bool init__r131; [L120] _Bool init__r211; [L121] _Bool init__r231; [L122] _Bool init__r311; [L123] _Bool init__r321; [L124] _Bool init__r122; [L125] int init__tmp; [L126] _Bool init__r132; [L127] int init__tmp___0; [L128] _Bool init__r212; [L129] int init__tmp___1; [L130] _Bool init__r232; [L131] int init__tmp___2; [L132] _Bool init__r312; [L133] int init__tmp___3; [L134] _Bool init__r322; [L135] int init__tmp___4; [L136] int init__tmp___5; [L137] init__r121 = ep12 [L138] init__r131 = ep13 [L139] init__r211 = ep21 [L140] init__r231 = ep23 [L141] init__r311 = ep31 [L142] init__r321 = ep32 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L143] COND TRUE !(init__r121 == 0) [L145] init__tmp = 1 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L147] init__r122 = (_Bool)init__tmp VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L148] COND FALSE !(!(init__r131 == 0)) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L2218] COND TRUE !(init__r121 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r122=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L2220] COND TRUE !(ep23 == 0) [L2222] init__tmp___0 = 1 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L152] init__r132 = (_Bool)init__tmp___0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L153] COND FALSE !(!(init__r211 == 0)) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L2195] COND TRUE !(init__r231 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L2197] COND TRUE !(ep31 == 0) [L2199] init__tmp___1 = 1 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L157] init__r212 = (_Bool)init__tmp___1 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L158] COND TRUE !(init__r231 == 0) [L160] init__tmp___2 = 1 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L162] init__r232 = (_Bool)init__tmp___2 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L163] COND TRUE !(init__r311 == 0) [L165] init__tmp___3 = 1 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L167] init__r312 = (_Bool)init__tmp___3 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L168] COND FALSE !(!(init__r321 == 0)) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L2126] COND TRUE !(init__r311 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L2128] COND TRUE !(ep12 == 0) [L2130] init__tmp___4 = 1 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L172] init__r322 = (_Bool)init__tmp___4 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)id1) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)id2) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L183] COND TRUE ((int)id3) >= 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L185] COND TRUE ((int)r1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, st1=0, st2=0, st3=0] [L187] COND TRUE ((int)r2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)r3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r122 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, 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=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE !(init__r132 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, init__r212=1, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE !(init__r212 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, init__r232=1, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE !(init__r232 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE !(init__r312 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, init__r322=1, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE !(init__r322 == 0) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)st1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)st2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)st3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)nl1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)nl2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)nl3) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE ((int)mode1) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE ((int)mode2) == 0 VAL [__return_1719=0, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L225] COND TRUE ((int)mode3) == 0 [L227] init__tmp___5 = 1 [L228] __return_1719 = init__tmp___5 [L229] main__i2 = __return_1719 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, main__i2=1, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE main__i2 != 0 [L232] p12_old = nomsg [L233] p12_new = nomsg [L234] p13_old = nomsg [L235] p13_new = nomsg [L236] p21_old = nomsg [L237] p21_new = nomsg [L238] p23_old = nomsg [L239] p23_new = nomsg [L240] p31_old = nomsg [L241] p31_new = nomsg [L242] p32_old = nomsg [L243] p32_new = nomsg [L244] main__i2 = 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L246] COND FALSE !(!(mode1 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L252] COND TRUE ((int)r1) < 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND TRUE !(ep12 == 0) [L256] int node1____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L257] COND TRUE max1 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L259] COND TRUE p12_new == nomsg [L261] node1____CPAchecker_TMP_0 = max1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, 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] [L263] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L265] COND FALSE !(!(ep13 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] mode1 = 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L278] COND FALSE !(!(mode2 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L284] COND TRUE ((int)r2) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L286] COND FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L297] COND TRUE !(ep23 == 0) [L299] int node2____CPAchecker_TMP_1; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L300] COND TRUE max2 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, 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] [L302] COND TRUE p23_new == nomsg [L304] node2____CPAchecker_TMP_1 = max2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=5, nomsg=-1, p12=0, p12_new=4, 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] [L306] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L308] mode2 = 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] COND FALSE !(!(mode3 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L316] COND TRUE ((int)r3) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND TRUE !(ep31 == 0) [L320] int node3____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L321] COND TRUE max3 != nomsg VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] [L323] COND TRUE p31_new == nomsg [L325] node3____CPAchecker_TMP_0 = max3 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_0=8, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=8, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L329] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=8, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L340] mode3 = 1 [L341] p12_old = p12_new [L342] p12_new = nomsg [L343] p13_old = p13_new [L344] p13_new = nomsg [L345] p21_old = p21_new [L346] p21_new = nomsg [L347] p23_old = p23_new [L348] p23_new = nomsg [L349] p31_old = p31_new [L350] p31_new = nomsg [L351] p32_old = p32_new [L352] p32_new = nomsg [L354] int check__tmp; VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L361] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L379] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=0, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L381] COND TRUE ((int)r1) < 2 [L383] check__tmp = 1 [L384] __return_1847 = check__tmp [L385] main__c1 = __return_1847 [L387] _Bool __tmp_1; [L388] __tmp_1 = main__c1 [L389] _Bool assert__arg; [L390] assert__arg = __tmp_1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L398] COND TRUE !(mode1 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND FALSE !(r1 == 255) [L406] r1 = r1 + 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=0, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE !(ep31 == 0) [L417] m1 = p31_old [L418] p31_old = nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=0, m3=0, max1=4, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L419] COND TRUE ((int)m1) > ((int)max1) [L421] max1 = m1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=0, m3=0, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L423] COND FALSE !(((int)r1) == 2) [L429] mode1 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=0, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L431] COND TRUE !(mode2 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=0, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, 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] [L433] COND FALSE !(r2 == 255) [L439] r2 = r2 + 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=0, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE !(ep12 == 0) [L442] m2 = p12_old [L443] p12_old = nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L444] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L448] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L456] COND FALSE !(((int)r2) == 2) [L462] mode2 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L464] COND TRUE !(mode3 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=0, st2=0, st3=0] [L466] COND FALSE !(r3 == 255) [L472] r3 = r3 + 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !(!(ep13 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=0, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L481] COND TRUE !(ep23 == 0) [L483] m3 = p23_old [L484] p23_old = nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !(((int)r3) == 2) [L495] mode3 = 0 [L496] p12_old = p12_new [L497] p12_new = nomsg [L498] p13_old = p13_new [L499] p13_new = nomsg [L500] p21_old = p21_new [L501] p21_new = nomsg [L502] p23_old = p23_new [L503] p23_new = nomsg [L504] p31_old = p31_new [L505] p31_new = nomsg [L506] p32_old = p32_new [L507] p32_new = nomsg [L509] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L514] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L516] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L524] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L526] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L528] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L534] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=0, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L536] COND TRUE ((int)r1) < 2 [L538] check__tmp = 1 [L539] __return_1965 = check__tmp [L540] main__c1 = __return_1965 [L542] _Bool __tmp_2; [L543] __tmp_2 = main__c1 [L544] _Bool assert__arg; [L545] assert__arg = __tmp_2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L546] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L553] COND FALSE !(!(mode1 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] COND FALSE !(((int)r1) < 1) [L565] mode1 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-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=0, st2=0, st3=0] [L567] COND FALSE !(!(mode2 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-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=0, st2=0, st3=0] [L573] COND TRUE ((int)r2) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-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=0, st2=0, st3=0] [L575] COND FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-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=0, st2=0, st3=0] [L586] COND TRUE !(ep23 == 0) [L588] int node2____CPAchecker_TMP_1; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-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=0, st2=0, st3=0] [L589] COND TRUE max2 != nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-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=0, st2=0, st3=0] [L591] COND TRUE p23_new == nomsg [L593] node2____CPAchecker_TMP_1 = max2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_1=5, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L595] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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=0, st2=0, st3=0] [L597] mode2 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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=0, st2=0, st3=0] [L599] COND FALSE !(!(mode3 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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=0, st2=0, st3=0] [L605] COND TRUE ((int)r3) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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=0, st2=0, st3=0] [L607] COND TRUE !(ep31 == 0) [L609] int node3____CPAchecker_TMP_0; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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=0, st2=0, st3=0] [L610] COND TRUE max3 != nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, 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=0, st2=0, st3=0] [L612] COND TRUE p31_new == nomsg [L614] node3____CPAchecker_TMP_0 = max3 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_0=8, 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=5, 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=0, st2=0, st3=0] [L616] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=8, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L618] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=5, p23_old=-1, p31=0, p31_new=8, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L629] mode3 = 1 [L630] p12_old = p12_new [L631] p12_new = nomsg [L632] p13_old = p13_new [L633] p13_new = nomsg [L634] p21_old = p21_new [L635] p21_new = nomsg [L636] p23_old = p23_new [L637] p23_new = nomsg [L638] p31_old = p31_new [L639] p31_new = nomsg [L640] p32_old = p32_new [L641] p32_new = nomsg [L643] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L644] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L646] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L648] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L650] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L652] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L658] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L660] COND TRUE ((int)r1) < 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L662] COND FALSE !(((int)r1) >= 2) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L668] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=0, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L670] COND TRUE ((int)r1) < 2 [L672] check__tmp = 1 [L673] __return_2067 = check__tmp [L674] main__c1 = __return_2067 [L676] _Bool __tmp_3; [L677] __tmp_3 = main__c1 [L678] _Bool assert__arg; [L679] assert__arg = __tmp_3 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, assert__arg=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L680] COND FALSE !(assert__arg == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L687] COND TRUE !(mode1 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L689] COND FALSE !(r1 == 255) [L695] r1 = r1 + 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L696] COND FALSE !(!(ep21 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=8, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L704] COND TRUE !(ep31 == 0) [L706] m1 = p31_old [L707] p31_old = nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L708] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L712] COND TRUE ((int)r1) == 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L714] COND FALSE !(((int)max1) == ((int)id1)) [L1521] nl1 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=1, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L718] mode1 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L720] COND TRUE !(mode2 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=1, r3=1, st1=0, st2=0, st3=0] [L722] COND FALSE !(r2 == 255) [L728] r2 = r2 + 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=4, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L729] COND TRUE !(ep12 == 0) [L731] m2 = p12_old [L732] p12_old = nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L733] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L737] COND FALSE !(!(ep32 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L745] COND TRUE ((int)r2) == 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=0, st3=0] [L747] COND TRUE ((int)max2) == ((int)id2) [L749] st2 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=1, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L751] mode2 = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L753] COND TRUE !(mode3 == 0) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=1, st1=0, st2=1, st3=0] [L755] COND FALSE !(r3 == 255) [L761] r3 = r3 + 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L762] COND FALSE !(!(ep13 == 0)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=5, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L770] COND TRUE !(ep23 == 0) [L772] m3 = p23_old [L773] p23_old = nomsg VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L774] COND FALSE !(((int)m3) > ((int)max3)) VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L778] COND TRUE ((int)r3) == 2 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=0] [L780] COND TRUE ((int)max3) == ((int)id3) [L782] st3 = 1 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=1, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L784] mode3 = 0 [L785] p12_old = p12_new [L786] p12_new = nomsg [L787] p13_old = p13_new [L788] p13_new = nomsg [L789] p21_old = p21_new [L790] p21_new = nomsg [L791] p23_old = p23_new [L792] p23_new = nomsg [L793] p31_old = p31_new [L794] p31_new = nomsg [L795] p32_old = p32_new [L796] p32_new = nomsg [L798] int check__tmp; VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L799] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L1438] check__tmp = 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L827] __return_2190 = check__tmp [L828] main__c1 = __return_2190 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, main__c1=0, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L831] _Bool __tmp_4; [L832] __tmp_4 = main__c1 [L833] _Bool assert__arg; [L834] assert__arg = __tmp_4 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, assert__arg=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L835] COND TRUE assert__arg == 0 VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L837] reach_error() VAL [__return_1719=1, __return_1847=1, __return_1965=1, __return_2067=1, __return_2190=0, __return_2300=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=5, id3=8, init__r211=0, m1=8, m2=-1, m3=5, max1=8, max2=5, max3=8, mode1=0, mode2=0, mode3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 301 locations, 535 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23276 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23276 mSDsluCounter, 38701 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25627 mSDsCounter, 483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2999 IncrementalHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 483 mSolverCounterUnsat, 13074 mSDtfsCounter, 2999 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63640occurred in iteration=24, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 65724 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3932 NumberOfCodeBlocks, 3932 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3738 ConstructedInterpolants, 0 QuantifiedInterpolants, 11682 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-08 06:12:55,820 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