/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:55:38,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:55:38,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 09:55:38,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:55:38,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:55:38,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:55:38,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:55:38,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:55:38,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:55:38,734 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:55:38,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:55:38,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:55:38,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:55:38,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:55:38,736 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:55:38,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:55:38,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:55:38,737 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:55:38,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:55:38,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:55:38,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:55:38,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:55:38,739 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:55:38,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:55:38,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:55:38,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:55:38,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:55:38,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:55:38,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:55:38,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:55:38,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:55:38,740 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:55:38,740 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:55:38,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:55:38,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:55:38,741 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:55:38,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:55:38,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:55:38,741 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:55:38,741 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 09:55:38,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:55:38,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:55:38,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:55:38,975 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:55:38,977 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:55:38,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2023-12-25 09:55:40,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:55:40,227 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:55:40,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2023-12-25 09:55:40,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6057090e5/2880a7dcffb04a95a346d81423f69f6c/FLAGa04d26496 [2023-12-25 09:55:40,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6057090e5/2880a7dcffb04a95a346d81423f69f6c [2023-12-25 09:55:40,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:55:40,268 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:55:40,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:55:40,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:55:40,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:55:40,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b02f3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40, skipping insertion in model container [2023-12-25 09:55:40,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,339 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:55:40,496 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2023-12-25 09:55:40,510 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2023-12-25 09:55:40,523 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2023-12-25 09:55:40,538 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2023-12-25 09:55:40,549 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2023-12-25 09:55:40,558 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2023-12-25 09:55:40,569 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2023-12-25 09:55:40,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:55:40,621 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:55:40,666 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2023-12-25 09:55:40,673 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2023-12-25 09:55:40,691 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2023-12-25 09:55:40,698 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2023-12-25 09:55:40,709 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2023-12-25 09:55:40,715 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2023-12-25 09:55:40,724 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2023-12-25 09:55:40,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:55:40,788 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:55:40,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40 WrapperNode [2023-12-25 09:55:40,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:55:40,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:55:40,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:55:40,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:55:40,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,905 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1422 [2023-12-25 09:55:40,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:55:40,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:55:40,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:55:40,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:55:40,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,962 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]. [2023-12-25 09:55:40,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:40,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:41,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:41,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:41,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:41,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:55:41,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:55:41,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:55:41,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:55:41,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (1/1) ... [2023-12-25 09:55:41,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:55:41,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:55:41,094 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) [2023-12-25 09:55:41,113 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 [2023-12-25 09:55:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:55:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:55:41,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:55:41,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:55:41,301 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:55:41,303 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:55:42,101 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:55:42,144 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:55:42,144 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:55:42,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:55:42 BoogieIcfgContainer [2023-12-25 09:55:42,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:55:42,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:55:42,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:55:42,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:55:42,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:55:40" (1/3) ... [2023-12-25 09:55:42,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134926bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:55:42, skipping insertion in model container [2023-12-25 09:55:42,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:40" (2/3) ... [2023-12-25 09:55:42,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134926bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:55:42, skipping insertion in model container [2023-12-25 09:55:42,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:55:42" (3/3) ... [2023-12-25 09:55:42,153 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2023-12-25 09:55:42,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:55:42,166 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-25 09:55:42,218 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:55:42,223 INFO L357 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, mHoare=true, 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;@344004d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:55:42,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-25 09:55:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 277 states, 269 states have (on average 1.7992565055762082) internal successors, (484), 276 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 09:55:42,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:42,239 INFO L195 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] [2023-12-25 09:55:42,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:42,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1191779176, now seen corresponding path program 1 times [2023-12-25 09:55:42,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:42,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646315842] [2023-12-25 09:55:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:42,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:42,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:42,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 09:55:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:42,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:55:42,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:42,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:42,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:42,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646315842] [2023-12-25 09:55:42,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646315842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:42,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:42,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:55:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976462586] [2023-12-25 09:55:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:42,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:55:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:42,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:55:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:55:42,682 INFO L87 Difference]: Start difference. First operand has 277 states, 269 states have (on average 1.7992565055762082) internal successors, (484), 276 states have internal predecessors, (484), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:42,984 INFO L93 Difference]: Finished difference Result 387 states and 655 transitions. [2023-12-25 09:55:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:55:42,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-12-25 09:55:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:42,993 INFO L225 Difference]: With dead ends: 387 [2023-12-25 09:55:42,993 INFO L226 Difference]: Without dead ends: 243 [2023-12-25 09:55:42,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:55:42,998 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 762 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:42,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 286 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:55:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-25 09:55:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-12-25 09:55:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 236 states have (on average 1.2669491525423728) internal successors, (299), 242 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 299 transitions. [2023-12-25 09:55:43,030 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 299 transitions. Word has length 47 [2023-12-25 09:55:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:43,030 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 299 transitions. [2023-12-25 09:55:43,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 299 transitions. [2023-12-25 09:55:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 09:55:43,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:43,032 INFO L195 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] [2023-12-25 09:55:43,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:43,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:43,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:43,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash 520818139, now seen corresponding path program 1 times [2023-12-25 09:55:43,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:43,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379367719] [2023-12-25 09:55:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:43,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:43,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:43,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:43,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 09:55:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:43,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:55:43,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:43,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:43,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379367719] [2023-12-25 09:55:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379367719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:43,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:43,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:55:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336534152] [2023-12-25 09:55:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:43,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:55:43,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:55:43,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:55:43,455 INFO L87 Difference]: Start difference. First operand 243 states and 299 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:43,579 INFO L93 Difference]: Finished difference Result 311 states and 386 transitions. [2023-12-25 09:55:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:55:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-12-25 09:55:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:43,581 INFO L225 Difference]: With dead ends: 311 [2023-12-25 09:55:43,581 INFO L226 Difference]: Without dead ends: 185 [2023-12-25 09:55:43,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:55:43,582 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 418 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:43,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 142 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:55:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-25 09:55:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-12-25 09:55:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 184 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2023-12-25 09:55:43,589 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 47 [2023-12-25 09:55:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:43,589 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2023-12-25 09:55:43,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2023-12-25 09:55:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 09:55:43,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:43,590 INFO L195 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] [2023-12-25 09:55:43,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:43,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:43,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:43,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:43,795 INFO L85 PathProgramCache]: Analyzing trace with hash 45954227, now seen corresponding path program 1 times [2023-12-25 09:55:43,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:43,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326488134] [2023-12-25 09:55:43,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:43,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:43,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:43,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:43,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 09:55:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:43,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:55:43,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:44,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:44,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326488134] [2023-12-25 09:55:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326488134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:55:44,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161417282] [2023-12-25 09:55:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:44,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:55:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:44,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:55:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:55:44,058 INFO L87 Difference]: Start difference. First operand 185 states and 226 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:44,218 INFO L93 Difference]: Finished difference Result 353 states and 446 transitions. [2023-12-25 09:55:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:55:44,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-12-25 09:55:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:44,219 INFO L225 Difference]: With dead ends: 353 [2023-12-25 09:55:44,219 INFO L226 Difference]: Without dead ends: 250 [2023-12-25 09:55:44,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:55:44,220 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 483 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 197 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 [2023-12-25 09:55:44,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 197 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:55:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-25 09:55:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 225. [2023-12-25 09:55:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.3256880733944953) internal successors, (289), 224 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 289 transitions. [2023-12-25 09:55:44,227 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 289 transitions. Word has length 47 [2023-12-25 09:55:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:44,228 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 289 transitions. [2023-12-25 09:55:44,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 289 transitions. [2023-12-25 09:55:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:55:44,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:44,229 INFO L195 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] [2023-12-25 09:55:44,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:44,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:44,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:44,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1209610819, now seen corresponding path program 1 times [2023-12-25 09:55:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:44,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227102558] [2023-12-25 09:55:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:44,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:44,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 09:55:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:44,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 09:55:44,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:44,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:44,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:44,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227102558] [2023-12-25 09:55:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227102558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:44,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:44,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 09:55:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355732869] [2023-12-25 09:55:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:44,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 09:55:44,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:44,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 09:55:44,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 09:55:44,807 INFO L87 Difference]: Start difference. First operand 225 states and 289 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:45,113 INFO L93 Difference]: Finished difference Result 353 states and 465 transitions. [2023-12-25 09:55:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 09:55:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2023-12-25 09:55:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:45,115 INFO L225 Difference]: With dead ends: 353 [2023-12-25 09:55:45,115 INFO L226 Difference]: Without dead ends: 225 [2023-12-25 09:55:45,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-25 09:55:45,116 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 694 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:45,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 241 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:55:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-25 09:55:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2023-12-25 09:55:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.3211009174311927) internal successors, (288), 224 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2023-12-25 09:55:45,121 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 49 [2023-12-25 09:55:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:45,121 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2023-12-25 09:55:45,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2023-12-25 09:55:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:55:45,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:45,122 INFO L195 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] [2023-12-25 09:55:45,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:45,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:45,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:45,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash 754421757, now seen corresponding path program 1 times [2023-12-25 09:55:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:45,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818851015] [2023-12-25 09:55:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:45,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:45,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:45,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 09:55:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:45,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:55:45,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:45,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:45,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818851015] [2023-12-25 09:55:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818851015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:55:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515867889] [2023-12-25 09:55:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:45,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:55:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:45,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:55:45,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:55:45,713 INFO L87 Difference]: Start difference. First operand 225 states and 288 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:46,252 INFO L93 Difference]: Finished difference Result 315 states and 419 transitions. [2023-12-25 09:55:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 09:55:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2023-12-25 09:55:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:46,254 INFO L225 Difference]: With dead ends: 315 [2023-12-25 09:55:46,254 INFO L226 Difference]: Without dead ends: 309 [2023-12-25 09:55:46,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-25 09:55:46,255 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 496 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:46,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 520 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:55:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-25 09:55:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 225. [2023-12-25 09:55:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.31651376146789) internal successors, (287), 224 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 287 transitions. [2023-12-25 09:55:46,259 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 287 transitions. Word has length 49 [2023-12-25 09:55:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:46,260 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 287 transitions. [2023-12-25 09:55:46,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 287 transitions. [2023-12-25 09:55:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:55:46,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:46,260 INFO L195 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] [2023-12-25 09:55:46,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 09:55:46,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:46,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:46,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash -175435075, now seen corresponding path program 1 times [2023-12-25 09:55:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:46,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602215229] [2023-12-25 09:55:46,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:46,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:46,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:46,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:46,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 09:55:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:46,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:55:46,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:46,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:46,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602215229] [2023-12-25 09:55:46,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602215229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:46,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:46,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:55:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455136943] [2023-12-25 09:55:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:46,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:55:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:46,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:55:46,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:55:46,848 INFO L87 Difference]: Start difference. First operand 225 states and 287 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:47,416 INFO L93 Difference]: Finished difference Result 439 states and 585 transitions. [2023-12-25 09:55:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:55:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2023-12-25 09:55:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:47,417 INFO L225 Difference]: With dead ends: 439 [2023-12-25 09:55:47,417 INFO L226 Difference]: Without dead ends: 336 [2023-12-25 09:55:47,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:55:47,418 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 967 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:47,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 490 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:55:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-12-25 09:55:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 225. [2023-12-25 09:55:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.311926605504587) internal successors, (286), 224 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 286 transitions. [2023-12-25 09:55:47,422 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 286 transitions. Word has length 49 [2023-12-25 09:55:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:47,423 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 286 transitions. [2023-12-25 09:55:47,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 286 transitions. [2023-12-25 09:55:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:55:47,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:47,423 INFO L195 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] [2023-12-25 09:55:47,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:47,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:47,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:47,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1893856322, now seen corresponding path program 1 times [2023-12-25 09:55:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663243583] [2023-12-25 09:55:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:47,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:47,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 09:55:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:47,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:55:47,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:48,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:48,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663243583] [2023-12-25 09:55:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663243583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:48,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-25 09:55:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156930833] [2023-12-25 09:55:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:48,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 09:55:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 09:55:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:55:48,351 INFO L87 Difference]: Start difference. First operand 225 states and 286 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:48,751 INFO L93 Difference]: Finished difference Result 309 states and 412 transitions. [2023-12-25 09:55:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 09:55:48,754 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2023-12-25 09:55:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:48,755 INFO L225 Difference]: With dead ends: 309 [2023-12-25 09:55:48,755 INFO L226 Difference]: Without dead ends: 189 [2023-12-25 09:55:48,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:55:48,756 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 180 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:48,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 765 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:55:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-25 09:55:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2023-12-25 09:55:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.318918918918919) internal successors, (244), 188 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 244 transitions. [2023-12-25 09:55:48,759 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 244 transitions. Word has length 50 [2023-12-25 09:55:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:48,759 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 244 transitions. [2023-12-25 09:55:48,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 244 transitions. [2023-12-25 09:55:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 09:55:48,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:48,765 INFO L195 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] [2023-12-25 09:55:48,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:48,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:48,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:48,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash 883237538, now seen corresponding path program 1 times [2023-12-25 09:55:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079181867] [2023-12-25 09:55:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:48,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:48,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:48,970 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:48,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 09:55:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:49,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 09:55:49,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:50,177 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:50,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079181867] [2023-12-25 09:55:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079181867] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:50,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:50,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-25 09:55:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769403727] [2023-12-25 09:55:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:50,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:55:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:50,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:55:50,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:55:50,178 INFO L87 Difference]: Start difference. First operand 189 states and 244 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:50,947 INFO L93 Difference]: Finished difference Result 206 states and 262 transitions. [2023-12-25 09:55:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 09:55:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2023-12-25 09:55:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:50,948 INFO L225 Difference]: With dead ends: 206 [2023-12-25 09:55:50,948 INFO L226 Difference]: Without dead ends: 189 [2023-12-25 09:55:50,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:55:50,950 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 196 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:50,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 978 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:55:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-25 09:55:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2023-12-25 09:55:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.3135135135135134) internal successors, (243), 188 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 243 transitions. [2023-12-25 09:55:50,953 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 243 transitions. Word has length 51 [2023-12-25 09:55:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:50,953 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 243 transitions. [2023-12-25 09:55:50,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2023-12-25 09:55:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 09:55:50,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:50,954 INFO L195 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] [2023-12-25 09:55:50,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:51,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:51,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:51,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash -715181555, now seen corresponding path program 1 times [2023-12-25 09:55:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:51,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951880623] [2023-12-25 09:55:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:51,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:51,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:51,159 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 09:55:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:51,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:55:51,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:52,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:52,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951880623] [2023-12-25 09:55:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951880623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:52,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-25 09:55:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002106182] [2023-12-25 09:55:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:52,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:55:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:55:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:55:52,659 INFO L87 Difference]: Start difference. First operand 189 states and 243 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:53,444 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2023-12-25 09:55:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 09:55:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2023-12-25 09:55:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:53,446 INFO L225 Difference]: With dead ends: 189 [2023-12-25 09:55:53,446 INFO L226 Difference]: Without dead ends: 172 [2023-12-25 09:55:53,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2023-12-25 09:55:53,447 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 143 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:53,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 922 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:55:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-25 09:55:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-12-25 09:55:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 171 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2023-12-25 09:55:53,450 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 52 [2023-12-25 09:55:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:53,450 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2023-12-25 09:55:53,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2023-12-25 09:55:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:55:53,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:53,451 INFO L195 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] [2023-12-25 09:55:53,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:53,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:53,653 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:53,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1523929374, now seen corresponding path program 1 times [2023-12-25 09:55:53,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:53,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634901759] [2023-12-25 09:55:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:53,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:53,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:53,662 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:53,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 09:55:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:53,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:55:53,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:54,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:54,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:54,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634901759] [2023-12-25 09:55:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634901759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:54,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:54,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:55:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74704543] [2023-12-25 09:55:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:54,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:55:54,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:54,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:55:54,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:55:54,027 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:54,415 INFO L93 Difference]: Finished difference Result 298 states and 395 transitions. [2023-12-25 09:55:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:55:54,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2023-12-25 09:55:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:54,417 INFO L225 Difference]: With dead ends: 298 [2023-12-25 09:55:54,417 INFO L226 Difference]: Without dead ends: 180 [2023-12-25 09:55:54,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:55:54,418 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 547 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:54,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 277 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:55:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-25 09:55:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2023-12-25 09:55:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.3058823529411765) internal successors, (222), 171 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2023-12-25 09:55:54,421 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 53 [2023-12-25 09:55:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:54,421 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2023-12-25 09:55:54,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2023-12-25 09:55:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 09:55:54,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:54,422 INFO L195 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] [2023-12-25 09:55:54,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 09:55:54,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:54,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:54,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1353414343, now seen corresponding path program 1 times [2023-12-25 09:55:54,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:54,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234892214] [2023-12-25 09:55:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:54,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:54,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:54,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:54,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 09:55:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:54,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 09:55:54,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:56,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:56,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:56,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234892214] [2023-12-25 09:55:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234892214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:56,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:56,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-25 09:55:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853063806] [2023-12-25 09:55:56,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:56,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:55:56,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:55:56,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:55:56,320 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:59,360 INFO L93 Difference]: Finished difference Result 369 states and 505 transitions. [2023-12-25 09:55:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 09:55:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-12-25 09:55:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:59,362 INFO L225 Difference]: With dead ends: 369 [2023-12-25 09:55:59,362 INFO L226 Difference]: Without dead ends: 271 [2023-12-25 09:55:59,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2023-12-25 09:55:59,363 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 307 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:59,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 991 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-25 09:55:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-25 09:55:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 179. [2023-12-25 09:55:59,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.2994350282485876) internal successors, (230), 178 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2023-12-25 09:55:59,366 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 55 [2023-12-25 09:55:59,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:59,367 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2023-12-25 09:55:59,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2023-12-25 09:55:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 09:55:59,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:59,367 INFO L195 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] [2023-12-25 09:55:59,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:59,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:59,568 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:55:59,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1713847366, now seen corresponding path program 1 times [2023-12-25 09:55:59,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:59,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055233508] [2023-12-25 09:55:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:59,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:59,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:59,571 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:59,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 09:55:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:59,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:55:59,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:00,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:00,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055233508] [2023-12-25 09:56:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055233508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:00,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 09:56:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948324806] [2023-12-25 09:56:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:00,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:56:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:00,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:56:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:56:00,033 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:00,400 INFO L93 Difference]: Finished difference Result 286 states and 382 transitions. [2023-12-25 09:56:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:56:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2023-12-25 09:56:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:00,403 INFO L225 Difference]: With dead ends: 286 [2023-12-25 09:56:00,403 INFO L226 Difference]: Without dead ends: 280 [2023-12-25 09:56:00,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-25 09:56:00,404 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 483 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:00,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 646 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-25 09:56:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 172. [2023-12-25 09:56:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.2982456140350878) internal successors, (222), 171 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2023-12-25 09:56:00,408 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 56 [2023-12-25 09:56:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:00,408 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2023-12-25 09:56:00,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2023-12-25 09:56:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-25 09:56:00,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:00,408 INFO L195 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] [2023-12-25 09:56:00,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:00,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,612 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:00,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 51586787, now seen corresponding path program 1 times [2023-12-25 09:56:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091108282] [2023-12-25 09:56:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:00,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:00,614 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:00,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 09:56:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:00,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:00,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:00,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:00,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:00,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091108282] [2023-12-25 09:56:00,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091108282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:00,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:00,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:56:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916351408] [2023-12-25 09:56:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:00,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:56:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:56:00,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:56:00,965 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:01,268 INFO L93 Difference]: Finished difference Result 270 states and 362 transitions. [2023-12-25 09:56:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 09:56:01,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-12-25 09:56:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:01,269 INFO L225 Difference]: With dead ends: 270 [2023-12-25 09:56:01,269 INFO L226 Difference]: Without dead ends: 172 [2023-12-25 09:56:01,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-25 09:56:01,270 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 332 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:01,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 215 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-25 09:56:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-12-25 09:56:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.280701754385965) internal successors, (219), 171 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2023-12-25 09:56:01,272 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 74 [2023-12-25 09:56:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:01,273 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2023-12-25 09:56:01,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2023-12-25 09:56:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 09:56:01,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:01,276 INFO L195 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] [2023-12-25 09:56:01,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:01,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:01,478 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:01,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1552934990, now seen corresponding path program 1 times [2023-12-25 09:56:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729947193] [2023-12-25 09:56:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:01,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:01,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:01,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:01,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 09:56:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:01,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:01,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:01,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:01,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729947193] [2023-12-25 09:56:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729947193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:01,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:01,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145073551] [2023-12-25 09:56:01,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:01,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:01,593 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:01,607 INFO L93 Difference]: Finished difference Result 324 states and 446 transitions. [2023-12-25 09:56:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-12-25 09:56:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:01,609 INFO L225 Difference]: With dead ends: 324 [2023-12-25 09:56:01,609 INFO L226 Difference]: Without dead ends: 240 [2023-12-25 09:56:01,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:01,610 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 71 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:01,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 246 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-25 09:56:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2023-12-25 09:56:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.3375527426160339) internal successors, (317), 237 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 317 transitions. [2023-12-25 09:56:01,613 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 317 transitions. Word has length 77 [2023-12-25 09:56:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:01,614 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 317 transitions. [2023-12-25 09:56:01,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 317 transitions. [2023-12-25 09:56:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-25 09:56:01,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:01,614 INFO L195 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] [2023-12-25 09:56:01,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:01,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:01,817 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:01,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 831977391, now seen corresponding path program 1 times [2023-12-25 09:56:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:01,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433617533] [2023-12-25 09:56:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:01,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:01,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:01,819 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:01,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 09:56:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:01,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:01,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:01,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:01,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433617533] [2023-12-25 09:56:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433617533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:01,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237821705] [2023-12-25 09:56:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:01,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:01,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:01,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:01,947 INFO L87 Difference]: Start difference. First operand 238 states and 317 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:01,960 INFO L93 Difference]: Finished difference Result 506 states and 717 transitions. [2023-12-25 09:56:01,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2023-12-25 09:56:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:01,962 INFO L225 Difference]: With dead ends: 506 [2023-12-25 09:56:01,962 INFO L226 Difference]: Without dead ends: 356 [2023-12-25 09:56:01,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:01,962 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 63 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:01,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 249 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:01,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-12-25 09:56:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2023-12-25 09:56:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.3824362606232294) internal successors, (488), 353 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 488 transitions. [2023-12-25 09:56:01,971 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 488 transitions. Word has length 78 [2023-12-25 09:56:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:01,971 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 488 transitions. [2023-12-25 09:56:01,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 488 transitions. [2023-12-25 09:56:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 09:56:01,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:01,972 INFO L195 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] [2023-12-25 09:56:01,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-25 09:56:02,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:02,176 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:02,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2093136230, now seen corresponding path program 1 times [2023-12-25 09:56:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894997887] [2023-12-25 09:56:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:02,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:02,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:02,178 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:02,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 09:56:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:02,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:02,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:02,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:02,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894997887] [2023-12-25 09:56:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894997887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:02,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:02,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702445698] [2023-12-25 09:56:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:02,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:02,306 INFO L87 Difference]: Start difference. First operand 354 states and 488 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:02,321 INFO L93 Difference]: Finished difference Result 822 states and 1182 transitions. [2023-12-25 09:56:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2023-12-25 09:56:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:02,323 INFO L225 Difference]: With dead ends: 822 [2023-12-25 09:56:02,323 INFO L226 Difference]: Without dead ends: 556 [2023-12-25 09:56:02,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:02,327 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:02,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 251 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-12-25 09:56:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2023-12-25 09:56:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.406871609403255) internal successors, (778), 553 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 778 transitions. [2023-12-25 09:56:02,340 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 778 transitions. Word has length 79 [2023-12-25 09:56:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:02,340 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 778 transitions. [2023-12-25 09:56:02,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 778 transitions. [2023-12-25 09:56:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-25 09:56:02,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:02,341 INFO L195 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] [2023-12-25 09:56:02,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:02,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:02,544 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:02,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1279558341, now seen corresponding path program 1 times [2023-12-25 09:56:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986826998] [2023-12-25 09:56:02,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:02,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:02,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:02,546 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:02,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 09:56:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:02,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:02,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:02,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:02,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986826998] [2023-12-25 09:56:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986826998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:02,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869278377] [2023-12-25 09:56:02,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:02,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:02,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:02,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:02,946 INFO L87 Difference]: Start difference. First operand 554 states and 778 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:03,003 INFO L93 Difference]: Finished difference Result 2418 states and 3518 transitions. [2023-12-25 09:56:03,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:03,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2023-12-25 09:56:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:03,009 INFO L225 Difference]: With dead ends: 2418 [2023-12-25 09:56:03,009 INFO L226 Difference]: Without dead ends: 1952 [2023-12-25 09:56:03,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:03,010 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 220 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:03,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 308 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2023-12-25 09:56:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1482. [2023-12-25 09:56:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1481 states have (on average 1.4166103983794733) internal successors, (2098), 1481 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2098 transitions. [2023-12-25 09:56:03,032 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2098 transitions. Word has length 80 [2023-12-25 09:56:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:03,032 INFO L495 AbstractCegarLoop]: Abstraction has 1482 states and 2098 transitions. [2023-12-25 09:56:03,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2098 transitions. [2023-12-25 09:56:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 09:56:03,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:03,034 INFO L195 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] [2023-12-25 09:56:03,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:03,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:03,237 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:03,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1853594165, now seen corresponding path program 1 times [2023-12-25 09:56:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:03,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44180873] [2023-12-25 09:56:03,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:03,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:03,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:03,239 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:03,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 09:56:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:03,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:56:03,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:03,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:03,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44180873] [2023-12-25 09:56:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44180873] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3219702] [2023-12-25 09:56:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:03,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:56:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:56:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:56:03,421 INFO L87 Difference]: Start difference. First operand 1482 states and 2098 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:03,451 INFO L93 Difference]: Finished difference Result 3548 states and 5050 transitions. [2023-12-25 09:56:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 09:56:03,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2023-12-25 09:56:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:03,457 INFO L225 Difference]: With dead ends: 3548 [2023-12-25 09:56:03,457 INFO L226 Difference]: Without dead ends: 2154 [2023-12-25 09:56:03,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:56:03,459 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 39 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:03,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 328 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2023-12-25 09:56:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2152. [2023-12-25 09:56:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2151 states have (on average 1.396559739655974) internal successors, (3004), 2151 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3004 transitions. [2023-12-25 09:56:03,490 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3004 transitions. Word has length 82 [2023-12-25 09:56:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:03,491 INFO L495 AbstractCegarLoop]: Abstraction has 2152 states and 3004 transitions. [2023-12-25 09:56:03,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3004 transitions. [2023-12-25 09:56:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-25 09:56:03,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:03,491 INFO L195 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] [2023-12-25 09:56:03,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:03,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:03,695 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:03,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash 46513453, now seen corresponding path program 1 times [2023-12-25 09:56:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013684557] [2023-12-25 09:56:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:03,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:03,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:03,697 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:03,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 09:56:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:03,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:56:03,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:03,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:03,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:03,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013684557] [2023-12-25 09:56:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013684557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:03,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:03,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:03,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362931819] [2023-12-25 09:56:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:03,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:03,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:03,806 INFO L87 Difference]: Start difference. First operand 2152 states and 3004 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:03,856 INFO L93 Difference]: Finished difference Result 4090 states and 5652 transitions. [2023-12-25 09:56:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 09:56:03,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2023-12-25 09:56:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:03,866 INFO L225 Difference]: With dead ends: 4090 [2023-12-25 09:56:03,866 INFO L226 Difference]: Without dead ends: 4088 [2023-12-25 09:56:03,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:56:03,868 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 204 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:03,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 489 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2023-12-25 09:56:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 2320. [2023-12-25 09:56:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2319 states have (on average 1.364381198792583) internal successors, (3164), 2319 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3164 transitions. [2023-12-25 09:56:03,941 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3164 transitions. Word has length 83 [2023-12-25 09:56:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:03,941 INFO L495 AbstractCegarLoop]: Abstraction has 2320 states and 3164 transitions. [2023-12-25 09:56:03,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3164 transitions. [2023-12-25 09:56:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 09:56:03,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:03,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:03,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:04,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:04,143 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:04,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 824299221, now seen corresponding path program 1 times [2023-12-25 09:56:04,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:04,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84793667] [2023-12-25 09:56:04,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:04,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:04,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:04,145 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:04,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 09:56:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:04,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:04,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:04,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:05,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:05,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84793667] [2023-12-25 09:56:05,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84793667] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:05,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:05,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:56:05,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592111091] [2023-12-25 09:56:05,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:05,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:56:05,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:05,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:56:05,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:56:05,048 INFO L87 Difference]: Start difference. First operand 2320 states and 3164 transitions. Second operand has 16 states, 16 states have (on average 11.9375) internal successors, (191), 15 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:06,684 INFO L93 Difference]: Finished difference Result 7408 states and 10035 transitions. [2023-12-25 09:56:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-25 09:56:06,685 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.9375) internal successors, (191), 15 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-25 09:56:06,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:06,697 INFO L225 Difference]: With dead ends: 7408 [2023-12-25 09:56:06,697 INFO L226 Difference]: Without dead ends: 5870 [2023-12-25 09:56:06,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 09:56:06,700 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 1052 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:06,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 784 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:56:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2023-12-25 09:56:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 2320. [2023-12-25 09:56:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2319 states have (on average 1.3592065545493748) internal successors, (3152), 2319 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3152 transitions. [2023-12-25 09:56:06,741 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3152 transitions. Word has length 104 [2023-12-25 09:56:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:06,741 INFO L495 AbstractCegarLoop]: Abstraction has 2320 states and 3152 transitions. [2023-12-25 09:56:06,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.9375) internal successors, (191), 15 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3152 transitions. [2023-12-25 09:56:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 09:56:06,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:06,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:06,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:06,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:06,946 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:06,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash -627488043, now seen corresponding path program 1 times [2023-12-25 09:56:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:06,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237940957] [2023-12-25 09:56:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:06,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:06,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:06,948 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:06,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-25 09:56:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:07,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 09:56:07,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:07,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:07,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237940957] [2023-12-25 09:56:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237940957] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:07,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-12-25 09:56:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002371769] [2023-12-25 09:56:07,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:07,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 09:56:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 09:56:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2023-12-25 09:56:07,977 INFO L87 Difference]: Start difference. First operand 2320 states and 3152 transitions. Second operand has 22 states, 22 states have (on average 8.954545454545455) internal successors, (197), 21 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:14,316 INFO L93 Difference]: Finished difference Result 15334 states and 20755 transitions. [2023-12-25 09:56:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-12-25 09:56:14,317 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.954545454545455) internal successors, (197), 21 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-25 09:56:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:14,347 INFO L225 Difference]: With dead ends: 15334 [2023-12-25 09:56:14,347 INFO L226 Difference]: Without dead ends: 13108 [2023-12-25 09:56:14,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3892 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2905, Invalid=9527, Unknown=0, NotChecked=0, Total=12432 [2023-12-25 09:56:14,357 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4917 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4917 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:14,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4917 Valid, 1298 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 09:56:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13108 states. [2023-12-25 09:56:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13108 to 2035. [2023-12-25 09:56:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2034 states have (on average 1.3529990167158308) internal successors, (2752), 2034 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2752 transitions. [2023-12-25 09:56:14,437 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2752 transitions. Word has length 104 [2023-12-25 09:56:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:14,437 INFO L495 AbstractCegarLoop]: Abstraction has 2035 states and 2752 transitions. [2023-12-25 09:56:14,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.954545454545455) internal successors, (197), 21 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2752 transitions. [2023-12-25 09:56:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 09:56:14,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:14,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:14,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:14,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:14,642 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:14,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash -18144646, now seen corresponding path program 1 times [2023-12-25 09:56:14,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:14,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954298568] [2023-12-25 09:56:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:14,644 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:14,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 09:56:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:14,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:14,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:14,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:14,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:14,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954298568] [2023-12-25 09:56:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954298568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:14,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:14,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559068797] [2023-12-25 09:56:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:14,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:14,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:14,778 INFO L87 Difference]: Start difference. First operand 2035 states and 2752 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:14,796 INFO L93 Difference]: Finished difference Result 3639 states and 4958 transitions. [2023-12-25 09:56:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:14,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-12-25 09:56:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:14,799 INFO L225 Difference]: With dead ends: 3639 [2023-12-25 09:56:14,799 INFO L226 Difference]: Without dead ends: 1679 [2023-12-25 09:56:14,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:14,801 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 52 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 244 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 [2023-12-25 09:56:14,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 244 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2023-12-25 09:56:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1670. [2023-12-25 09:56:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.3493109646494907) internal successors, (2252), 1669 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2252 transitions. [2023-12-25 09:56:14,816 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2252 transitions. Word has length 105 [2023-12-25 09:56:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:14,816 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 2252 transitions. [2023-12-25 09:56:14,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2252 transitions. [2023-12-25 09:56:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 09:56:14,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:14,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:14,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:15,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:15,021 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:15,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2004128957, now seen corresponding path program 1 times [2023-12-25 09:56:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:15,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312701073] [2023-12-25 09:56:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:15,022 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:15,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 09:56:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:15,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:56:15,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:15,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:16,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:16,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312701073] [2023-12-25 09:56:16,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312701073] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:16,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:16,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 09:56:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830371514] [2023-12-25 09:56:16,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:16,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 09:56:16,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 09:56:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 09:56:16,152 INFO L87 Difference]: Start difference. First operand 1670 states and 2252 transitions. Second operand has 24 states, 24 states have (on average 8.458333333333334) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:36,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:36,647 INFO L93 Difference]: Finished difference Result 15519 states and 20590 transitions. [2023-12-25 09:56:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 300 states. [2023-12-25 09:56:36,648 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.458333333333334) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-12-25 09:56:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:36,668 INFO L225 Difference]: With dead ends: 15519 [2023-12-25 09:56:36,668 INFO L226 Difference]: Without dead ends: 13945 [2023-12-25 09:56:36,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44638 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=14282, Invalid=89080, Unknown=0, NotChecked=0, Total=103362 [2023-12-25 09:56:36,684 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 6920 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6920 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:36,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6920 Valid, 1293 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 09:56:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13945 states. [2023-12-25 09:56:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13945 to 1754. [2023-12-25 09:56:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1753 states have (on average 1.3394181403308614) internal successors, (2348), 1753 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2348 transitions. [2023-12-25 09:56:36,762 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2348 transitions. Word has length 105 [2023-12-25 09:56:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:36,762 INFO L495 AbstractCegarLoop]: Abstraction has 1754 states and 2348 transitions. [2023-12-25 09:56:36,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.458333333333334) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2348 transitions. [2023-12-25 09:56:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 09:56:36,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:36,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:36,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:36,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:36,967 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:36,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash 792785086, now seen corresponding path program 1 times [2023-12-25 09:56:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:36,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335955846] [2023-12-25 09:56:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:36,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:36,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:36,968 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:37,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-25 09:56:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:37,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:37,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:37,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:37,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335955846] [2023-12-25 09:56:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335955846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709818202] [2023-12-25 09:56:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:37,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:37,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:37,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:37,096 INFO L87 Difference]: Start difference. First operand 1754 states and 2348 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:37,112 INFO L93 Difference]: Finished difference Result 2568 states and 3448 transitions. [2023-12-25 09:56:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:37,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-25 09:56:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:37,114 INFO L225 Difference]: With dead ends: 2568 [2023-12-25 09:56:37,114 INFO L226 Difference]: Without dead ends: 910 [2023-12-25 09:56:37,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:37,115 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 223 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 [2023-12-25 09:56:37,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 223 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2023-12-25 09:56:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 908. [2023-12-25 09:56:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 1.298787210584344) internal successors, (1178), 907 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1178 transitions. [2023-12-25 09:56:37,123 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1178 transitions. Word has length 106 [2023-12-25 09:56:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:37,123 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1178 transitions. [2023-12-25 09:56:37,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1178 transitions. [2023-12-25 09:56:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 09:56:37,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:37,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:37,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:37,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:37,327 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:37,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -534538751, now seen corresponding path program 1 times [2023-12-25 09:56:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361548740] [2023-12-25 09:56:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:37,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:37,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:37,345 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 09:56:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:37,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:37,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 09:56:37,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:37,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361548740] [2023-12-25 09:56:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361548740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:37,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434654151] [2023-12-25 09:56:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:37,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:37,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:37,726 INFO L87 Difference]: Start difference. First operand 908 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:37,777 INFO L93 Difference]: Finished difference Result 1996 states and 2622 transitions. [2023-12-25 09:56:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:37,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-25 09:56:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:37,779 INFO L225 Difference]: With dead ends: 1996 [2023-12-25 09:56:37,779 INFO L226 Difference]: Without dead ends: 1184 [2023-12-25 09:56:37,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:37,780 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 149 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:37,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 412 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2023-12-25 09:56:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 908. [2023-12-25 09:56:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 1.2723263506063947) internal successors, (1154), 907 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1154 transitions. [2023-12-25 09:56:37,787 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1154 transitions. Word has length 106 [2023-12-25 09:56:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:37,788 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1154 transitions. [2023-12-25 09:56:37,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1154 transitions. [2023-12-25 09:56:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 09:56:37,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:37,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:37,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-12-25 09:56:37,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:37,992 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:37,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1965244539, now seen corresponding path program 1 times [2023-12-25 09:56:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:37,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104604824] [2023-12-25 09:56:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:37,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:37,993 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:38,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 09:56:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:38,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:38,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 09:56:38,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:38,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:38,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104604824] [2023-12-25 09:56:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104604824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:38,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856486967] [2023-12-25 09:56:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:38,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:38,352 INFO L87 Difference]: Start difference. First operand 908 states and 1154 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:38,402 INFO L93 Difference]: Finished difference Result 1726 states and 2256 transitions. [2023-12-25 09:56:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:38,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-25 09:56:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:38,404 INFO L225 Difference]: With dead ends: 1726 [2023-12-25 09:56:38,404 INFO L226 Difference]: Without dead ends: 1454 [2023-12-25 09:56:38,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:38,405 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 148 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:38,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 455 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2023-12-25 09:56:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1178. [2023-12-25 09:56:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.2710280373831775) internal successors, (1496), 1177 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1496 transitions. [2023-12-25 09:56:38,414 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1496 transitions. Word has length 106 [2023-12-25 09:56:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:38,414 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1496 transitions. [2023-12-25 09:56:38,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1496 transitions. [2023-12-25 09:56:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 09:56:38,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:38,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:38,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:38,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:38,615 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:38,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash 260903489, now seen corresponding path program 1 times [2023-12-25 09:56:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:38,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609784306] [2023-12-25 09:56:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:38,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:38,633 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:38,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 09:56:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:38,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:38,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 09:56:39,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:39,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609784306] [2023-12-25 09:56:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609784306] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:39,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339157553] [2023-12-25 09:56:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:39,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:39,065 INFO L87 Difference]: Start difference. First operand 1178 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:39,115 INFO L93 Difference]: Finished difference Result 1996 states and 2598 transitions. [2023-12-25 09:56:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:39,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-25 09:56:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:39,117 INFO L225 Difference]: With dead ends: 1996 [2023-12-25 09:56:39,117 INFO L226 Difference]: Without dead ends: 1724 [2023-12-25 09:56:39,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:39,118 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 178 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:39,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 409 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2023-12-25 09:56:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1448. [2023-12-25 09:56:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1447 states have (on average 1.2702142363510711) internal successors, (1838), 1447 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1838 transitions. [2023-12-25 09:56:39,129 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1838 transitions. Word has length 106 [2023-12-25 09:56:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:39,129 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1838 transitions. [2023-12-25 09:56:39,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1838 transitions. [2023-12-25 09:56:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:56:39,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:39,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:39,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:39,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:39,333 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:39,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:39,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1349385958, now seen corresponding path program 1 times [2023-12-25 09:56:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:39,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160463273] [2023-12-25 09:56:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:39,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:39,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:39,335 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:39,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 09:56:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:39,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 09:56:39,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:41,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:42,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:42,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160463273] [2023-12-25 09:56:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160463273] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:42,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2023-12-25 09:56:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222315305] [2023-12-25 09:56:42,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-25 09:56:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-25 09:56:42,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 09:56:42,564 INFO L87 Difference]: Start difference. First operand 1448 states and 1838 transitions. Second operand has 37 states, 37 states have (on average 5.54054054054054) internal successors, (205), 37 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:41,495 INFO L93 Difference]: Finished difference Result 17616 states and 22448 transitions. [2023-12-25 09:57:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2023-12-25 09:57:41,496 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.54054054054054) internal successors, (205), 37 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 09:57:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:41,507 INFO L225 Difference]: With dead ends: 17616 [2023-12-25 09:57:41,507 INFO L226 Difference]: Without dead ends: 16264 [2023-12-25 09:57:41,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19824 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=7564, Invalid=44648, Unknown=0, NotChecked=0, Total=52212 [2023-12-25 09:57:41,512 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 5423 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 3134 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5423 SdHoareTripleChecker+Valid, 4818 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:41,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5423 Valid, 4818 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3134 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-25 09:57:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16264 states. [2023-12-25 09:57:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16264 to 5004. [2023-12-25 09:57:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 5003 states have (on average 1.273236058364981) internal successors, (6370), 5003 states have internal predecessors, (6370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 6370 transitions. [2023-12-25 09:57:41,599 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 6370 transitions. Word has length 107 [2023-12-25 09:57:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:41,599 INFO L495 AbstractCegarLoop]: Abstraction has 5004 states and 6370 transitions. [2023-12-25 09:57:41,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.54054054054054) internal successors, (205), 37 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 6370 transitions. [2023-12-25 09:57:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:57:41,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:41,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:57:41,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-25 09:57:41,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:57:41,804 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:57:41,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1881671217, now seen corresponding path program 1 times [2023-12-25 09:57:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:41,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760842687] [2023-12-25 09:57:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:41,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:57:41,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:41,806 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:57:41,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 09:57:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:41,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 09:57:41,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:42,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:43,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760842687] [2023-12-25 09:57:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760842687] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:43,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:43,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2023-12-25 09:57:43,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498130297] [2023-12-25 09:57:43,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:43,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 09:57:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 09:57:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 09:57:43,686 INFO L87 Difference]: Start difference. First operand 5004 states and 6370 transitions. Second operand has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:29,291 INFO L93 Difference]: Finished difference Result 77272 states and 98465 transitions. [2023-12-25 09:58:29,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 385 states. [2023-12-25 09:58:29,291 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 09:58:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:29,372 INFO L225 Difference]: With dead ends: 77272 [2023-12-25 09:58:29,372 INFO L226 Difference]: Without dead ends: 75243 [2023-12-25 09:58:29,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 409 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72333 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=15346, Invalid=153164, Unknown=0, NotChecked=0, Total=168510 [2023-12-25 09:58:29,407 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 5745 mSDsluCounter, 18128 mSDsCounter, 0 mSdLazyCounter, 7483 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5745 SdHoareTripleChecker+Valid, 19085 SdHoareTripleChecker+Invalid, 7653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 7483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:29,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5745 Valid, 19085 Invalid, 7653 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [170 Valid, 7483 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-12-25 09:58:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75243 states. [2023-12-25 09:58:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75243 to 22780. [2023-12-25 09:58:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22780 states, 22779 states have (on average 1.2812678344088855) internal successors, (29186), 22779 states have internal predecessors, (29186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22780 states to 22780 states and 29186 transitions. [2023-12-25 09:58:30,130 INFO L78 Accepts]: Start accepts. Automaton has 22780 states and 29186 transitions. Word has length 107 [2023-12-25 09:58:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:30,130 INFO L495 AbstractCegarLoop]: Abstraction has 22780 states and 29186 transitions. [2023-12-25 09:58:30,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 22780 states and 29186 transitions. [2023-12-25 09:58:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:58:30,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:30,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:58:30,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-25 09:58:30,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:30,339 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:58:30,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -697146456, now seen corresponding path program 1 times [2023-12-25 09:58:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:30,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844766924] [2023-12-25 09:58:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:30,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:30,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:30,341 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:58:30,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 09:58:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:30,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:58:30,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:30,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:58:30,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:30,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844766924] [2023-12-25 09:58:30,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844766924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:58:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:58:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:58:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312762410] [2023-12-25 09:58:30,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:58:30,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:58:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:58:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:58:30,469 INFO L87 Difference]: Start difference. First operand 22780 states and 29186 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:30,533 INFO L93 Difference]: Finished difference Result 35008 states and 44866 transitions. [2023-12-25 09:58:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:58:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 09:58:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:30,545 INFO L225 Difference]: With dead ends: 35008 [2023-12-25 09:58:30,545 INFO L226 Difference]: Without dead ends: 13613 [2023-12-25 09:58:30,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:58:30,559 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 203 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 [2023-12-25 09:58:30,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 203 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:58:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13613 states. [2023-12-25 09:58:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13613 to 11039. [2023-12-25 09:58:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11039 states, 11038 states have (on average 1.2536691429606812) internal successors, (13838), 11038 states have internal predecessors, (13838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11039 states to 11039 states and 13838 transitions. [2023-12-25 09:58:30,659 INFO L78 Accepts]: Start accepts. Automaton has 11039 states and 13838 transitions. Word has length 107 [2023-12-25 09:58:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:30,659 INFO L495 AbstractCegarLoop]: Abstraction has 11039 states and 13838 transitions. [2023-12-25 09:58:30,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 11039 states and 13838 transitions. [2023-12-25 09:58:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:58:30,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:30,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:58:30,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 09:58:30,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:30,865 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:58:30,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1389955653, now seen corresponding path program 1 times [2023-12-25 09:58:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:30,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926093614] [2023-12-25 09:58:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:30,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:30,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:30,867 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:58:30,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 09:58:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:30,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 09:58:30,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:33,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:34,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926093614] [2023-12-25 09:58:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926093614] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:34,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:34,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2023-12-25 09:58:34,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158482841] [2023-12-25 09:58:34,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:34,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:58:34,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:34,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:58:34,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:58:34,260 INFO L87 Difference]: Start difference. First operand 11039 states and 13838 transitions. Second operand has 38 states, 38 states have (on average 5.394736842105263) internal successors, (205), 38 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:01:48,867 INFO L93 Difference]: Finished difference Result 51168 states and 64018 transitions. [2023-12-25 10:01:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 411 states. [2023-12-25 10:01:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.394736842105263) internal successors, (205), 38 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 10:01:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:01:48,918 INFO L225 Difference]: With dead ends: 51168 [2023-12-25 10:01:48,918 INFO L226 Difference]: Without dead ends: 49756 [2023-12-25 10:01:48,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87090 ImplicationChecksByTransitivity, 183.6s TimeCoverageRelationStatistics Valid=17597, Invalid=181765, Unknown=0, NotChecked=0, Total=199362 [2023-12-25 10:01:48,934 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 5017 mSDsluCounter, 8734 mSDsCounter, 0 mSdLazyCounter, 5556 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5017 SdHoareTripleChecker+Valid, 9315 SdHoareTripleChecker+Invalid, 5658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 5556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:01:48,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5017 Valid, 9315 Invalid, 5658 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [102 Valid, 5556 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-12-25 10:01:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49756 states. [2023-12-25 10:01:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49756 to 14451. [2023-12-25 10:01:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14451 states, 14450 states have (on average 1.2531487889273356) internal successors, (18108), 14450 states have internal predecessors, (18108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14451 states to 14451 states and 18108 transitions. [2023-12-25 10:01:49,262 INFO L78 Accepts]: Start accepts. Automaton has 14451 states and 18108 transitions. Word has length 107 [2023-12-25 10:01:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:01:49,262 INFO L495 AbstractCegarLoop]: Abstraction has 14451 states and 18108 transitions. [2023-12-25 10:01:49,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.394736842105263) internal successors, (205), 38 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 14451 states and 18108 transitions. [2023-12-25 10:01:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 10:01:49,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:01:49,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:01:49,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-25 10:01:49,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:49,470 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:01:49,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:01:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash -432033785, now seen corresponding path program 1 times [2023-12-25 10:01:49,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:01:49,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040705228] [2023-12-25 10:01:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:01:49,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:01:49,473 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:01:49,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-25 10:01:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:01:49,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:01:49,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:01:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 10:01:49,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:01:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 10:01:49,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:01:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040705228] [2023-12-25 10:01:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040705228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:01:49,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:01:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 10:01:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226259703] [2023-12-25 10:01:49,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:01:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:01:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:01:49,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:01:49,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:01:49,802 INFO L87 Difference]: Start difference. First operand 14451 states and 18108 transitions. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:01:49,895 INFO L93 Difference]: Finished difference Result 40158 states and 49669 transitions. [2023-12-25 10:01:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:01:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-12-25 10:01:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:01:49,920 INFO L225 Difference]: With dead ends: 40158 [2023-12-25 10:01:49,920 INFO L226 Difference]: Without dead ends: 26676 [2023-12-25 10:01:49,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:01:49,934 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 82 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:01:49,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 573 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:01:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26676 states. [2023-12-25 10:01:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26676 to 19668. [2023-12-25 10:01:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19668 states, 19667 states have (on average 1.2208267656480398) internal successors, (24010), 19667 states have internal predecessors, (24010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19668 states to 19668 states and 24010 transitions. [2023-12-25 10:01:50,262 INFO L78 Accepts]: Start accepts. Automaton has 19668 states and 24010 transitions. Word has length 108 [2023-12-25 10:01:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:01:50,263 INFO L495 AbstractCegarLoop]: Abstraction has 19668 states and 24010 transitions. [2023-12-25 10:01:50,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 19668 states and 24010 transitions. [2023-12-25 10:01:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 10:01:50,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:01:50,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:01:50,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-25 10:01:50,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:50,492 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:01:50,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:01:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1127968153, now seen corresponding path program 1 times [2023-12-25 10:01:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:01:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142057703] [2023-12-25 10:01:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:01:50,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:50,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:01:50,494 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:01:50,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-25 10:01:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:01:50,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 10:01:50,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:01:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:01:51,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:01:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:01:51,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:01:51,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142057703] [2023-12-25 10:01:51,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142057703] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:01:51,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:01:51,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 10:01:51,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616119980] [2023-12-25 10:01:51,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:01:51,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 10:01:51,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:01:51,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 10:01:51,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-25 10:01:51,354 INFO L87 Difference]: Start difference. First operand 19668 states and 24010 transitions. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:01:52,894 INFO L93 Difference]: Finished difference Result 49742 states and 60652 transitions. [2023-12-25 10:01:52,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 10:01:52,895 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-12-25 10:01:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:01:52,921 INFO L225 Difference]: With dead ends: 49742 [2023-12-25 10:01:52,921 INFO L226 Difference]: Without dead ends: 37635 [2023-12-25 10:01:52,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 10:01:52,931 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1826 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:01:52,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 1922 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 10:01:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37635 states. [2023-12-25 10:01:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37635 to 26487. [2023-12-25 10:01:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26487 states, 26486 states have (on average 1.2167560220493845) internal successors, (32227), 26486 states have internal predecessors, (32227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 32227 transitions. [2023-12-25 10:01:53,244 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 32227 transitions. Word has length 108 [2023-12-25 10:01:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:01:53,244 INFO L495 AbstractCegarLoop]: Abstraction has 26487 states and 32227 transitions. [2023-12-25 10:01:53,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 32227 transitions. [2023-12-25 10:01:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 10:01:53,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:01:53,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:01:53,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-25 10:01:53,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:53,451 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:01:53,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:01:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2022337320, now seen corresponding path program 1 times [2023-12-25 10:01:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:01:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558822168] [2023-12-25 10:01:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:01:53,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:53,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:01:53,453 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:01:53,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-25 10:01:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:01:53,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:01:53,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:01:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:01:54,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:01:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:01:54,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:01:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558822168] [2023-12-25 10:01:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558822168] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:01:54,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:01:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 10:01:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374096408] [2023-12-25 10:01:54,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:01:54,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 10:01:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:01:54,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 10:01:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-12-25 10:01:54,641 INFO L87 Difference]: Start difference. First operand 26487 states and 32227 transitions. Second operand has 21 states, 21 states have (on average 9.571428571428571) internal successors, (201), 21 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:01:57,498 INFO L93 Difference]: Finished difference Result 71623 states and 86614 transitions. [2023-12-25 10:01:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-25 10:01:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.571428571428571) internal successors, (201), 21 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-12-25 10:01:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:01:57,557 INFO L225 Difference]: With dead ends: 71623 [2023-12-25 10:01:57,557 INFO L226 Difference]: Without dead ends: 61883 [2023-12-25 10:01:57,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=701, Invalid=2379, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 10:01:57,576 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 1726 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:01:57,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 2707 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 10:01:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61883 states. [2023-12-25 10:01:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61883 to 35901. [2023-12-25 10:01:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35901 states, 35900 states have (on average 1.2139554317548746) internal successors, (43581), 35900 states have internal predecessors, (43581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35901 states to 35901 states and 43581 transitions. [2023-12-25 10:01:58,193 INFO L78 Accepts]: Start accepts. Automaton has 35901 states and 43581 transitions. Word has length 108 [2023-12-25 10:01:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:01:58,194 INFO L495 AbstractCegarLoop]: Abstraction has 35901 states and 43581 transitions. [2023-12-25 10:01:58,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.571428571428571) internal successors, (201), 21 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 35901 states and 43581 transitions. [2023-12-25 10:01:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 10:01:58,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:01:58,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:01:58,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-12-25 10:01:58,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:58,401 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:01:58,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:01:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -867606750, now seen corresponding path program 1 times [2023-12-25 10:01:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:01:58,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048623570] [2023-12-25 10:01:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:01:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:01:58,403 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:01:58,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-25 10:01:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:01:58,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 10:01:58,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:01:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:01:59,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:02:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:02:00,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:02:00,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048623570] [2023-12-25 10:02:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048623570] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:02:00,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:02:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2023-12-25 10:02:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101251570] [2023-12-25 10:02:00,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:02:00,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 10:02:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:02:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 10:02:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2023-12-25 10:02:00,327 INFO L87 Difference]: Start difference. First operand 35901 states and 43581 transitions. Second operand has 29 states, 29 states have (on average 6.758620689655173) internal successors, (196), 29 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:02:16,589 INFO L93 Difference]: Finished difference Result 83195 states and 101373 transitions. [2023-12-25 10:02:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-25 10:02:16,590 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.758620689655173) internal successors, (196), 29 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-12-25 10:02:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:02:16,656 INFO L225 Difference]: With dead ends: 83195 [2023-12-25 10:02:16,656 INFO L226 Difference]: Without dead ends: 65058 [2023-12-25 10:02:16,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3263 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1467, Invalid=9875, Unknown=0, NotChecked=0, Total=11342 [2023-12-25 10:02:16,680 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 3056 mSDsluCounter, 5976 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3056 SdHoareTripleChecker+Valid, 6437 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:02:16,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3056 Valid, 6437 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-25 10:02:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65058 states. [2023-12-25 10:02:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65058 to 42476. [2023-12-25 10:02:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42476 states, 42475 states have (on average 1.2114655679811654) internal successors, (51457), 42475 states have internal predecessors, (51457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42476 states to 42476 states and 51457 transitions. [2023-12-25 10:02:17,261 INFO L78 Accepts]: Start accepts. Automaton has 42476 states and 51457 transitions. Word has length 108 [2023-12-25 10:02:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:02:17,262 INFO L495 AbstractCegarLoop]: Abstraction has 42476 states and 51457 transitions. [2023-12-25 10:02:17,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.758620689655173) internal successors, (196), 29 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42476 states and 51457 transitions. [2023-12-25 10:02:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 10:02:17,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:02:17,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:02:17,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-25 10:02:17,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:17,467 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:02:17,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:02:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 389210544, now seen corresponding path program 1 times [2023-12-25 10:02:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:02:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627850664] [2023-12-25 10:02:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:02:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:02:17,470 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:02:17,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-25 10:02:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:02:17,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:02:17,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:02:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 10:02:17,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:02:17,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:02:17,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627850664] [2023-12-25 10:02:17,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627850664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:02:17,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:02:17,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:02:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480121978] [2023-12-25 10:02:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:02:17,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:02:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:02:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:02:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:02:17,597 INFO L87 Difference]: Start difference. First operand 42476 states and 51457 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:02:17,742 INFO L93 Difference]: Finished difference Result 67381 states and 81705 transitions. [2023-12-25 10:02:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:02:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-25 10:02:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:02:17,767 INFO L225 Difference]: With dead ends: 67381 [2023-12-25 10:02:17,767 INFO L226 Difference]: Without dead ends: 25620 [2023-12-25 10:02:17,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:02:17,813 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 82 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:02:17,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 102 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:02:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25620 states. [2023-12-25 10:02:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25620 to 25532. [2023-12-25 10:02:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25532 states, 25531 states have (on average 1.1849907955035055) internal successors, (30254), 25531 states have internal predecessors, (30254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25532 states to 25532 states and 30254 transitions. [2023-12-25 10:02:18,210 INFO L78 Accepts]: Start accepts. Automaton has 25532 states and 30254 transitions. Word has length 109 [2023-12-25 10:02:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:02:18,210 INFO L495 AbstractCegarLoop]: Abstraction has 25532 states and 30254 transitions. [2023-12-25 10:02:18,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 25532 states and 30254 transitions. [2023-12-25 10:02:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 10:02:18,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:02:18,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:02:18,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-25 10:02:18,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:18,416 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:02:18,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:02:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash 27664774, now seen corresponding path program 1 times [2023-12-25 10:02:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:02:18,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564660382] [2023-12-25 10:02:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:02:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:02:18,536 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:02:18,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-25 10:02:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:02:18,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:02:18,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:02:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 10:02:18,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:02:18,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:02:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564660382] [2023-12-25 10:02:18,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564660382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:02:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:02:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:02:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989866656] [2023-12-25 10:02:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:02:18,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:02:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:02:18,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:02:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:02:18,656 INFO L87 Difference]: Start difference. First operand 25532 states and 30254 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:02:18,754 INFO L93 Difference]: Finished difference Result 38148 states and 45303 transitions. [2023-12-25 10:02:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:02:18,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-25 10:02:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:02:18,768 INFO L225 Difference]: With dead ends: 38148 [2023-12-25 10:02:18,768 INFO L226 Difference]: Without dead ends: 13394 [2023-12-25 10:02:18,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:02:18,781 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 78 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:02:18,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 109 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:02:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13394 states. [2023-12-25 10:02:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13394 to 13292. [2023-12-25 10:02:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13292 states, 13291 states have (on average 1.165450304717478) internal successors, (15490), 13291 states have internal predecessors, (15490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13292 states to 13292 states and 15490 transitions. [2023-12-25 10:02:18,904 INFO L78 Accepts]: Start accepts. Automaton has 13292 states and 15490 transitions. Word has length 109 [2023-12-25 10:02:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:02:18,904 INFO L495 AbstractCegarLoop]: Abstraction has 13292 states and 15490 transitions. [2023-12-25 10:02:18,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13292 states and 15490 transitions. [2023-12-25 10:02:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 10:02:18,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:02:18,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:02:18,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-12-25 10:02:19,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:19,110 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:02:19,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:02:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -53293508, now seen corresponding path program 1 times [2023-12-25 10:02:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:02:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163911331] [2023-12-25 10:02:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:02:19,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:19,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:02:19,112 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:02:19,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-25 10:02:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:02:19,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:02:19,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:02:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 10:02:19,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:02:19,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:02:19,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163911331] [2023-12-25 10:02:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163911331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:02:19,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:02:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:02:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466348919] [2023-12-25 10:02:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:02:19,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:02:19,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:02:19,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:02:19,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:02:19,240 INFO L87 Difference]: Start difference. First operand 13292 states and 15490 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:02:19,306 INFO L93 Difference]: Finished difference Result 24107 states and 28197 transitions. [2023-12-25 10:02:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:02:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-25 10:02:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:02:19,316 INFO L225 Difference]: With dead ends: 24107 [2023-12-25 10:02:19,316 INFO L226 Difference]: Without dead ends: 11243 [2023-12-25 10:02:19,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:02:19,327 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 75 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:02:19,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 116 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:02:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11243 states. [2023-12-25 10:02:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11243 to 11243. [2023-12-25 10:02:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11243 states, 11242 states have (on average 1.1585127201565557) internal successors, (13024), 11242 states have internal predecessors, (13024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 13024 transitions. [2023-12-25 10:02:19,478 INFO L78 Accepts]: Start accepts. Automaton has 11243 states and 13024 transitions. Word has length 109 [2023-12-25 10:02:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:02:19,478 INFO L495 AbstractCegarLoop]: Abstraction has 11243 states and 13024 transitions. [2023-12-25 10:02:19,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 11243 states and 13024 transitions. [2023-12-25 10:02:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 10:02:19,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:02:19,479 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:02:19,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-12-25 10:02:19,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:19,682 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:02:19,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:02:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1077509198, now seen corresponding path program 1 times [2023-12-25 10:02:19,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:02:19,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309418296] [2023-12-25 10:02:19,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:02:19,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:19,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:02:19,684 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:02:19,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-25 10:02:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:02:19,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 10:02:19,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:02:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:02:21,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:02:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:02:21,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:02:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309418296] [2023-12-25 10:02:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309418296] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:02:21,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:02:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2023-12-25 10:02:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154989231] [2023-12-25 10:02:21,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:02:21,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:02:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:02:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:02:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:02:21,806 INFO L87 Difference]: Start difference. First operand 11243 states and 13024 transitions. Second operand has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:02:27,593 INFO L93 Difference]: Finished difference Result 19925 states and 23039 transitions. [2023-12-25 10:02:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-12-25 10:02:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-25 10:02:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:02:27,606 INFO L225 Difference]: With dead ends: 19925 [2023-12-25 10:02:27,606 INFO L226 Difference]: Without dead ends: 16601 [2023-12-25 10:02:27,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2614 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1818, Invalid=8688, Unknown=0, NotChecked=0, Total=10506 [2023-12-25 10:02:27,612 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 1187 mSDsluCounter, 4964 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 5302 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:02:27,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 5302 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 10:02:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16601 states. [2023-12-25 10:02:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16601 to 11661. [2023-12-25 10:02:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11661 states, 11660 states have (on average 1.1575471698113207) internal successors, (13497), 11660 states have internal predecessors, (13497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11661 states to 11661 states and 13497 transitions. [2023-12-25 10:02:27,744 INFO L78 Accepts]: Start accepts. Automaton has 11661 states and 13497 transitions. Word has length 109 [2023-12-25 10:02:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:02:27,744 INFO L495 AbstractCegarLoop]: Abstraction has 11661 states and 13497 transitions. [2023-12-25 10:02:27,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.2727272727272725) internal successors, (207), 33 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 11661 states and 13497 transitions. [2023-12-25 10:02:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 10:02:27,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:02:27,745 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:02:27,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2023-12-25 10:02:27,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:27,948 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:02:27,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:02:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash -141241936, now seen corresponding path program 1 times [2023-12-25 10:02:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:02:27,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099171855] [2023-12-25 10:02:27,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:02:27,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:02:27,950 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:02:27,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-12-25 10:02:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:02:28,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 10:02:28,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:02:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:02:29,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:02:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:02:30,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:02:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099171855] [2023-12-25 10:02:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099171855] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:02:30,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:02:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 10:02:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166153457] [2023-12-25 10:02:30,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:02:30,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:02:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:02:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:02:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:02:30,101 INFO L87 Difference]: Start difference. First operand 11661 states and 13497 transitions. Second operand has 33 states, 33 states have (on average 6.0) internal successors, (198), 33 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:02:47,304 INFO L93 Difference]: Finished difference Result 27924 states and 32324 transitions. [2023-12-25 10:02:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-25 10:02:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.0) internal successors, (198), 33 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 10:02:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:02:47,321 INFO L225 Difference]: With dead ends: 27924 [2023-12-25 10:02:47,321 INFO L226 Difference]: Without dead ends: 23122 [2023-12-25 10:02:47,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1253, Invalid=8253, Unknown=0, NotChecked=0, Total=9506 [2023-12-25 10:02:47,327 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 2257 mSDsluCounter, 6150 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 6518 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:02:47,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 6518 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 10:02:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23122 states. [2023-12-25 10:02:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23122 to 11295. [2023-12-25 10:02:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11295 states, 11294 states have (on average 1.1572516380378963) internal successors, (13070), 11294 states have internal predecessors, (13070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11295 states to 11295 states and 13070 transitions. [2023-12-25 10:02:47,452 INFO L78 Accepts]: Start accepts. Automaton has 11295 states and 13070 transitions. Word has length 110 [2023-12-25 10:02:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:02:47,452 INFO L495 AbstractCegarLoop]: Abstraction has 11295 states and 13070 transitions. [2023-12-25 10:02:47,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.0) internal successors, (198), 33 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:02:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11295 states and 13070 transitions. [2023-12-25 10:02:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-25 10:02:47,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:02:47,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:02:47,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-12-25 10:02:47,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:47,661 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:02:47,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:02:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 204740297, now seen corresponding path program 1 times [2023-12-25 10:02:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:02:47,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281362248] [2023-12-25 10:02:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:02:47,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:02:47,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:02:47,663 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:02:47,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-25 10:02:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:02:47,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 10:02:47,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:02:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 16 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:02:49,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:02:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 16 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:02:50,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:02:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281362248] [2023-12-25 10:02:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281362248] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:02:50,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:02:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2023-12-25 10:02:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613817538] [2023-12-25 10:02:50,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:02:50,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-25 10:02:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:02:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-25 10:02:50,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 10:02:50,489 INFO L87 Difference]: Start difference. First operand 11295 states and 13070 transitions. Second operand has 49 states, 49 states have (on average 5.775510204081633) internal successors, (283), 49 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:11,301 INFO L93 Difference]: Finished difference Result 38460 states and 45099 transitions. [2023-12-25 10:04:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 413 states. [2023-12-25 10:04:11,301 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.775510204081633) internal successors, (283), 49 states have internal predecessors, (283), 0 states have call successors, (0), 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 157 [2023-12-25 10:04:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:11,327 INFO L225 Difference]: With dead ends: 38460 [2023-12-25 10:04:11,327 INFO L226 Difference]: Without dead ends: 35193 [2023-12-25 10:04:11,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 453 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 84032 ImplicationChecksByTransitivity, 73.1s TimeCoverageRelationStatistics Valid=16920, Invalid=189650, Unknown=0, NotChecked=0, Total=206570 [2023-12-25 10:04:11,341 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 5835 mSDsluCounter, 13061 mSDsCounter, 0 mSdLazyCounter, 8284 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5835 SdHoareTripleChecker+Valid, 13555 SdHoareTripleChecker+Invalid, 8437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 8284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:11,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5835 Valid, 13555 Invalid, 8437 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [153 Valid, 8284 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-12-25 10:04:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35193 states. [2023-12-25 10:04:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35193 to 18606. [2023-12-25 10:04:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18606 states, 18605 states have (on average 1.166460628863209) internal successors, (21702), 18605 states have internal predecessors, (21702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18606 states to 18606 states and 21702 transitions. [2023-12-25 10:04:11,601 INFO L78 Accepts]: Start accepts. Automaton has 18606 states and 21702 transitions. Word has length 157 [2023-12-25 10:04:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:11,601 INFO L495 AbstractCegarLoop]: Abstraction has 18606 states and 21702 transitions. [2023-12-25 10:04:11,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.775510204081633) internal successors, (283), 49 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 18606 states and 21702 transitions. [2023-12-25 10:04:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-25 10:04:11,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:11,605 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:11,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-12-25 10:04:11,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:11,808 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:04:11,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1090224701, now seen corresponding path program 1 times [2023-12-25 10:04:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6124519] [2023-12-25 10:04:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:11,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:11,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:11,811 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:04:11,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-25 10:04:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:11,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 10:04:11,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 10:04:12,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:13,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6124519] [2023-12-25 10:04:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6124519] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:13,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2023-12-25 10:04:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70188380] [2023-12-25 10:04:13,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:13,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 10:04:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 10:04:13,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2023-12-25 10:04:13,786 INFO L87 Difference]: Start difference. First operand 18606 states and 21702 transitions. Second operand has 32 states, 32 states have (on average 8.65625) internal successors, (277), 32 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:17,091 INFO L93 Difference]: Finished difference Result 29992 states and 35113 transitions. [2023-12-25 10:04:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-25 10:04:17,092 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.65625) internal successors, (277), 32 states have internal predecessors, (277), 0 states have call successors, (0), 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 157 [2023-12-25 10:04:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:17,116 INFO L225 Difference]: With dead ends: 29992 [2023-12-25 10:04:17,117 INFO L226 Difference]: Without dead ends: 25322 [2023-12-25 10:04:17,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1010, Invalid=4540, Unknown=0, NotChecked=0, Total=5550 [2023-12-25 10:04:17,124 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1701 mSDsluCounter, 3705 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 3829 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:17,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 3829 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 10:04:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25322 states. [2023-12-25 10:04:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25322 to 15124. [2023-12-25 10:04:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15124 states, 15123 states have (on average 1.1614097731931494) internal successors, (17564), 15123 states have internal predecessors, (17564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15124 states to 15124 states and 17564 transitions. [2023-12-25 10:04:17,325 INFO L78 Accepts]: Start accepts. Automaton has 15124 states and 17564 transitions. Word has length 157 [2023-12-25 10:04:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:17,326 INFO L495 AbstractCegarLoop]: Abstraction has 15124 states and 17564 transitions. [2023-12-25 10:04:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.65625) internal successors, (277), 32 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 15124 states and 17564 transitions. [2023-12-25 10:04:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 10:04:17,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:17,330 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:17,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2023-12-25 10:04:17,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:17,533 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:04:17,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 676074312, now seen corresponding path program 1 times [2023-12-25 10:04:17,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545527874] [2023-12-25 10:04:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:17,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:17,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:17,535 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:04:17,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-25 10:04:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:17,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:04:17,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 69 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 10:04:18,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 69 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 10:04:18,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:18,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545527874] [2023-12-25 10:04:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545527874] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:18,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:18,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 10:04:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008634979] [2023-12-25 10:04:18,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:18,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 10:04:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 10:04:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 10:04:18,476 INFO L87 Difference]: Start difference. First operand 15124 states and 17564 transitions. Second operand has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 17 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:19,309 INFO L93 Difference]: Finished difference Result 21299 states and 24863 transitions. [2023-12-25 10:04:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 10:04:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 17 states have internal predecessors, (267), 0 states have call successors, (0), 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 158 [2023-12-25 10:04:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:19,317 INFO L225 Difference]: With dead ends: 21299 [2023-12-25 10:04:19,317 INFO L226 Difference]: Without dead ends: 9883 [2023-12-25 10:04:19,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:04:19,323 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 700 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:19,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 587 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 10:04:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9883 states. [2023-12-25 10:04:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9883 to 7598. [2023-12-25 10:04:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7598 states, 7597 states have (on average 1.1421613794919048) internal successors, (8677), 7597 states have internal predecessors, (8677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7598 states to 7598 states and 8677 transitions. [2023-12-25 10:04:19,441 INFO L78 Accepts]: Start accepts. Automaton has 7598 states and 8677 transitions. Word has length 158 [2023-12-25 10:04:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:19,441 INFO L495 AbstractCegarLoop]: Abstraction has 7598 states and 8677 transitions. [2023-12-25 10:04:19,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 17 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 7598 states and 8677 transitions. [2023-12-25 10:04:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:04:19,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:19,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:19,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-12-25 10:04:19,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:19,647 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:04:19,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:19,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1165891621, now seen corresponding path program 1 times [2023-12-25 10:04:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:19,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864162970] [2023-12-25 10:04:19,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:19,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:19,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:19,649 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:04:19,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-25 10:04:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:19,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 10:04:19,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:20,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 22 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:20,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:20,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864162970] [2023-12-25 10:04:20,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864162970] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:20,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:20,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-25 10:04:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580317106] [2023-12-25 10:04:20,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:20,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 10:04:20,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:20,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 10:04:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2023-12-25 10:04:20,961 INFO L87 Difference]: Start difference. First operand 7598 states and 8677 transitions. Second operand has 29 states, 29 states have (on average 10.275862068965518) internal successors, (298), 29 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:23,601 INFO L93 Difference]: Finished difference Result 14232 states and 16215 transitions. [2023-12-25 10:04:23,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-25 10:04:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.275862068965518) internal successors, (298), 29 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-12-25 10:04:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:23,608 INFO L225 Difference]: With dead ends: 14232 [2023-12-25 10:04:23,608 INFO L226 Difference]: Without dead ends: 11107 [2023-12-25 10:04:23,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=767, Invalid=4933, Unknown=0, NotChecked=0, Total=5700 [2023-12-25 10:04:23,611 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1334 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:23,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 3579 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 10:04:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11107 states. [2023-12-25 10:04:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11107 to 8388. [2023-12-25 10:04:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8388 states, 8387 states have (on average 1.1396208417789435) internal successors, (9558), 8387 states have internal predecessors, (9558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8388 states to 8388 states and 9558 transitions. [2023-12-25 10:04:23,669 INFO L78 Accepts]: Start accepts. Automaton has 8388 states and 9558 transitions. Word has length 159 [2023-12-25 10:04:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:23,669 INFO L495 AbstractCegarLoop]: Abstraction has 8388 states and 9558 transitions. [2023-12-25 10:04:23,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.275862068965518) internal successors, (298), 29 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 8388 states and 9558 transitions. [2023-12-25 10:04:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:04:23,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:23,671 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:23,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2023-12-25 10:04:23,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:23,875 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:04:23,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1484887689, now seen corresponding path program 1 times [2023-12-25 10:04:23,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:23,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084466577] [2023-12-25 10:04:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:23,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:23,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:23,877 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:04:23,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-12-25 10:04:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:24,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:04:24,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 10:04:24,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 10:04:24,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:24,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084466577] [2023-12-25 10:04:24,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084466577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:24,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 10:04:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867573738] [2023-12-25 10:04:24,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 10:04:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:24,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 10:04:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 10:04:24,409 INFO L87 Difference]: Start difference. First operand 8388 states and 9558 transitions. Second operand has 10 states, 10 states have (on average 28.2) internal successors, (282), 10 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:24,547 INFO L93 Difference]: Finished difference Result 36214 states and 42210 transitions. [2023-12-25 10:04:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 10:04:24,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 28.2) internal successors, (282), 10 states have internal predecessors, (282), 0 states have call successors, (0), 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 159 [2023-12-25 10:04:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:24,569 INFO L225 Difference]: With dead ends: 36214 [2023-12-25 10:04:24,569 INFO L226 Difference]: Without dead ends: 28463 [2023-12-25 10:04:24,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-25 10:04:24,578 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 333 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:24,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1067 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:04:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28463 states. [2023-12-25 10:04:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28463 to 27963. [2023-12-25 10:04:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27963 states, 27962 states have (on average 1.1156569630212432) internal successors, (31196), 27962 states have internal predecessors, (31196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27963 states to 27963 states and 31196 transitions. [2023-12-25 10:04:24,782 INFO L78 Accepts]: Start accepts. Automaton has 27963 states and 31196 transitions. Word has length 159 [2023-12-25 10:04:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:24,782 INFO L495 AbstractCegarLoop]: Abstraction has 27963 states and 31196 transitions. [2023-12-25 10:04:24,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 28.2) internal successors, (282), 10 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27963 states and 31196 transitions. [2023-12-25 10:04:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:04:24,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:24,785 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:24,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Ended with exit code 0 [2023-12-25 10:04:24,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:24,988 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:04:24,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1116823816, now seen corresponding path program 1 times [2023-12-25 10:04:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:24,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504320259] [2023-12-25 10:04:24,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:24,990 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:04:24,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-12-25 10:04:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:25,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 10:04:25,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 31 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:25,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 31 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:26,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504320259] [2023-12-25 10:04:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504320259] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:26,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2023-12-25 10:04:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286289545] [2023-12-25 10:04:26,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:26,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 10:04:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 10:04:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2023-12-25 10:04:26,228 INFO L87 Difference]: Start difference. First operand 27963 states and 31196 transitions. Second operand has 31 states, 31 states have (on average 9.580645161290322) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:30,551 INFO L93 Difference]: Finished difference Result 40150 states and 44934 transitions. [2023-12-25 10:04:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-25 10:04:30,552 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.580645161290322) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 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 159 [2023-12-25 10:04:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:30,580 INFO L225 Difference]: With dead ends: 40150 [2023-12-25 10:04:30,580 INFO L226 Difference]: Without dead ends: 32427 [2023-12-25 10:04:30,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1156, Invalid=7216, Unknown=0, NotChecked=0, Total=8372 [2023-12-25 10:04:30,593 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 1251 mSDsluCounter, 6405 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 6789 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:30,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 6789 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 10:04:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32427 states. [2023-12-25 10:04:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32427 to 26388. [2023-12-25 10:04:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26388 states, 26387 states have (on average 1.1156630158790313) internal successors, (29439), 26387 states have internal predecessors, (29439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26388 states to 26388 states and 29439 transitions. [2023-12-25 10:04:30,822 INFO L78 Accepts]: Start accepts. Automaton has 26388 states and 29439 transitions. Word has length 159 [2023-12-25 10:04:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:30,822 INFO L495 AbstractCegarLoop]: Abstraction has 26388 states and 29439 transitions. [2023-12-25 10:04:30,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.580645161290322) internal successors, (297), 31 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26388 states and 29439 transitions. [2023-12-25 10:04:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:04:30,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:30,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:30,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2023-12-25 10:04:31,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:31,028 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:04:31,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1389119860, now seen corresponding path program 1 times [2023-12-25 10:04:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68596236] [2023-12-25 10:04:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:31,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:31,030 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:04:31,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-25 10:04:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:31,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 10:04:31,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 31 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:32,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 50 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:32,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68596236] [2023-12-25 10:04:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68596236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:32,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:32,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2023-12-25 10:04:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270413547] [2023-12-25 10:04:32,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:32,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 10:04:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 10:04:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2023-12-25 10:04:32,755 INFO L87 Difference]: Start difference. First operand 26388 states and 29439 transitions. Second operand has 27 states, 27 states have (on average 11.444444444444445) internal successors, (309), 27 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:40,084 INFO L93 Difference]: Finished difference Result 81922 states and 91240 transitions. [2023-12-25 10:04:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-25 10:04:40,085 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.444444444444445) internal successors, (309), 27 states have internal predecessors, (309), 0 states have call successors, (0), 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 159 [2023-12-25 10:04:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:40,156 INFO L225 Difference]: With dead ends: 81922 [2023-12-25 10:04:40,156 INFO L226 Difference]: Without dead ends: 73967 [2023-12-25 10:04:40,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2013, Invalid=10643, Unknown=0, NotChecked=0, Total=12656 [2023-12-25 10:04:40,179 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 2935 mSDsluCounter, 3752 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2935 SdHoareTripleChecker+Valid, 4058 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:40,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2935 Valid, 4058 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 10:04:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73967 states. [2023-12-25 10:04:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73967 to 22249. [2023-12-25 10:04:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22249 states, 22248 states have (on average 1.1101672060409924) internal successors, (24699), 22248 states have internal predecessors, (24699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22249 states to 22249 states and 24699 transitions. [2023-12-25 10:04:40,562 INFO L78 Accepts]: Start accepts. Automaton has 22249 states and 24699 transitions. Word has length 159 [2023-12-25 10:04:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:40,562 INFO L495 AbstractCegarLoop]: Abstraction has 22249 states and 24699 transitions. [2023-12-25 10:04:40,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.444444444444445) internal successors, (309), 27 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:04:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 22249 states and 24699 transitions. [2023-12-25 10:04:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:04:40,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:40,564 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:40,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Ended with exit code 0 [2023-12-25 10:04:40,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:40,768 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 10:04:40,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -184301568, now seen corresponding path program 1 times [2023-12-25 10:04:40,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:40,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306631590] [2023-12-25 10:04:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:40,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:40,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:40,770 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:04:40,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2023-12-25 10:04:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:04:40,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 10:04:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:04:41,139 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 10:04:41,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 10:04:41,139 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-25 10:04:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-25 10:04:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-25 10:04:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-25 10:04:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-25 10:04:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-25 10:04:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-25 10:04:41,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2023-12-25 10:04:41,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:04:41,347 INFO L445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:04:41,351 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 10:04:41,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 10:04:41 BoogieIcfgContainer [2023-12-25 10:04:41,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 10:04:41,503 INFO L158 Benchmark]: Toolchain (without parser) took 541235.81ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 114.8MB in the beginning and 321.1MB in the end (delta: -206.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-25 10:04:41,503 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 10:04:41,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.34ms. Allocated memory was 167.8MB in the beginning and 259.0MB in the end (delta: 91.2MB). Free memory was 114.4MB in the beginning and 224.5MB in the end (delta: -110.1MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2023-12-25 10:04:41,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.34ms. Allocated memory is still 259.0MB. Free memory was 224.4MB in the beginning and 225.7MB in the end (delta: -1.3MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2023-12-25 10:04:41,504 INFO L158 Benchmark]: Boogie Preprocessor took 140.13ms. Allocated memory is still 259.0MB. Free memory was 225.7MB in the beginning and 218.9MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-25 10:04:41,504 INFO L158 Benchmark]: RCFGBuilder took 1097.68ms. Allocated memory is still 259.0MB. Free memory was 218.9MB in the beginning and 135.1MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2023-12-25 10:04:41,504 INFO L158 Benchmark]: TraceAbstraction took 539356.71ms. Allocated memory was 259.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 134.5MB in the beginning and 321.1MB in the end (delta: -186.6MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-25 10:04:41,504 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.14ms. Allocated memory is still 167.8MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 520.34ms. Allocated memory was 167.8MB in the beginning and 259.0MB in the end (delta: 91.2MB). Free memory was 114.4MB in the beginning and 224.5MB in the end (delta: -110.1MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 115.34ms. Allocated memory is still 259.0MB. Free memory was 224.4MB in the beginning and 225.7MB in the end (delta: -1.3MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 140.13ms. Allocated memory is still 259.0MB. Free memory was 225.7MB in the beginning and 218.9MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1097.68ms. Allocated memory is still 259.0MB. Free memory was 218.9MB in the beginning and 135.1MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. * TraceAbstraction took 539356.71ms. Allocated memory was 259.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 134.5MB in the beginning and 321.1MB in the end (delta: -186.6MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * 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: 332]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 = '\x0'; [L27] port_t p1 = 0; [L28] char p1_old = '\x0'; [L29] char p1_new = '\x0'; [L30] char id1 = '\x0'; [L31] char st1 = '\x0'; [L32] msg_t send1 = '\x0'; [L33] _Bool mode1 = 0; [L34] port_t p2 = 0; [L35] char p2_old = '\x0'; [L36] char p2_new = '\x0'; [L37] char id2 = '\x0'; [L38] char st2 = '\x0'; [L39] msg_t send2 = '\x0'; [L40] _Bool mode2 = 0; [L41] port_t p3 = 0; [L42] char p3_old = '\x0'; [L43] char p3_new = '\x0'; [L44] char id3 = '\x0'; [L45] char st3 = '\x0'; [L46] msg_t send3 = '\x0'; [L47] _Bool mode3 = 0; [L51] void (*nodes[3])() = { &node1, &node2, &node3 }; [L55] int __return_94; [L56] int __return_412; [L57] int __return_1167; [L58] int __tmp_1168_0; [L59] int __return_398; [L60] int __tmp_986_0; [L61] int __return_1057; [L62] int __return_384; [L63] int __tmp_952_0; [L64] int __return_965; [L65] int __return_370; [L66] int __tmp_815_0; [L67] int __tmp_856_0; [L68] int __return_872; [L69] int __return_356; [L70] int __tmp_746_0; [L71] int __return_788; [L72] int __tmp_797_0; [L73] int __return_342; [L74] int __tmp_638_0; [L75] int __tmp_650_0; [L76] int __return_695; [L77] int __return_328; [L78] int __tmp_589_0; [L79] int __tmp_601_0; [L80] int __return_617; [L81] int __return_314; [L82] int __tmp_492_0; [L83] int __tmp_504_0; [L84] int __tmp_516_0; [L85] int __return_535; [L86] int __tmp_544_0; [L87] int __return_1315; [L88] int __return_1180; [L91] int main__c1; [L92] int main__i2; [L93] main__c1 = 0 [L94] r1 = __VERIFIER_nondet_char() [L95] id1 = __VERIFIER_nondet_char() [L96] st1 = __VERIFIER_nondet_char() [L97] send1 = __VERIFIER_nondet_char() [L98] mode1 = __VERIFIER_nondet_bool() [L99] id2 = __VERIFIER_nondet_char() [L100] st2 = __VERIFIER_nondet_char() [L101] send2 = __VERIFIER_nondet_char() [L102] mode2 = __VERIFIER_nondet_bool() [L103] id3 = __VERIFIER_nondet_char() [L104] st3 = __VERIFIER_nondet_char() [L105] send3 = __VERIFIER_nondet_char() [L106] mode3 = __VERIFIER_nondet_bool() [L108] int init__tmp; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L109] COND TRUE ((int)r1) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L111] COND TRUE ((int)id1) >= 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L113] COND TRUE ((int)st1) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L115] COND TRUE ((int)send1) == ((int)id1) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L117] COND TRUE ((int)mode1) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L119] COND TRUE ((int)id2) >= 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L121] COND TRUE ((int)st2) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0, st2=0] [L123] COND TRUE ((int)send2) == ((int)id2) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L125] COND TRUE ((int)mode2) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L127] COND TRUE ((int)id3) >= 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L129] COND TRUE ((int)st3) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0, st3=0] [L131] COND TRUE ((int)send3) == ((int)id3) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, main__c1=0, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L133] COND TRUE ((int)mode3) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L135] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L137] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=0, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, main__c1=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L139] COND TRUE ((int)id2) != ((int)id3) [L141] init__tmp = 1 [L142] __return_94 = init__tmp [L143] main__i2 = __return_94 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L144] COND TRUE main__i2 != 0 [L146] p1_old = nomsg [L147] p1_new = nomsg [L148] p2_old = nomsg [L149] p2_new = nomsg [L150] p3_old = nomsg [L151] p3_new = nomsg [L152] main__i2 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L153] COND TRUE main__i2 < 6 [L156] msg_t node1__m1; [L157] node1__m1 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(mode1 == 0)) [L164] int node1____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L165] COND TRUE send1 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, node1__m1=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L167] COND TRUE p1_new == nomsg [L169] node1____CPAchecker_TMP_0 = send1 [L170] p1_new = node1____CPAchecker_TMP_0 [L171] mode1 = 1 [L173] msg_t node2__m2; [L174] node2__m2 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L175] COND FALSE !(!(mode2 == 0)) [L181] int node2____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L182] COND TRUE send2 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L184] COND TRUE p2_new == nomsg [L186] node2____CPAchecker_TMP_0 = send2 [L187] p2_new = node2____CPAchecker_TMP_0 [L188] mode2 = 1 [L190] msg_t node3__m3; [L191] node3__m3 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L192] COND FALSE !(!(mode3 == 0)) [L198] int node3____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L199] COND TRUE send3 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L201] COND TRUE p3_new == nomsg [L203] node3____CPAchecker_TMP_0 = send3 [L204] p3_new = node3____CPAchecker_TMP_0 [L205] mode3 = 1 [L206] p1_old = p1_new [L207] p1_new = nomsg [L208] p2_old = p2_new [L209] p2_new = nomsg [L210] p3_old = p3_new [L211] p3_new = nomsg [L213] int check__tmp; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L216] COND FALSE !(((int)r1) >= 3) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L222] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=0, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, id1=64, id2=32, id3=0, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int)r1) < 3 [L226] check__tmp = 1 [L227] __return_412 = check__tmp [L228] main__c1 = __return_412 [L230] _Bool __tmp_1; [L231] __tmp_1 = main__c1 [L232] _Bool assert__arg; [L233] assert__arg = __tmp_1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L234] COND FALSE !(assert__arg == 0) [L240] int main____CPAchecker_TMP_0 = main__i2; [L241] main__i2 = main__i2 + 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L242] COND TRUE main__i2 < 6 [L245] msg_t node1__m1; [L246] node1__m1 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L247] COND TRUE !(mode1 == 0) [L249] r1 = (char)(((int)r1) + 1) [L250] node1__m1 = p3_old [L251] p3_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L252] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L254] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L261] COND FALSE !(((int)node1__m1) == ((int)id1)) [L390] send1 = node1__m1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L392] mode1 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L401] __tmp_986_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L500] main____CPAchecker_TMP_0 = __tmp_986_0 [L502] msg_t node2__m2; [L503] node2__m2 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=-1, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L504] COND TRUE !(mode2 == 0) [L506] node2__m2 = p1_old [L507] p1_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L510] COND TRUE ((int)node2__m2) > ((int)id2) [L512] send2 = node2__m2 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L601] mode2 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L610] __tmp_650_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L1445] main____CPAchecker_TMP_0 = __tmp_650_0 [L1447] msg_t node3__m3; [L1448] node3__m3 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L1449] COND TRUE !(mode3 == 0) [L1451] node3__m3 = p2_old [L1452] p2_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L1453] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L1455] COND TRUE ((int)node3__m3) > ((int)id3) [L1457] send3 = node3__m3 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1518] mode3 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1527] __tmp_516_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1907] main____CPAchecker_TMP_0 = __tmp_516_0 [L1908] p1_old = p1_new [L1909] p1_new = nomsg [L1910] p2_old = p2_new [L1911] p2_new = nomsg [L1912] p3_old = p3_new [L1913] p3_new = nomsg [L1915] int check__tmp; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1916] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1918] COND FALSE !(((int)r1) >= 3) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1924] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=0, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1926] COND TRUE ((int)r1) < 3 [L1928] check__tmp = 1 [L1929] __return_535 = check__tmp [L1930] main__c1 = __return_535 [L1932] _Bool __tmp_16; [L1933] __tmp_16 = main__c1 [L1934] _Bool assert__arg; [L1935] assert__arg = __tmp_16 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=0, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1936] COND FALSE !(assert__arg == 0) [L1942] int main____CPAchecker_TMP_0 = main__i2; [L1943] main__i2 = main__i2 + 1 [L1944] __tmp_544_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1946] main____CPAchecker_TMP_0 = __tmp_544_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1947] COND TRUE main__i2 < 6 [L1950] msg_t node1__m1; [L1951] node1__m1 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1952] COND FALSE !(!(mode1 == 0)) [L2164] int node1____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2165] COND TRUE send1 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2167] COND TRUE p1_new == nomsg [L2169] node1____CPAchecker_TMP_0 = send1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2182] p1_new = node1____CPAchecker_TMP_0 [L2183] mode1 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1984] msg_t node2__m2; [L1985] node2__m2 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1986] COND FALSE !(!(mode2 == 0)) [L2136] int node2____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2137] COND TRUE send2 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2139] COND TRUE p2_new == nomsg [L2141] node2____CPAchecker_TMP_0 = send2 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2154] p2_new = node2____CPAchecker_TMP_0 [L2155] mode2 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2016] msg_t node3__m3; [L2017] node3__m3 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2018] COND FALSE !(!(mode3 == 0)) [L2108] int node3____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2109] COND TRUE send3 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2111] COND TRUE p3_new == nomsg [L2113] node3____CPAchecker_TMP_0 = send3 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2126] p3_new = node3____CPAchecker_TMP_0 [L2127] mode3 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=32, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2047] p1_old = p1_new [L2048] p1_new = nomsg [L2049] p2_old = p2_new [L2050] p2_new = nomsg [L2051] p3_old = p3_new [L2052] p3_new = nomsg [L2054] int check__tmp; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2055] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2057] COND FALSE !(((int)r1) >= 3) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2063] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2066] COND TRUE ((int)r1) < 3 [L2068] check__tmp = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=0, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L2098] __return_1315 = check__tmp [L2099] main__c1 = __return_1315 [L2100] __tmp_1168_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L324] main____CPAchecker_TMP_0 = __tmp_1168_0 [L326] _Bool __tmp_2; [L327] __tmp_2 = main__c1 [L328] _Bool assert__arg; [L329] assert__arg = __tmp_2 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=0, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L330] COND FALSE !(assert__arg == 0) [L337] __tmp_797_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=1, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1277] main____CPAchecker_TMP_0 = __tmp_797_0 [L1278] int main____CPAchecker_TMP_0 = main__i2; [L1279] main__i2 = main__i2 + 1 [L1280] __tmp_544_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1946] main____CPAchecker_TMP_0 = __tmp_544_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1947] COND TRUE main__i2 < 6 [L1950] msg_t node1__m1; [L1951] node1__m1 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1952] COND TRUE !(mode1 == 0) [L1954] r1 = (char)(((int)r1) + 1) [L1955] node1__m1 = p3_old [L1956] p3_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1957] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1959] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L1966] COND FALSE !(((int)node1__m1) == ((int)id1)) [L1973] send1 = node1__m1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L1981] mode1 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L1984] msg_t node2__m2; [L1985] node2__m2 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L1986] COND TRUE !(mode2 == 0) [L1988] node2__m2 = p1_old [L1989] p1_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L1990] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L1992] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L1999] COND FALSE !(((int)node2__m2) == ((int)id2)) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L2013] mode2 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L2016] msg_t node3__m3; [L2017] node3__m3 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L2018] COND TRUE !(mode3 == 0) [L2020] node3__m3 = p2_old [L2021] p2_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L2022] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L2024] COND TRUE ((int)node3__m3) > ((int)id3) [L2026] send3 = node3__m3 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2045] mode3 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2047] p1_old = p1_new [L2048] p1_new = nomsg [L2049] p2_old = p2_new [L2050] p2_new = nomsg [L2051] p3_old = p3_new [L2052] p3_new = nomsg [L2054] int check__tmp; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2055] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2057] COND FALSE !(((int)r1) >= 3) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2063] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2066] COND TRUE ((int)r1) < 3 [L2068] check__tmp = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=1, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2098] __return_1315 = check__tmp [L2099] main__c1 = __return_1315 [L2100] __tmp_1168_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L324] main____CPAchecker_TMP_0 = __tmp_1168_0 [L326] _Bool __tmp_2; [L327] __tmp_2 = main__c1 [L328] _Bool assert__arg; [L329] assert__arg = __tmp_2 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=1, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L330] COND FALSE !(assert__arg == 0) [L337] __tmp_797_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=2, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1277] main____CPAchecker_TMP_0 = __tmp_797_0 [L1278] int main____CPAchecker_TMP_0 = main__i2; [L1279] main__i2 = main__i2 + 1 [L1280] __tmp_544_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1946] main____CPAchecker_TMP_0 = __tmp_544_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=32, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1947] COND TRUE main__i2 < 6 [L1950] msg_t node1__m1; [L1951] node1__m1 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1952] COND FALSE !(!(mode1 == 0)) [L2164] int node1____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2165] COND TRUE send1 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2167] COND TRUE p1_new == nomsg [L2169] node1____CPAchecker_TMP_0 = send1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2182] p1_new = node1____CPAchecker_TMP_0 [L2183] mode1 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1984] msg_t node2__m2; [L1985] node2__m2 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1986] COND FALSE !(!(mode2 == 0)) [L2136] int node2____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2137] COND TRUE send2 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2139] COND TRUE p2_new == nomsg [L2141] node2____CPAchecker_TMP_0 = send2 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2154] p2_new = node2____CPAchecker_TMP_0 [L2155] mode2 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2016] msg_t node3__m3; [L2017] node3__m3 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=32, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2018] COND FALSE !(!(mode3 == 0)) [L2108] int node3____CPAchecker_TMP_0; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2109] COND TRUE send3 != nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2111] COND TRUE p3_new == nomsg [L2113] node3____CPAchecker_TMP_0 = send3 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2126] p3_new = node3____CPAchecker_TMP_0 [L2127] mode3 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2047] p1_old = p1_new [L2048] p1_new = nomsg [L2049] p2_old = p2_new [L2050] p2_new = nomsg [L2051] p3_old = p3_new [L2052] p3_new = nomsg [L2054] int check__tmp; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2055] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2057] COND FALSE !(((int)r1) >= 3) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2063] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2066] COND TRUE ((int)r1) < 3 [L2068] check__tmp = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=2, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L2098] __return_1315 = check__tmp [L2099] main__c1 = __return_1315 [L2100] __tmp_1168_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L324] main____CPAchecker_TMP_0 = __tmp_1168_0 [L326] _Bool __tmp_2; [L327] __tmp_2 = main__c1 [L328] _Bool assert__arg; [L329] assert__arg = __tmp_2 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=2, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L330] COND FALSE !(assert__arg == 0) [L337] __tmp_797_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=3, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1277] main____CPAchecker_TMP_0 = __tmp_797_0 [L1278] int main____CPAchecker_TMP_0 = main__i2; [L1279] main__i2 = main__i2 + 1 [L1280] __tmp_544_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1946] main____CPAchecker_TMP_0 = __tmp_544_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1947] COND TRUE main__i2 < 6 [L1950] msg_t node1__m1; [L1951] node1__m1 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1952] COND TRUE !(mode1 == 0) [L1954] r1 = (char)(((int)r1) + 1) [L1955] node1__m1 = p3_old [L1956] p3_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1957] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1959] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L1966] COND TRUE ((int)node1__m1) == ((int)id1) [L1968] st1 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L1981] mode1 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L1984] msg_t node2__m2; [L1985] node2__m2 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L1986] COND TRUE !(mode2 == 0) [L1988] node2__m2 = p1_old [L1989] p1_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L1990] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L1992] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L1999] COND TRUE ((int)node2__m2) == ((int)id2) [L2001] st2 = 1 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2013] mode2 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2016] msg_t node3__m3; [L2017] node3__m3 = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=-1, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2018] COND TRUE !(mode3 == 0) [L2020] node3__m3 = p2_old [L2021] p2_old = nomsg VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2022] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2024] COND TRUE ((int)node3__m3) > ((int)id3) [L2026] send3 = node3__m3 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2045] mode3 = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2047] p1_old = p1_new [L2048] p1_new = nomsg [L2049] p2_old = p2_new [L2050] p2_new = nomsg [L2051] p3_old = p3_new [L2052] p3_new = nomsg [L2054] int check__tmp; VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2055] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L2096] check__tmp = 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=1, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=3, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L2098] __return_1315 = check__tmp [L2099] main__c1 = __return_1315 [L2100] __tmp_1168_0 = main____CPAchecker_TMP_0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=4, __tmp_16=1, __tmp_1=1, __tmp_2=1, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L324] main____CPAchecker_TMP_0 = __tmp_1168_0 [L326] _Bool __tmp_2; [L327] __tmp_2 = main__c1 [L328] _Bool assert__arg; [L329] assert__arg = __tmp_2 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=4, __tmp_16=1, __tmp_1=1, __tmp_2=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L330] COND TRUE assert__arg == 0 VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=4, __tmp_16=1, __tmp_1=1, __tmp_2=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L332] reach_error() VAL [__return_1057=0, __return_1167=0, __return_1180=0, __return_1315=0, __return_314=0, __return_328=0, __return_342=0, __return_356=0, __return_370=0, __return_384=0, __return_398=0, __return_412=1, __return_535=1, __return_617=0, __return_695=0, __return_788=0, __return_872=0, __return_94=1, __return_965=0, __return_main=0, __tmp_1168_0=4, __tmp_16=1, __tmp_1=1, __tmp_2=0, __tmp_492_0=0, __tmp_504_0=0, __tmp_516_0=0, __tmp_544_0=4, __tmp_589_0=0, __tmp_601_0=0, __tmp_638_0=0, __tmp_650_0=0, __tmp_746_0=0, __tmp_797_0=3, __tmp_815_0=0, __tmp_856_0=0, __tmp_952_0=0, __tmp_986_0=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=0, node1__m1=64, node2____CPAchecker_TMP_0=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=32, node2__m2=64, node3____CPAchecker_TMP_0=0, node3____CPAchecker_TMP_0=64, node3__m3=-1, node3__m3=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] - UnprovableResult [Line: 565]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1270]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1498]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1730]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 277 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 539.1s, OverallIterations: 48, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 480.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60817 SdHoareTripleChecker+Valid, 62.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60817 mSDsluCounter, 104330 SdHoareTripleChecker+Invalid, 57.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94914 mSDsCounter, 970 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45051 IncrementalHoareTripleChecker+Invalid, 46021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 970 mSolverCounterUnsat, 9416 mSDtfsCounter, 45051 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9295 GetRequests, 6284 SyntacticMatches, 4 SemanticMatches, 3007 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 330429 ImplicationChecksByTransitivity, 425.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42476occurred in iteration=35, InterpolantAutomatonStates: 2631, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 47 MinimizatonAttempts, 305652 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 4673 NumberOfCodeBlocks, 4673 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 6841 ConstructedInterpolants, 1942 QuantifiedInterpolants, 85334 SizeOfPredicates, 296 NumberOfNonLiveVariables, 11992 ConjunctsInSsa, 511 ConjunctsInUnsatCore, 66 InterpolantComputations, 28 PerfectInterpolantSequences, 873/1901 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-25 10:04:41,715 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 10:04:41,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...