/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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:56:12,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:56:12,979 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:56:12,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:56:12,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:56:12,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:56:12,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:56:12,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:56:12,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:56:12,997 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:56:12,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:56:12,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:56:12,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:56:12,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:56:12,998 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:56:12,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:56:12,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:56:12,999 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:56:12,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:56:12,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:56:13,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:56:13,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:56:13,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:56:13,001 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:56:13,001 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:56:13,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:56:13,001 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:56:13,001 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:56:13,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:56:13,002 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:56:13,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:56:13,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:56:13,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:56:13,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:56:13,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:56:13,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:56:13,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:56:13,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:56:13,004 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:56:13,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:56:13,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:56:13,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:56:13,005 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:56:13,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:56:13,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:56:13,005 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:56:13,005 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:56:13,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:56:13,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:56:13,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:56:13,228 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:56:13,229 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:56:13,230 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-25 09:56:14,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:56:14,568 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:56:14,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-25 09:56:14,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63784892e/6c27ab12aa7043b68cc0b9067c1e0b30/FLAGb44a83957 [2023-12-25 09:56:14,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63784892e/6c27ab12aa7043b68cc0b9067c1e0b30 [2023-12-25 09:56:14,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:56:14,594 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:56:14,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:56:14,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:56:14,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:56:14,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:56:14" (1/1) ... [2023-12-25 09:56:14,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7825c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:14, skipping insertion in model container [2023-12-25 09:56:14,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:56:14" (1/1) ... [2023-12-25 09:56:14,648 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:56:14,822 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.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2023-12-25 09:56:14,848 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.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2023-12-25 09:56:14,853 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.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2023-12-25 09:56:14,856 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.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2023-12-25 09:56:14,862 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.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2023-12-25 09:56:14,868 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2023-12-25 09:56:14,876 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2023-12-25 09:56:14,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:56:14,912 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:56:14,959 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.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2023-12-25 09:56:14,981 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.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2023-12-25 09:56:14,984 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.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2023-12-25 09:56:14,986 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.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2023-12-25 09:56:14,990 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.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2023-12-25 09:56:14,992 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2023-12-25 09:56:14,998 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2023-12-25 09:56:15,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:56:15,029 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:56:15,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15 WrapperNode [2023-12-25 09:56:15,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:56:15,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:56:15,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:56:15,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:56:15,035 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:56:15" (1/1) ... [2023-12-25 09:56:15,058 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:56:15" (1/1) ... [2023-12-25 09:56:15,092 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2023-12-25 09:56:15,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:56:15,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:56:15,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:56:15,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:56:15,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,151 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:56:15,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:56:15,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:56:15,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:56:15,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:56:15,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (1/1) ... [2023-12-25 09:56:15,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:56:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:56:15,270 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:56:15,302 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:56:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:56:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:56:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:56:15,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:56:15,442 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:56:15,444 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:56:16,076 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:56:16,106 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:56:16,106 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:56:16,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:56:16 BoogieIcfgContainer [2023-12-25 09:56:16,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:56:16,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:56:16,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:56:16,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:56:16,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:56:14" (1/3) ... [2023-12-25 09:56:16,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442f2a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:56:16, skipping insertion in model container [2023-12-25 09:56:16,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:15" (2/3) ... [2023-12-25 09:56:16,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442f2a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:56:16, skipping insertion in model container [2023-12-25 09:56:16,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:56:16" (3/3) ... [2023-12-25 09:56:16,112 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-25 09:56:16,124 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:56:16,124 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-25 09:56:16,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:56:16,161 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;@dd48ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:56:16,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-25 09:56:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 196 states have (on average 1.8316326530612246) internal successors, (359), 203 states have internal predecessors, (359), 0 states have call successors, (0), 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:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 09:56:16,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:16,180 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] [2023-12-25 09:56:16,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:16,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -114756949, now seen corresponding path program 1 times [2023-12-25 09:56:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697240580] [2023-12-25 09:56:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:16,193 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:16,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:16,195 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:56:16,204 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:56:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:16,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:16,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:16,619 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:16,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:16,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697240580] [2023-12-25 09:56:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697240580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:16,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7355763] [2023-12-25 09:56:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:16,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:16,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:16,652 INFO L87 Difference]: Start difference. First operand has 204 states, 196 states have (on average 1.8316326530612246) internal successors, (359), 203 states have internal predecessors, (359), 0 states have call successors, (0), 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.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:16,967 INFO L93 Difference]: Finished difference Result 417 states and 699 transitions. [2023-12-25 09:56:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:16,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2023-12-25 09:56:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:16,977 INFO L225 Difference]: With dead ends: 417 [2023-12-25 09:56:16,978 INFO L226 Difference]: Without dead ends: 257 [2023-12-25 09:56:16,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:56:16,982 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 686 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:16,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 296 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-12-25 09:56:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2023-12-25 09:56:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 226 states have (on average 1.3539823008849559) internal successors, (306), 232 states have internal predecessors, (306), 0 states have call successors, (0), 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:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2023-12-25 09:56:17,017 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 45 [2023-12-25 09:56:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:17,017 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2023-12-25 09:56:17,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2023-12-25 09:56:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 09:56:17,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:17,019 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] [2023-12-25 09:56:17,043 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 (2)] Ended with exit code 0 [2023-12-25 09:56:17,224 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:56:17,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:17,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1853332142, now seen corresponding path program 1 times [2023-12-25 09:56:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:17,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238982561] [2023-12-25 09:56:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:17,226 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:17,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:17,229 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:56:17,247 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:56:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:17,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:17,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:17,524 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:17,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:17,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238982561] [2023-12-25 09:56:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238982561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467436909] [2023-12-25 09:56:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:17,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:17,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:17,527 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:17,657 INFO L93 Difference]: Finished difference Result 416 states and 559 transitions. [2023-12-25 09:56:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2023-12-25 09:56:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:17,661 INFO L225 Difference]: With dead ends: 416 [2023-12-25 09:56:17,661 INFO L226 Difference]: Without dead ends: 220 [2023-12-25 09:56:17,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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:56:17,665 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 367 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:17,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 130 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-25 09:56:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2023-12-25 09:56:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 213 states have (on average 1.3568075117370892) internal successors, (289), 219 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:56:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 289 transitions. [2023-12-25 09:56:17,674 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 289 transitions. Word has length 46 [2023-12-25 09:56:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:17,675 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 289 transitions. [2023-12-25 09:56:17,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 289 transitions. [2023-12-25 09:56:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 09:56:17,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:17,676 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:56:17,681 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 (3)] Ended with exit code 0 [2023-12-25 09:56:17,878 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:56:17,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:17,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1505086284, now seen corresponding path program 1 times [2023-12-25 09:56:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727572988] [2023-12-25 09:56:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:17,880 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:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:17,883 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:56:17,886 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:56:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:17,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:17,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:18,086 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:18,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:18,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:18,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727572988] [2023-12-25 09:56:18,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727572988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:18,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:18,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706938957] [2023-12-25 09:56:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:18,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:18,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:18,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:18,088 INFO L87 Difference]: Start difference. First operand 220 states and 289 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:56:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:18,195 INFO L93 Difference]: Finished difference Result 403 states and 540 transitions. [2023-12-25 09:56:18,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:18,195 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:56:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:18,196 INFO L225 Difference]: With dead ends: 403 [2023-12-25 09:56:18,196 INFO L226 Difference]: Without dead ends: 215 [2023-12-25 09:56:18,197 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:56:18,197 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 344 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:18,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 127 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-25 09:56:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-12-25 09:56:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 states have internal predecessors, (281), 0 states have call successors, (0), 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:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2023-12-25 09:56:18,203 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 47 [2023-12-25 09:56:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:18,203 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2023-12-25 09:56:18,203 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:56:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2023-12-25 09:56:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 09:56:18,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:18,205 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] [2023-12-25 09:56:18,210 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 (4)] Ended with exit code 0 [2023-12-25 09:56:18,407 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:56:18,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:18,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:18,410 INFO L85 PathProgramCache]: Analyzing trace with hash -990553041, now seen corresponding path program 1 times [2023-12-25 09:56:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:18,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163413080] [2023-12-25 09:56:18,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:18,411 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:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:18,417 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:56:18,421 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:56:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:18,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:18,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:18,868 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:18,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:18,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163413080] [2023-12-25 09:56:18,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163413080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:56:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136310176] [2023-12-25 09:56:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:56:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:56:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:56:18,872 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:19,428 INFO L93 Difference]: Finished difference Result 304 states and 413 transitions. [2023-12-25 09:56:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 09:56:19,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2023-12-25 09:56:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:19,430 INFO L225 Difference]: With dead ends: 304 [2023-12-25 09:56:19,430 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 09:56:19,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 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:19,431 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 485 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:19,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 506 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:56:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 09:56:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 215. [2023-12-25 09:56:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 states have internal predecessors, (280), 0 states have call successors, (0), 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:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2023-12-25 09:56:19,437 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 48 [2023-12-25 09:56:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:19,437 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2023-12-25 09:56:19,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2023-12-25 09:56:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 09:56:19,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:19,438 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] [2023-12-25 09:56:19,459 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 (5)] Ended with exit code 0 [2023-12-25 09:56:19,640 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:56:19,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:19,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 921644061, now seen corresponding path program 1 times [2023-12-25 09:56:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334448913] [2023-12-25 09:56:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:19,642 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:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:19,643 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:56:19,645 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:56:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:19,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:19,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:20,126 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:20,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:20,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:20,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334448913] [2023-12-25 09:56:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334448913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:20,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:20,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:56:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4306816] [2023-12-25 09:56:20,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:20,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:56:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:20,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:56:20,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:56:20,129 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:20,754 INFO L93 Difference]: Finished difference Result 426 states and 579 transitions. [2023-12-25 09:56:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:56:20,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2023-12-25 09:56:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:20,756 INFO L225 Difference]: With dead ends: 426 [2023-12-25 09:56:20,756 INFO L226 Difference]: Without dead ends: 325 [2023-12-25 09:56:20,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 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:56:20,757 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 944 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:20,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 604 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:56:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-25 09:56:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2023-12-25 09:56:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 states have internal predecessors, (279), 0 states have call successors, (0), 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:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2023-12-25 09:56:20,762 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 48 [2023-12-25 09:56:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:20,762 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2023-12-25 09:56:20,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2023-12-25 09:56:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 09:56:20,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:20,763 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] [2023-12-25 09:56:20,766 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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:20,972 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:56:20,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:20,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash -528561187, now seen corresponding path program 1 times [2023-12-25 09:56:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847790058] [2023-12-25 09:56:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:20,973 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:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:20,975 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:56:20,976 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:56:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:21,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 09:56:21,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:21,236 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:21,236 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:21,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847790058] [2023-12-25 09:56:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847790058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:21,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 09:56:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924418305] [2023-12-25 09:56:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:21,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 09:56:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:21,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 09:56:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 09:56:21,238 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:21,496 INFO L93 Difference]: Finished difference Result 339 states and 453 transitions. [2023-12-25 09:56:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 09:56:21,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2023-12-25 09:56:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:21,497 INFO L225 Difference]: With dead ends: 339 [2023-12-25 09:56:21,497 INFO L226 Difference]: Without dead ends: 215 [2023-12-25 09:56:21,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 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:56:21,498 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 508 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:21,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 231 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-25 09:56:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-12-25 09:56:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 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:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2023-12-25 09:56:21,502 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 48 [2023-12-25 09:56:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:21,502 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2023-12-25 09:56:21,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2023-12-25 09:56:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:56:21,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:21,503 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:56:21,510 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:56:21,708 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:56:21,708 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:21,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1923049146, now seen corresponding path program 1 times [2023-12-25 09:56:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:21,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150315565] [2023-12-25 09:56:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:21,709 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:21,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:21,710 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:56:21,711 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:56:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:21,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 09:56:21,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:22,895 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:22,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:22,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150315565] [2023-12-25 09:56:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150315565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:22,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-25 09:56:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739011567] [2023-12-25 09:56:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:22,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:56:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:56:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:56:22,897 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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:56:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:23,721 INFO L93 Difference]: Finished difference Result 315 states and 423 transitions. [2023-12-25 09:56:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 09:56:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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:56:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:23,723 INFO L225 Difference]: With dead ends: 315 [2023-12-25 09:56:23,723 INFO L226 Difference]: Without dead ends: 182 [2023-12-25 09:56:23,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 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:56:23,724 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 219 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:23,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 857 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:56:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-25 09:56:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-12-25 09:56:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 178 states have (on average 1.3370786516853932) internal successors, (238), 181 states have internal predecessors, (238), 0 states have call successors, (0), 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:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2023-12-25 09:56:23,730 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 50 [2023-12-25 09:56:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:23,730 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2023-12-25 09:56:23,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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:56:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2023-12-25 09:56:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 09:56:23,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:23,731 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:56:23,734 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:56:23,934 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:56:23,934 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:56:23,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -336264989, now seen corresponding path program 1 times [2023-12-25 09:56:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191619229] [2023-12-25 09:56:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:23,935 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:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:23,936 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:56:23,937 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:56:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:24,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:24,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:24,328 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:24,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:24,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191619229] [2023-12-25 09:56:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191619229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:56:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408966322] [2023-12-25 09:56:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:24,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:56:24,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:56:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:56:24,330 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 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:56:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:24,778 INFO L93 Difference]: Finished difference Result 304 states and 407 transitions. [2023-12-25 09:56:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:56:24,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 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:56:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:24,780 INFO L225 Difference]: With dead ends: 304 [2023-12-25 09:56:24,780 INFO L226 Difference]: Without dead ends: 190 [2023-12-25 09:56:24,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 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:56:24,781 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 775 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:24,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 320 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:56:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-25 09:56:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2023-12-25 09:56:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 178 states have (on average 1.3258426966292134) internal successors, (236), 181 states have internal predecessors, (236), 0 states have call successors, (0), 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:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 236 transitions. [2023-12-25 09:56:24,784 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 236 transitions. Word has length 51 [2023-12-25 09:56:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:24,784 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 236 transitions. [2023-12-25 09:56:24,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 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:56:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 236 transitions. [2023-12-25 09:56:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 09:56:24,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:24,785 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:56:24,802 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:56:25,001 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:56:25,002 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:25,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1070897787, now seen corresponding path program 1 times [2023-12-25 09:56:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984658926] [2023-12-25 09:56:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:25,003 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:25,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:25,018 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:56:25,019 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:56:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:25,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:56:25,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:26,273 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:26,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:26,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:26,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984658926] [2023-12-25 09:56:26,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984658926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:26,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:26,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-25 09:56:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131429481] [2023-12-25 09:56:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:26,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:56:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:26,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:56:26,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:56:26,275 INFO L87 Difference]: Start difference. First operand 182 states and 236 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 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:56:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:27,007 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2023-12-25 09:56:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 09:56:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 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:56:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:27,008 INFO L225 Difference]: With dead ends: 182 [2023-12-25 09:56:27,008 INFO L226 Difference]: Without dead ends: 166 [2023-12-25 09:56:27,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 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:56:27,009 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 139 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:27,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 794 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:56:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-25 09:56:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-12-25 09:56:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 164 states have (on average 1.329268292682927) internal successors, (218), 165 states have internal predecessors, (218), 0 states have call successors, (0), 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:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2023-12-25 09:56:27,012 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 51 [2023-12-25 09:56:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:27,012 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2023-12-25 09:56:27,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 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:56:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2023-12-25 09:56:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:56:27,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:27,012 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:56:27,037 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:56:27,213 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:56:27,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:27,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1737446413, now seen corresponding path program 1 times [2023-12-25 09:56:27,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:27,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345654924] [2023-12-25 09:56:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:27,214 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:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:27,215 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:56:27,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 (11)] Waiting until timeout for monitored process [2023-12-25 09:56:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:27,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 09:56:27,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:28,908 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:28,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:28,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345654924] [2023-12-25 09:56:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345654924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-25 09:56:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496001055] [2023-12-25 09:56:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:28,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:56:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:28,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:56:28,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:56:28,911 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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:56:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:32,048 INFO L93 Difference]: Finished difference Result 360 states and 502 transitions. [2023-12-25 09:56:32,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 09:56:32,049 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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:56:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:32,050 INFO L225 Difference]: With dead ends: 360 [2023-12-25 09:56:32,050 INFO L226 Difference]: Without dead ends: 263 [2023-12-25 09:56:32,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2023-12-25 09:56:32,051 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 307 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:32,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 910 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-25 09:56:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-12-25 09:56:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 172. [2023-12-25 09:56:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 171 states have internal predecessors, (225), 0 states have call successors, (0), 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:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 225 transitions. [2023-12-25 09:56:32,054 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 225 transitions. Word has length 53 [2023-12-25 09:56:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:32,054 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 225 transitions. [2023-12-25 09:56:32,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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:56:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 225 transitions. [2023-12-25 09:56:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:56:32,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:32,055 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] [2023-12-25 09:56:32,058 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:32,255 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:56:32,256 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-25 09:56:32,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1478570090, now seen corresponding path program 1 times [2023-12-25 09:56:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94540038] [2023-12-25 09:56:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:32,257 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:32,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:32,258 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:56:32,259 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:56:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:32,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:56:32,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:32,740 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:32,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:32,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:32,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94540038] [2023-12-25 09:56:32,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94540038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:32,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:32,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 09:56:32,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119979739] [2023-12-25 09:56:32,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:32,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:56:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:56:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:56:32,742 INFO L87 Difference]: Start difference. First operand 172 states and 225 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 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:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:33,123 INFO L93 Difference]: Finished difference Result 276 states and 376 transitions. [2023-12-25 09:56:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:56:33,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-12-25 09:56:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:33,124 INFO L225 Difference]: With dead ends: 276 [2023-12-25 09:56:33,124 INFO L226 Difference]: Without dead ends: 270 [2023-12-25 09:56:33,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 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:33,125 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 509 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:33,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 626 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-25 09:56:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 165. [2023-12-25 09:56:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.3231707317073171) internal successors, (217), 164 states have internal predecessors, (217), 0 states have call successors, (0), 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:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2023-12-25 09:56:33,129 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 54 [2023-12-25 09:56:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:33,129 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2023-12-25 09:56:33,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 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:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2023-12-25 09:56:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 09:56:33,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:33,130 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] [2023-12-25 09:56:33,132 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:56:33,332 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:56:33,332 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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:33,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -546984540, now seen corresponding path program 1 times [2023-12-25 09:56:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747363073] [2023-12-25 09:56:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:33,333 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:33,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:33,335 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:56:33,363 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:56:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:33,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:33,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:33,722 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:33,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:33,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:33,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747363073] [2023-12-25 09:56:33,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747363073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:33,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:56:33,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649701963] [2023-12-25 09:56:33,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:33,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:56:33,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:33,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:56:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:56:33,724 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:34,035 INFO L93 Difference]: Finished difference Result 261 states and 357 transitions. [2023-12-25 09:56:34,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 09:56:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2023-12-25 09:56:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:34,059 INFO L225 Difference]: With dead ends: 261 [2023-12-25 09:56:34,059 INFO L226 Difference]: Without dead ends: 165 [2023-12-25 09:56:34,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 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:34,060 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 329 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:34,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 212 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-25 09:56:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-12-25 09:56:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 164 states have internal predecessors, (214), 0 states have call successors, (0), 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:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2023-12-25 09:56:34,064 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 71 [2023-12-25 09:56:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:34,065 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2023-12-25 09:56:34,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2023-12-25 09:56:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-25 09:56:34,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:34,065 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:34,081 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:34,268 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:34,268 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:34,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1464591163, now seen corresponding path program 1 times [2023-12-25 09:56:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805135330] [2023-12-25 09:56:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:34,269 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:34,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:34,270 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:34,297 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:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:34,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:34,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:34,370 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:34,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:34,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:34,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805135330] [2023-12-25 09:56:34,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805135330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:34,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:34,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:34,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436299643] [2023-12-25 09:56:34,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:34,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:34,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:34,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:34,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:34,372 INFO L87 Difference]: Start difference. First operand 165 states and 214 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:34,384 INFO L93 Difference]: Finished difference Result 317 states and 446 transitions. [2023-12-25 09:56:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:34,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:34,385 INFO L225 Difference]: With dead ends: 317 [2023-12-25 09:56:34,385 INFO L226 Difference]: Without dead ends: 233 [2023-12-25 09:56:34,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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:34,386 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 65 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 239 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:34,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 239 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:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-25 09:56:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2023-12-25 09:56:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.3695652173913044) internal successors, (315), 230 states have internal predecessors, (315), 0 states have call successors, (0), 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:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 315 transitions. [2023-12-25 09:56:34,389 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 315 transitions. Word has length 74 [2023-12-25 09:56:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:34,389 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 315 transitions. [2023-12-25 09:56:34,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 315 transitions. [2023-12-25 09:56:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 09:56:34,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:34,390 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] [2023-12-25 09:56:34,393 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 (14)] Ended with exit code 0 [2023-12-25 09:56:34,592 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:34,593 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:34,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash 536613728, now seen corresponding path program 1 times [2023-12-25 09:56:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833061651] [2023-12-25 09:56:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:34,594 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:34,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:34,595 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:34,597 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:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:34,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:34,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:34,725 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:34,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:34,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:34,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833061651] [2023-12-25 09:56:34,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833061651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:34,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:34,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754046358] [2023-12-25 09:56:34,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:34,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:34,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:34,727 INFO L87 Difference]: Start difference. First operand 231 states and 315 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:34,737 INFO L93 Difference]: Finished difference Result 499 states and 725 transitions. [2023-12-25 09:56:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:34,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2023-12-25 09:56:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:34,738 INFO L225 Difference]: With dead ends: 499 [2023-12-25 09:56:34,739 INFO L226 Difference]: Without dead ends: 349 [2023-12-25 09:56:34,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 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:34,739 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 57 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 240 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:34,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 240 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:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-12-25 09:56:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2023-12-25 09:56:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4190751445086704) internal successors, (491), 346 states have internal predecessors, (491), 0 states have call successors, (0), 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:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 491 transitions. [2023-12-25 09:56:34,744 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 491 transitions. Word has length 75 [2023-12-25 09:56:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:34,744 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 491 transitions. [2023-12-25 09:56:34,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 491 transitions. [2023-12-25 09:56:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-25 09:56:34,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:34,745 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] [2023-12-25 09:56:34,748 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 (15)] Ended with exit code 0 [2023-12-25 09:56:34,947 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:34,947 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:34,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1161491148, now seen corresponding path program 1 times [2023-12-25 09:56:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317940757] [2023-12-25 09:56:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:34,948 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:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:34,949 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:34,950 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:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:35,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:35,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:35,361 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:35,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:35,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:35,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317940757] [2023-12-25 09:56:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317940757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:35,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95450213] [2023-12-25 09:56:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:35,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:35,363 INFO L87 Difference]: Start difference. First operand 347 states and 491 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:35,417 INFO L93 Difference]: Finished difference Result 1411 states and 2111 transitions. [2023-12-25 09:56:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:35,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2023-12-25 09:56:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:35,421 INFO L225 Difference]: With dead ends: 1411 [2023-12-25 09:56:35,421 INFO L226 Difference]: Without dead ends: 1145 [2023-12-25 09:56:35,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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:35,421 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 226 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:35,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 355 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2023-12-25 09:56:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 875. [2023-12-25 09:56:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.4588100686498855) internal successors, (1275), 874 states have internal predecessors, (1275), 0 states have call successors, (0), 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:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1275 transitions. [2023-12-25 09:56:35,432 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1275 transitions. Word has length 76 [2023-12-25 09:56:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:35,433 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1275 transitions. [2023-12-25 09:56:35,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1275 transitions. [2023-12-25 09:56:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-25 09:56:35,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:35,433 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:35,453 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:35,635 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:35,636 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:35,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash -674968363, now seen corresponding path program 1 times [2023-12-25 09:56:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:35,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853706428] [2023-12-25 09:56:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:35,637 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:35,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:35,638 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:35,640 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:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:35,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:56:35,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:35,807 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:35,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:35,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:35,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853706428] [2023-12-25 09:56:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853706428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:35,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925966695] [2023-12-25 09:56:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:35,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:56:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:35,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:56:35,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:56:35,809 INFO L87 Difference]: Start difference. First operand 875 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:35,858 INFO L93 Difference]: Finished difference Result 2335 states and 3429 transitions. [2023-12-25 09:56:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 09:56:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:35,879 INFO L225 Difference]: With dead ends: 2335 [2023-12-25 09:56:35,879 INFO L226 Difference]: Without dead ends: 1541 [2023-12-25 09:56:35,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 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:35,880 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 40 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:35,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 288 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2023-12-25 09:56:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1515. [2023-12-25 09:56:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 1.4207397622192866) internal successors, (2151), 1514 states have internal predecessors, (2151), 0 states have call successors, (0), 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:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2151 transitions. [2023-12-25 09:56:35,922 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2151 transitions. Word has length 78 [2023-12-25 09:56:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:35,923 INFO L495 AbstractCegarLoop]: Abstraction has 1515 states and 2151 transitions. [2023-12-25 09:56:35,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2151 transitions. [2023-12-25 09:56:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 09:56:35,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:35,924 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:35,937 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:36,136 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:36,136 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:36,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1948763092, now seen corresponding path program 1 times [2023-12-25 09:56:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520809242] [2023-12-25 09:56:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:36,137 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,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:36,138 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:36,155 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:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:36,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:56:36,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:36,262 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:36,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:36,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520809242] [2023-12-25 09:56:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520809242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885125613] [2023-12-25 09:56:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:36,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:36,263 INFO L87 Difference]: Start difference. First operand 1515 states and 2151 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:36,324 INFO L93 Difference]: Finished difference Result 2847 states and 4007 transitions. [2023-12-25 09:56:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 09:56:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:36,332 INFO L225 Difference]: With dead ends: 2847 [2023-12-25 09:56:36,332 INFO L226 Difference]: Without dead ends: 2845 [2023-12-25 09:56:36,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 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:36,334 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 205 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:36,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 502 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2023-12-25 09:56:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1611. [2023-12-25 09:56:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.3906832298136647) internal successors, (2239), 1610 states have internal predecessors, (2239), 0 states have call successors, (0), 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,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2239 transitions. [2023-12-25 09:56:36,363 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2239 transitions. Word has length 79 [2023-12-25 09:56:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:36,364 INFO L495 AbstractCegarLoop]: Abstraction has 1611 states and 2239 transitions. [2023-12-25 09:56:36,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2239 transitions. [2023-12-25 09:56:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 09:56:36,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:36,365 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:36,368 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:36,567 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:36,568 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:36,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash 68512103, now seen corresponding path program 1 times [2023-12-25 09:56:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217650504] [2023-12-25 09:56:36,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:36,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:56:36,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:36,570 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:36,605 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:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:36,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:36,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:36,702 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:36,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:36,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:36,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217650504] [2023-12-25 09:56:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217650504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448086908] [2023-12-25 09:56:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:36,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:36,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:36,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:36,706 INFO L87 Difference]: Start difference. First operand 1611 states and 2239 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:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:36,728 INFO L93 Difference]: Finished difference Result 3109 states and 4397 transitions. [2023-12-25 09:56:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:36,729 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:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:36,735 INFO L225 Difference]: With dead ends: 3109 [2023-12-25 09:56:36,735 INFO L226 Difference]: Without dead ends: 2241 [2023-12-25 09:56:36,737 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:36,737 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 69 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 241 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:36,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 241 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:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2023-12-25 09:56:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2239. [2023-12-25 09:56:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 2238 states have (on average 1.3882931188561216) internal successors, (3107), 2238 states have internal predecessors, (3107), 0 states have call successors, (0), 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,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3107 transitions. [2023-12-25 09:56:36,771 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3107 transitions. Word has length 79 [2023-12-25 09:56:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:36,771 INFO L495 AbstractCegarLoop]: Abstraction has 2239 states and 3107 transitions. [2023-12-25 09:56:36,771 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:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3107 transitions. [2023-12-25 09:56:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-25 09:56:36,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:36,773 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 09:56:36,785 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 (19)] Ended with exit code 0 [2023-12-25 09:56:36,977 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:36,977 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:36,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash 588579121, now seen corresponding path program 1 times [2023-12-25 09:56:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:36,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517593078] [2023-12-25 09:56:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:36,978 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,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:36,979 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:36,985 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:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:37,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:37,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:37,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:37,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517593078] [2023-12-25 09:56:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517593078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:37,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:37,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897033715] [2023-12-25 09:56:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:37,109 INFO L87 Difference]: Start difference. First operand 2239 states and 3107 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:37,126 INFO L93 Difference]: Finished difference Result 3785 states and 5296 transitions. [2023-12-25 09:56:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-25 09:56:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:37,130 INFO L225 Difference]: With dead ends: 3785 [2023-12-25 09:56:37,130 INFO L226 Difference]: Without dead ends: 1631 [2023-12-25 09:56:37,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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,132 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 56 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 236 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,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 236 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,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2023-12-25 09:56:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1629. [2023-12-25 09:56:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1628 states have (on average 1.3832923832923834) internal successors, (2252), 1628 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:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2252 transitions. [2023-12-25 09:56:37,147 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2252 transitions. Word has length 99 [2023-12-25 09:56:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:37,147 INFO L495 AbstractCegarLoop]: Abstraction has 1629 states and 2252 transitions. [2023-12-25 09:56:37,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2252 transitions. [2023-12-25 09:56:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 09:56:37,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:37,148 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 09:56:37,154 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 (20)] Ended with exit code 0 [2023-12-25 09:56:37,351 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:37,352 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:37,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 946591999, now seen corresponding path program 1 times [2023-12-25 09:56:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939749114] [2023-12-25 09:56:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:37,353 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,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:37,354 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:37,357 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:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:37,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 09:56:37,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:38,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:38,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:38,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939749114] [2023-12-25 09:56:38,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939749114] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:38,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:38,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-12-25 09:56:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374196865] [2023-12-25 09:56:38,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:38,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 09:56:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:38,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 09:56:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2023-12-25 09:56:38,401 INFO L87 Difference]: Start difference. First operand 1629 states and 2252 transitions. Second operand has 22 states, 22 states have (on average 8.590909090909092) internal successors, (189), 21 states have internal predecessors, (189), 0 states have call successors, (0), 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:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:42,328 INFO L93 Difference]: Finished difference Result 10270 states and 14208 transitions. [2023-12-25 09:56:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-25 09:56:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.590909090909092) internal successors, (189), 21 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-25 09:56:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:42,348 INFO L225 Difference]: With dead ends: 10270 [2023-12-25 09:56:42,348 INFO L226 Difference]: Without dead ends: 8755 [2023-12-25 09:56:42,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1336, Invalid=4516, Unknown=0, NotChecked=0, Total=5852 [2023-12-25 09:56:42,354 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 3721 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3721 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:42,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3721 Valid, 1087 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 09:56:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8755 states. [2023-12-25 09:56:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8755 to 1622. [2023-12-25 09:56:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1621 states have (on average 1.3818630475015423) internal successors, (2240), 1621 states have internal predecessors, (2240), 0 states have call successors, (0), 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:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2240 transitions. [2023-12-25 09:56:42,398 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2240 transitions. Word has length 100 [2023-12-25 09:56:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:42,398 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 2240 transitions. [2023-12-25 09:56:42,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.590909090909092) internal successors, (189), 21 states have internal predecessors, (189), 0 states have call successors, (0), 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:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2240 transitions. [2023-12-25 09:56:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 09:56:42,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:42,399 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 09:56:42,402 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:42,601 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:42,602 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:42,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -333076103, now seen corresponding path program 1 times [2023-12-25 09:56:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639686779] [2023-12-25 09:56:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:42,603 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:42,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:42,604 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:42,634 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:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:42,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:56:42,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:43,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:43,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639686779] [2023-12-25 09:56:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639686779] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:43,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 09:56:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207580219] [2023-12-25 09:56:43,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 09:56:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 09:56:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 09:56:43,583 INFO L87 Difference]: Start difference. First operand 1622 states and 2240 transitions. Second operand has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 0 states have call successors, (0), 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:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:48,674 INFO L93 Difference]: Finished difference Result 9515 states and 12929 transitions. [2023-12-25 09:56:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-25 09:56:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-25 09:56:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:48,690 INFO L225 Difference]: With dead ends: 9515 [2023-12-25 09:56:48,690 INFO L226 Difference]: Without dead ends: 7989 [2023-12-25 09:56:48,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1992, Invalid=8310, Unknown=0, NotChecked=0, Total=10302 [2023-12-25 09:56:48,697 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3055 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:48,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 1122 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 09:56:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7989 states. [2023-12-25 09:56:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7989 to 1622. [2023-12-25 09:56:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1621 states have (on average 1.3744602097470697) internal successors, (2228), 1621 states have internal predecessors, (2228), 0 states have call successors, (0), 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:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2228 transitions. [2023-12-25 09:56:48,734 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2228 transitions. Word has length 100 [2023-12-25 09:56:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:48,734 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 2228 transitions. [2023-12-25 09:56:48,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 23 states have internal predecessors, (183), 0 states have call successors, (0), 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:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2228 transitions. [2023-12-25 09:56:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 09:56:48,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:48,735 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 09:56:48,738 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 (22)] Ended with exit code 0 [2023-12-25 09:56:48,938 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:48,938 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:48,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1033215526, now seen corresponding path program 1 times [2023-12-25 09:56:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:48,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864243663] [2023-12-25 09:56:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:48,939 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:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:48,940 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:48,941 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:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:49,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:49,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:49,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:49,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864243663] [2023-12-25 09:56:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864243663] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:49,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:56:49,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707999047] [2023-12-25 09:56:49,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:49,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:56:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:49,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:56:49,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:56:49,733 INFO L87 Difference]: Start difference. First operand 1622 states and 2228 transitions. Second operand has 16 states, 16 states have (on average 12.1875) internal successors, (195), 15 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 09:56:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:52,256 INFO L93 Difference]: Finished difference Result 7204 states and 9853 transitions. [2023-12-25 09:56:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-25 09:56:52,256 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.1875) internal successors, (195), 15 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 101 [2023-12-25 09:56:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:52,262 INFO L225 Difference]: With dead ends: 7204 [2023-12-25 09:56:52,262 INFO L226 Difference]: Without dead ends: 5678 [2023-12-25 09:56:52,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1229, Invalid=3601, Unknown=0, NotChecked=0, Total=4830 [2023-12-25 09:56:52,265 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1262 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:52,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 973 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:56:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2023-12-25 09:56:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 1706. [2023-12-25 09:56:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.363049853372434) internal successors, (2324), 1705 states have internal predecessors, (2324), 0 states have call successors, (0), 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:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2324 transitions. [2023-12-25 09:56:52,293 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2324 transitions. Word has length 101 [2023-12-25 09:56:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:52,293 INFO L495 AbstractCegarLoop]: Abstraction has 1706 states and 2324 transitions. [2023-12-25 09:56:52,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.1875) internal successors, (195), 15 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 09:56:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2324 transitions. [2023-12-25 09:56:52,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:56:52,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:52,294 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 09:56:52,297 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 (23)] Ended with exit code 0 [2023-12-25 09:56:52,497 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:52,497 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:52,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1348262702, now seen corresponding path program 1 times [2023-12-25 09:56:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:52,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84354354] [2023-12-25 09:56:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:52,498 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:52,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:52,500 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:52,500 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:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:52,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:52,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:52,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:52,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:52,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84354354] [2023-12-25 09:56:52,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84354354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:52,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:52,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:52,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016294037] [2023-12-25 09:56:52,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:52,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:52,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:52,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:52,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:52,648 INFO L87 Difference]: Start difference. First operand 1706 states and 2324 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 09:56:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:52,664 INFO L93 Difference]: Finished difference Result 2514 states and 3430 transitions. [2023-12-25 09:56:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:52,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-25 09:56:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:52,666 INFO L225 Difference]: With dead ends: 2514 [2023-12-25 09:56:52,666 INFO L226 Difference]: Without dead ends: 904 [2023-12-25 09:56:52,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 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:52,667 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 212 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:52,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 212 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:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2023-12-25 09:56:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 902. [2023-12-25 09:56:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.320754716981132) internal successors, (1190), 901 states have internal predecessors, (1190), 0 states have call successors, (0), 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:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1190 transitions. [2023-12-25 09:56:52,675 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1190 transitions. Word has length 102 [2023-12-25 09:56:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:52,675 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 1190 transitions. [2023-12-25 09:56:52,675 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 09:56:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1190 transitions. [2023-12-25 09:56:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:56:52,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:52,676 INFO L195 NwaCegarLoop]: trace histogram [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:52,681 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:52,879 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:52,879 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:52,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1246415762, now seen corresponding path program 1 times [2023-12-25 09:56:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548434843] [2023-12-25 09:56:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:52,880 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:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:52,881 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:52,882 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:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:52,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:52,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 09:56:53,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:53,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:53,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548434843] [2023-12-25 09:56:53,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548434843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:53,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:53,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:53,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044887314] [2023-12-25 09:56:53,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:53,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:53,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:53,226 INFO L87 Difference]: Start difference. First operand 902 states and 1190 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:53,283 INFO L93 Difference]: Finished difference Result 1982 states and 2650 transitions. [2023-12-25 09:56:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:53,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-25 09:56:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:53,286 INFO L225 Difference]: With dead ends: 1982 [2023-12-25 09:56:53,286 INFO L226 Difference]: Without dead ends: 1712 [2023-12-25 09:56:53,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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:53,288 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 145 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:53,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 423 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-12-25 09:56:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1438. [2023-12-25 09:56:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.3096729297146834) internal successors, (1882), 1437 states have internal predecessors, (1882), 0 states have call successors, (0), 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:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1882 transitions. [2023-12-25 09:56:53,319 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1882 transitions. Word has length 102 [2023-12-25 09:56:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:53,319 INFO L495 AbstractCegarLoop]: Abstraction has 1438 states and 1882 transitions. [2023-12-25 09:56:53,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1882 transitions. [2023-12-25 09:56:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:56:53,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:53,320 INFO L195 NwaCegarLoop]: trace histogram [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:53,323 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 (25)] Ended with exit code 0 [2023-12-25 09:56:53,523 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:53,523 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:53,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 821285902, now seen corresponding path program 1 times [2023-12-25 09:56:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:53,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861849769] [2023-12-25 09:56:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:53,524 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:53,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:53,526 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:53,527 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:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:53,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:53,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:56:53,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:53,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:53,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861849769] [2023-12-25 09:56:53,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861849769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:53,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:53,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134418094] [2023-12-25 09:56:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:53,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:53,879 INFO L87 Difference]: Start difference. First operand 1438 states and 1882 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:53,931 INFO L93 Difference]: Finished difference Result 2250 states and 2996 transitions. [2023-12-25 09:56:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-25 09:56:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:53,933 INFO L225 Difference]: With dead ends: 2250 [2023-12-25 09:56:53,933 INFO L226 Difference]: Without dead ends: 1444 [2023-12-25 09:56:53,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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:53,935 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 151 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:53,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 443 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-12-25 09:56:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1170. [2023-12-25 09:56:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.2934131736526946) internal successors, (1512), 1169 states have internal predecessors, (1512), 0 states have call successors, (0), 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:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1512 transitions. [2023-12-25 09:56:53,950 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1512 transitions. Word has length 102 [2023-12-25 09:56:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:53,951 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1512 transitions. [2023-12-25 09:56:53,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1512 transitions. [2023-12-25 09:56:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:56:53,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:53,952 INFO L195 NwaCegarLoop]: trace histogram [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:53,966 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 (26)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:54,155 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:54,155 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:54,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash -391892911, now seen corresponding path program 1 times [2023-12-25 09:56:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82270452] [2023-12-25 09:56:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:54,157 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:54,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:54,173 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:54,193 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:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:54,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:54,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:56:54,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:54,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:54,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82270452] [2023-12-25 09:56:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82270452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:54,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442905136] [2023-12-25 09:56:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:54,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:54,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:54,520 INFO L87 Difference]: Start difference. First operand 1170 states and 1512 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:54,570 INFO L93 Difference]: Finished difference Result 1982 states and 2626 transitions. [2023-12-25 09:56:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-25 09:56:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:54,573 INFO L225 Difference]: With dead ends: 1982 [2023-12-25 09:56:54,573 INFO L226 Difference]: Without dead ends: 1712 [2023-12-25 09:56:54,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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:54,574 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 174 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:54,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 419 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-12-25 09:56:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1438. [2023-12-25 09:56:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.2929714683368128) internal successors, (1858), 1437 states have internal predecessors, (1858), 0 states have call successors, (0), 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:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1858 transitions. [2023-12-25 09:56:54,589 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1858 transitions. Word has length 102 [2023-12-25 09:56:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:54,589 INFO L495 AbstractCegarLoop]: Abstraction has 1438 states and 1858 transitions. [2023-12-25 09:56:54,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1858 transitions. [2023-12-25 09:56:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 09:56:54,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:54,590 INFO L195 NwaCegarLoop]: trace histogram [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:54,593 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:54,793 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:54,793 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:54,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash 370287225, now seen corresponding path program 1 times [2023-12-25 09:56:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:54,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535887312] [2023-12-25 09:56:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:54,794 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:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:54,795 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:54,826 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:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:54,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 09:56:54,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:55,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:56,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:56,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535887312] [2023-12-25 09:56:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535887312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:56,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:56,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2023-12-25 09:56:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363428437] [2023-12-25 09:56:56,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:56,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 09:56:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 09:56:56,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 09:56:56,712 INFO L87 Difference]: Start difference. First operand 1438 states and 1858 transitions. Second operand has 34 states, 34 states have (on average 5.794117647058823) internal successors, (197), 34 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:57:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:54,854 INFO L93 Difference]: Finished difference Result 49706 states and 64007 transitions. [2023-12-25 09:57:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 457 states. [2023-12-25 09:57:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.794117647058823) internal successors, (197), 34 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 103 [2023-12-25 09:57:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:54,943 INFO L225 Difference]: With dead ends: 49706 [2023-12-25 09:57:54,943 INFO L226 Difference]: Without dead ends: 48900 [2023-12-25 09:57:54,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102248 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=19405, Invalid=213401, Unknown=0, NotChecked=0, Total=232806 [2023-12-25 09:57:54,970 INFO L413 NwaCegarLoop]: 784 mSDtfsCounter, 7715 mSDsluCounter, 12400 mSDsCounter, 0 mSdLazyCounter, 6072 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7715 SdHoareTripleChecker+Valid, 13184 SdHoareTripleChecker+Invalid, 6301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 6072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:54,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7715 Valid, 13184 Invalid, 6301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [229 Valid, 6072 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-25 09:57:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48900 states. [2023-12-25 09:57:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48900 to 12825. [2023-12-25 09:57:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12825 states, 12824 states have (on average 1.2996724890829694) internal successors, (16667), 12824 states have internal predecessors, (16667), 0 states have call successors, (0), 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:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12825 states to 12825 states and 16667 transitions. [2023-12-25 09:57:55,289 INFO L78 Accepts]: Start accepts. Automaton has 12825 states and 16667 transitions. Word has length 103 [2023-12-25 09:57:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:55,290 INFO L495 AbstractCegarLoop]: Abstraction has 12825 states and 16667 transitions. [2023-12-25 09:57:55,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.794117647058823) internal successors, (197), 34 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:57:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 12825 states and 16667 transitions. [2023-12-25 09:57:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 09:57:55,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:55,294 INFO L195 NwaCegarLoop]: trace histogram [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:57:55,299 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:57:55,497 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:57:55,498 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:57:55,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1090691830, now seen corresponding path program 1 times [2023-12-25 09:57:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766417451] [2023-12-25 09:57:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:55,499 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:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:55,500 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:57:55,501 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:57:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:55,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:57:55,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:56,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:56,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:56,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766417451] [2023-12-25 09:57:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766417451] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:56,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 09:57:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803861299] [2023-12-25 09:57:56,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:56,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 09:57:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 09:57:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-12-25 09:57:56,611 INFO L87 Difference]: Start difference. First operand 12825 states and 16667 transitions. Second operand has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 21 states have internal predecessors, (193), 0 states have call successors, (0), 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:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:01,540 INFO L93 Difference]: Finished difference Result 64929 states and 83801 transitions. [2023-12-25 09:58:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-25 09:58:01,541 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 21 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-25 09:58:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:01,635 INFO L225 Difference]: With dead ends: 64929 [2023-12-25 09:58:01,635 INFO L226 Difference]: Without dead ends: 54282 [2023-12-25 09:58:01,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1410, Invalid=4596, Unknown=0, NotChecked=0, Total=6006 [2023-12-25 09:58:01,656 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 2171 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:01,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 2573 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:58:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54282 states. [2023-12-25 09:58:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54282 to 19352. [2023-12-25 09:58:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19352 states, 19351 states have (on average 1.2966771743062373) internal successors, (25092), 19351 states have internal predecessors, (25092), 0 states have call successors, (0), 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:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19352 states to 19352 states and 25092 transitions. [2023-12-25 09:58:02,074 INFO L78 Accepts]: Start accepts. Automaton has 19352 states and 25092 transitions. Word has length 103 [2023-12-25 09:58:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:02,074 INFO L495 AbstractCegarLoop]: Abstraction has 19352 states and 25092 transitions. [2023-12-25 09:58:02,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 21 states have internal predecessors, (193), 0 states have call successors, (0), 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:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 19352 states and 25092 transitions. [2023-12-25 09:58:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 09:58:02,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:02,078 INFO L195 NwaCegarLoop]: trace histogram [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:58:02,081 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:58:02,280 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:58:02,281 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:58:02,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1031781083, now seen corresponding path program 1 times [2023-12-25 09:58:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022621349] [2023-12-25 09:58:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:02,282 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:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:02,283 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:58:02,284 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:58:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:02,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 09:58:02,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:02,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:03,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022621349] [2023-12-25 09:58:03,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022621349] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:03,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:03,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 09:58:03,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406825907] [2023-12-25 09:58:03,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:03,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 09:58:03,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:03,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 09:58:03,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:58:03,113 INFO L87 Difference]: Start difference. First operand 19352 states and 25092 transitions. Second operand has 19 states, 19 states have (on average 9.789473684210526) internal successors, (186), 19 states have internal predecessors, (186), 0 states have call successors, (0), 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:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:04,500 INFO L93 Difference]: Finished difference Result 48689 states and 63240 transitions. [2023-12-25 09:58:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 09:58:04,501 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.789473684210526) internal successors, (186), 19 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-25 09:58:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:04,538 INFO L225 Difference]: With dead ends: 48689 [2023-12-25 09:58:04,538 INFO L226 Difference]: Without dead ends: 36848 [2023-12-25 09:58:04,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 09:58:04,555 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 1278 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:04,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 2588 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:58:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36848 states. [2023-12-25 09:58:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36848 to 24863. [2023-12-25 09:58:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24863 states, 24862 states have (on average 1.2940632290242136) internal successors, (32173), 24862 states have internal predecessors, (32173), 0 states have call successors, (0), 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:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24863 states to 24863 states and 32173 transitions. [2023-12-25 09:58:04,937 INFO L78 Accepts]: Start accepts. Automaton has 24863 states and 32173 transitions. Word has length 103 [2023-12-25 09:58:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:04,937 INFO L495 AbstractCegarLoop]: Abstraction has 24863 states and 32173 transitions. [2023-12-25 09:58:04,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.789473684210526) internal successors, (186), 19 states have internal predecessors, (186), 0 states have call successors, (0), 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:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 24863 states and 32173 transitions. [2023-12-25 09:58:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 09:58:04,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:04,942 INFO L195 NwaCegarLoop]: trace histogram [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:58:04,947 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:05,144 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:05,145 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:05,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 901802335, now seen corresponding path program 1 times [2023-12-25 09:58:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:05,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191429030] [2023-12-25 09:58:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:05,146 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:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:05,147 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:05,147 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:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:05,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 09:58:05,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:07,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:08,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:08,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191429030] [2023-12-25 09:58:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191429030] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:08,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:08,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2023-12-25 09:58:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713309350] [2023-12-25 09:58:08,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:08,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-25 09:58:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-25 09:58:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 09:58:08,033 INFO L87 Difference]: Start difference. First operand 24863 states and 32173 transitions. Second operand has 37 states, 37 states have (on average 5.324324324324325) internal successors, (197), 37 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:59:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:59:08,961 INFO L93 Difference]: Finished difference Result 104589 states and 134697 transitions. [2023-12-25 09:59:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2023-12-25 09:59:08,962 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.324324324324325) internal successors, (197), 37 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 103 [2023-12-25 09:59:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:59:09,071 INFO L225 Difference]: With dead ends: 104589 [2023-12-25 09:59:09,072 INFO L226 Difference]: Without dead ends: 100405 [2023-12-25 09:59:09,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23508 ImplicationChecksByTransitivity, 54.8s TimeCoverageRelationStatistics Valid=8451, Invalid=51819, Unknown=0, NotChecked=0, Total=60270 [2023-12-25 09:59:09,103 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 4798 mSDsluCounter, 4896 mSDsCounter, 0 mSdLazyCounter, 3776 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4798 SdHoareTripleChecker+Valid, 5215 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 3776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:59:09,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4798 Valid, 5215 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 3776 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-25 09:59:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100405 states. [2023-12-25 09:59:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100405 to 34705. [2023-12-25 09:59:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34705 states, 34704 states have (on average 1.298812816966344) internal successors, (45074), 34704 states have internal predecessors, (45074), 0 states have call successors, (0), 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:59:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34705 states to 34705 states and 45074 transitions. [2023-12-25 09:59:09,860 INFO L78 Accepts]: Start accepts. Automaton has 34705 states and 45074 transitions. Word has length 103 [2023-12-25 09:59:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:59:09,861 INFO L495 AbstractCegarLoop]: Abstraction has 34705 states and 45074 transitions. [2023-12-25 09:59:09,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.324324324324325) internal successors, (197), 37 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:59:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34705 states and 45074 transitions. [2023-12-25 09:59:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 09:59:09,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:59:09,867 INFO L195 NwaCegarLoop]: trace histogram [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:59:09,869 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:59:10,069 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:59:10,069 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:59:10,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:59:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash 173450493, now seen corresponding path program 1 times [2023-12-25 09:59:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:59:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728595380] [2023-12-25 09:59:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:59:10,070 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:59:10,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:59:10,071 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:59:10,099 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:59:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:59:10,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 09:59:10,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:59:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:12,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:59:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:13,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:59:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728595380] [2023-12-25 09:59:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728595380] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:59:13,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:59:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2023-12-25 09:59:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539502726] [2023-12-25 09:59:13,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:59:13,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:59:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:59:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:59:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:59:13,043 INFO L87 Difference]: Start difference. First operand 34705 states and 45074 transitions. Second operand has 38 states, 38 states have (on average 5.184210526315789) internal successors, (197), 38 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 10:03:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:07,413 INFO L93 Difference]: Finished difference Result 132217 states and 170094 transitions. [2023-12-25 10:03:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 669 states. [2023-12-25 10:03:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.184210526315789) internal successors, (197), 38 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 103 [2023-12-25 10:03:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:07,577 INFO L225 Difference]: With dead ends: 132217 [2023-12-25 10:03:07,577 INFO L226 Difference]: Without dead ends: 129666 [2023-12-25 10:03:07,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 701 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230263 ImplicationChecksByTransitivity, 217.3s TimeCoverageRelationStatistics Valid=39384, Invalid=454122, Unknown=0, NotChecked=0, Total=493506 [2023-12-25 10:03:07,627 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 8601 mSDsluCounter, 10558 mSDsCounter, 0 mSdLazyCounter, 8211 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8601 SdHoareTripleChecker+Valid, 11145 SdHoareTripleChecker+Invalid, 8415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 8211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:03:07,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8601 Valid, 11145 Invalid, 8415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [204 Valid, 8211 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2023-12-25 10:03:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129666 states. [2023-12-25 10:03:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129666 to 43610. [2023-12-25 10:03:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43610 states, 43609 states have (on average 1.2995023962943428) internal successors, (56670), 43609 states have internal predecessors, (56670), 0 states have call successors, (0), 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:03:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43610 states to 43610 states and 56670 transitions. [2023-12-25 10:03:08,639 INFO L78 Accepts]: Start accepts. Automaton has 43610 states and 56670 transitions. Word has length 103 [2023-12-25 10:03:08,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:08,639 INFO L495 AbstractCegarLoop]: Abstraction has 43610 states and 56670 transitions. [2023-12-25 10:03:08,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.184210526315789) internal successors, (197), 38 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 10:03:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 43610 states and 56670 transitions. [2023-12-25 10:03:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:03:08,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:08,645 INFO L195 NwaCegarLoop]: trace histogram [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:03:08,648 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 (32)] Ended with exit code 0 [2023-12-25 10:03:08,848 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:03:08,848 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:03:08,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1859614591, now seen corresponding path program 1 times [2023-12-25 10:03:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:08,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6854410] [2023-12-25 10:03:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:08,849 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:03:08,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:08,850 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:03:08,876 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:03:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:08,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:03:08,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 10:03:08,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:03:08,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6854410] [2023-12-25 10:03:08,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6854410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:03:08,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:03:08,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:03:08,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782967655] [2023-12-25 10:03:08,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:03:08,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:03:08,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:08,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:03:08,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:03:08,969 INFO L87 Difference]: Start difference. First operand 43610 states and 56670 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:03:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:09,119 INFO L93 Difference]: Finished difference Result 70155 states and 91274 transitions. [2023-12-25 10:03:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:03:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-25 10:03:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:09,147 INFO L225 Difference]: With dead ends: 70155 [2023-12-25 10:03:09,148 INFO L226 Difference]: Without dead ends: 27012 [2023-12-25 10:03:09,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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:03:09,176 INFO L413 NwaCegarLoop]: 85 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, 101 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:03:09,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 101 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:03:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27012 states. [2023-12-25 10:03:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27012 to 26734. [2023-12-25 10:03:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26734 states, 26733 states have (on average 1.2829087644484345) internal successors, (34296), 26733 states have internal predecessors, (34296), 0 states have call successors, (0), 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:03:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26734 states to 26734 states and 34296 transitions. [2023-12-25 10:03:09,537 INFO L78 Accepts]: Start accepts. Automaton has 26734 states and 34296 transitions. Word has length 104 [2023-12-25 10:03:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:09,537 INFO L495 AbstractCegarLoop]: Abstraction has 26734 states and 34296 transitions. [2023-12-25 10:03:09,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:03:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26734 states and 34296 transitions. [2023-12-25 10:03:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:03:09,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:09,541 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 10:03:09,543 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 (33)] Ended with exit code 0 [2023-12-25 10:03:09,743 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:03:09,743 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:03:09,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash 331856307, now seen corresponding path program 1 times [2023-12-25 10:03:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:09,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108002754] [2023-12-25 10:03:09,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:09,744 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:03:09,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:09,745 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:03:09,779 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:03:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:09,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:03:09,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 10:03:09,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:03:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 10:03:10,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108002754] [2023-12-25 10:03:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108002754] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:03:10,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:03:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 10:03:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681767697] [2023-12-25 10:03:10,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:03:10,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:03:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:10,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:03:10,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:03:10,051 INFO L87 Difference]: Start difference. First operand 26734 states and 34296 transitions. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 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:03:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:10,327 INFO L93 Difference]: Finished difference Result 72154 states and 91428 transitions. [2023-12-25 10:03:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:03:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 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 10:03:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:10,374 INFO L225 Difference]: With dead ends: 72154 [2023-12-25 10:03:10,375 INFO L226 Difference]: Without dead ends: 46146 [2023-12-25 10:03:10,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 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:03:10,395 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 130 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:03:10,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 521 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:03:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46146 states. [2023-12-25 10:03:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46146 to 38930. [2023-12-25 10:03:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38930 states, 38929 states have (on average 1.2316781833594492) internal successors, (47948), 38929 states have internal predecessors, (47948), 0 states have call successors, (0), 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:03:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38930 states to 38930 states and 47948 transitions. [2023-12-25 10:03:10,922 INFO L78 Accepts]: Start accepts. Automaton has 38930 states and 47948 transitions. Word has length 104 [2023-12-25 10:03:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:10,922 INFO L495 AbstractCegarLoop]: Abstraction has 38930 states and 47948 transitions. [2023-12-25 10:03:10,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 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:03:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 38930 states and 47948 transitions. [2023-12-25 10:03:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:03:10,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:10,925 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] [2023-12-25 10:03:10,930 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:03:11,128 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:03:11,128 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:03:11,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 914302803, now seen corresponding path program 1 times [2023-12-25 10:03:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803377081] [2023-12-25 10:03:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:11,130 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:03:11,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:11,132 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:03:11,133 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:03:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:11,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 10:03:11,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:03:12,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:03:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:03:13,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:13,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803377081] [2023-12-25 10:03:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803377081] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:03:13,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:03:13,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2023-12-25 10:03:13,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584431180] [2023-12-25 10:03:13,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:03:13,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 10:03:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:13,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 10:03:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2023-12-25 10:03:13,108 INFO L87 Difference]: Start difference. First operand 38930 states and 47948 transitions. Second operand has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 29 states have internal predecessors, (188), 0 states have call successors, (0), 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:03:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:29,990 INFO L93 Difference]: Finished difference Result 88366 states and 108518 transitions. [2023-12-25 10:03:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-25 10:03:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 29 states have internal predecessors, (188), 0 states have call successors, (0), 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 10:03:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:30,062 INFO L225 Difference]: With dead ends: 88366 [2023-12-25 10:03:30,063 INFO L226 Difference]: Without dead ends: 66573 [2023-12-25 10:03:30,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2440 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1170, Invalid=7760, Unknown=0, NotChecked=0, Total=8930 [2023-12-25 10:03:30,088 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 2510 mSDsluCounter, 6669 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2510 SdHoareTripleChecker+Valid, 7146 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:03:30,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2510 Valid, 7146 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 10:03:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66573 states. [2023-12-25 10:03:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66573 to 41925. [2023-12-25 10:03:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41925 states, 41924 states have (on average 1.2286041408262571) internal successors, (51508), 41924 states have internal predecessors, (51508), 0 states have call successors, (0), 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:03:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41925 states to 41925 states and 51508 transitions. [2023-12-25 10:03:30,714 INFO L78 Accepts]: Start accepts. Automaton has 41925 states and 51508 transitions. Word has length 104 [2023-12-25 10:03:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:30,715 INFO L495 AbstractCegarLoop]: Abstraction has 41925 states and 51508 transitions. [2023-12-25 10:03:30,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.482758620689655) internal successors, (188), 29 states have internal predecessors, (188), 0 states have call successors, (0), 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:03:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 41925 states and 51508 transitions. [2023-12-25 10:03:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:03:30,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:30,718 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] [2023-12-25 10:03:30,721 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 (35)] Ended with exit code 0 [2023-12-25 10:03:30,920 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:03:30,921 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:03:30,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash 354097913, now seen corresponding path program 1 times [2023-12-25 10:03:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685211798] [2023-12-25 10:03:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:30,922 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:03:30,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:30,923 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:03:30,924 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:03:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:31,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:03:31,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 10:03:31,033 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:03:31,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685211798] [2023-12-25 10:03:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685211798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:03:31,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:03:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:03:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650763982] [2023-12-25 10:03:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:03:31,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:03:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:31,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:03:31,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:03:31,034 INFO L87 Difference]: Start difference. First operand 41925 states and 51508 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:03:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:31,190 INFO L93 Difference]: Finished difference Result 68762 states and 84791 transitions. [2023-12-25 10:03:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:03:31,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-25 10:03:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:31,219 INFO L225 Difference]: With dead ends: 68762 [2023-12-25 10:03:31,219 INFO L226 Difference]: Without dead ends: 27615 [2023-12-25 10:03:31,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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:03:31,244 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 81 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:03:31,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 120 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:03:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27615 states. [2023-12-25 10:03:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27615 to 27361. [2023-12-25 10:03:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27361 states, 27360 states have (on average 1.2154605263157894) internal successors, (33255), 27360 states have internal predecessors, (33255), 0 states have call successors, (0), 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:03:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27361 states to 27361 states and 33255 transitions. [2023-12-25 10:03:31,657 INFO L78 Accepts]: Start accepts. Automaton has 27361 states and 33255 transitions. Word has length 104 [2023-12-25 10:03:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:31,657 INFO L495 AbstractCegarLoop]: Abstraction has 27361 states and 33255 transitions. [2023-12-25 10:03:31,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:03:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27361 states and 33255 transitions. [2023-12-25 10:03:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 10:03:31,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:31,659 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] [2023-12-25 10:03:31,662 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:03:31,862 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:03:31,862 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:03:31,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1638980956, now seen corresponding path program 1 times [2023-12-25 10:03:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316532861] [2023-12-25 10:03:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:31,863 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:03:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:32,000 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:03:32,000 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:03:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:32,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:03:32,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 10:03:32,106 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:03:32,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:32,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316532861] [2023-12-25 10:03:32,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316532861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:03:32,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:03:32,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:03:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757192361] [2023-12-25 10:03:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:03:32,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:03:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:32,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:03:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:03:32,108 INFO L87 Difference]: Start difference. First operand 27361 states and 33255 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:03:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:32,223 INFO L93 Difference]: Finished difference Result 52854 states and 64431 transitions. [2023-12-25 10:03:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:03:32,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-12-25 10:03:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:32,247 INFO L225 Difference]: With dead ends: 52854 [2023-12-25 10:03:32,247 INFO L226 Difference]: Without dead ends: 25935 [2023-12-25 10:03:32,262 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 10:03:32,262 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 79 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:03:32,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:03:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25935 states. [2023-12-25 10:03:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25935 to 25935. [2023-12-25 10:03:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25935 states, 25934 states have (on average 1.2084522248785379) internal successors, (31340), 25934 states have internal predecessors, (31340), 0 states have call successors, (0), 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:03:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25935 states to 25935 states and 31340 transitions. [2023-12-25 10:03:32,526 INFO L78 Accepts]: Start accepts. Automaton has 25935 states and 31340 transitions. Word has length 105 [2023-12-25 10:03:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:32,526 INFO L495 AbstractCegarLoop]: Abstraction has 25935 states and 31340 transitions. [2023-12-25 10:03:32,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:03:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 25935 states and 31340 transitions. [2023-12-25 10:03:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 10:03:32,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:32,527 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:03:32,530 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 (37)] Ended with exit code 0 [2023-12-25 10:03:32,728 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:03:32,729 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:03:32,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1446226161, now seen corresponding path program 1 times [2023-12-25 10:03:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:32,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513557279] [2023-12-25 10:03:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:32,730 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:03:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:32,730 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:03:32,732 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:03:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:32,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:03:32,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:03:32,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:03:32,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513557279] [2023-12-25 10:03:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513557279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:03:32,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:03:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:03:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458320476] [2023-12-25 10:03:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:03:32,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:03:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:03:32,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:03:32,883 INFO L87 Difference]: Start difference. First operand 25935 states and 31340 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 10:03:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:33,046 INFO L93 Difference]: Finished difference Result 36780 states and 44307 transitions. [2023-12-25 10:03:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:03:33,046 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 10:03:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:33,055 INFO L225 Difference]: With dead ends: 36780 [2023-12-25 10:03:33,055 INFO L226 Difference]: Without dead ends: 11452 [2023-12-25 10:03:33,067 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 10:03:33,067 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 40 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 192 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 10:03:33,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 192 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:03:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11452 states. [2023-12-25 10:03:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11452 to 11450. [2023-12-25 10:03:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11450 states, 11449 states have (on average 1.1679622674469385) internal successors, (13372), 11449 states have internal predecessors, (13372), 0 states have call successors, (0), 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:03:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11450 states to 11450 states and 13372 transitions. [2023-12-25 10:03:33,174 INFO L78 Accepts]: Start accepts. Automaton has 11450 states and 13372 transitions. Word has length 105 [2023-12-25 10:03:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:33,175 INFO L495 AbstractCegarLoop]: Abstraction has 11450 states and 13372 transitions. [2023-12-25 10:03:33,175 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 10:03:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 11450 states and 13372 transitions. [2023-12-25 10:03:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 10:03:33,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:33,176 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] [2023-12-25 10:03:33,180 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 (38)] Forceful destruction successful, exit code 0 [2023-12-25 10:03:33,381 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:03:33,381 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:03:33,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash -176877688, now seen corresponding path program 1 times [2023-12-25 10:03:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:33,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715475380] [2023-12-25 10:03:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:33,382 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:03:33,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:33,383 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:03:33,385 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:03:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:33,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 10:03:33,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:03:34,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:03:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:03:35,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:35,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715475380] [2023-12-25 10:03:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715475380] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:03:35,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:03:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2023-12-25 10:03:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185161456] [2023-12-25 10:03:35,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:03:35,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:03:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:03:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:03:35,385 INFO L87 Difference]: Start difference. First operand 11450 states and 13372 transitions. Second operand has 33 states, 33 states have (on average 6.03030303030303) internal successors, (199), 33 states have internal predecessors, (199), 0 states have call successors, (0), 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:03:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:03:41,047 INFO L93 Difference]: Finished difference Result 19996 states and 23323 transitions. [2023-12-25 10:03:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-12-25 10:03:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.03030303030303) internal successors, (199), 33 states have internal predecessors, (199), 0 states have call successors, (0), 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 10:03:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:03:41,066 INFO L225 Difference]: With dead ends: 19996 [2023-12-25 10:03:41,066 INFO L226 Difference]: Without dead ends: 16600 [2023-12-25 10:03:41,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1818, Invalid=8688, Unknown=0, NotChecked=0, Total=10506 [2023-12-25 10:03:41,073 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 1459 mSDsluCounter, 5555 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 5930 SdHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:03:41,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 5930 Invalid, 2028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 10:03:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16600 states. [2023-12-25 10:03:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16600 to 11882. [2023-12-25 10:03:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11882 states, 11881 states have (on average 1.1669893106640856) internal successors, (13865), 11881 states have internal predecessors, (13865), 0 states have call successors, (0), 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:03:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11882 states to 11882 states and 13865 transitions. [2023-12-25 10:03:41,187 INFO L78 Accepts]: Start accepts. Automaton has 11882 states and 13865 transitions. Word has length 105 [2023-12-25 10:03:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:03:41,188 INFO L495 AbstractCegarLoop]: Abstraction has 11882 states and 13865 transitions. [2023-12-25 10:03:41,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.03030303030303) internal successors, (199), 33 states have internal predecessors, (199), 0 states have call successors, (0), 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:03:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 11882 states and 13865 transitions. [2023-12-25 10:03:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 10:03:41,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:03:41,189 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] [2023-12-25 10:03:41,210 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:03:41,392 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:03:41,393 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:03:41,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:03:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2023506591, now seen corresponding path program 1 times [2023-12-25 10:03:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:03:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349949213] [2023-12-25 10:03:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:03:41,394 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:03:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:03:41,395 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:03:41,396 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:03:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:03:41,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 10:03:41,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:03:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:03:43,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:03:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:03:43,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:03:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349949213] [2023-12-25 10:03:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349949213] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:03:43,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:03:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 10:03:43,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965174890] [2023-12-25 10:03:43,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:03:43,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:03:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:03:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:03:43,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:03:43,819 INFO L87 Difference]: Start difference. First operand 11882 states and 13865 transitions. Second operand has 33 states, 33 states have (on average 5.757575757575758) internal successors, (190), 33 states have internal predecessors, (190), 0 states have call successors, (0), 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:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:01,811 INFO L93 Difference]: Finished difference Result 28428 states and 33194 transitions. [2023-12-25 10:04:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-25 10:04:01,812 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.757575757575758) internal successors, (190), 33 states have internal predecessors, (190), 0 states have call successors, (0), 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 10:04:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:01,830 INFO L225 Difference]: With dead ends: 28428 [2023-12-25 10:04:01,830 INFO L226 Difference]: Without dead ends: 23518 [2023-12-25 10:04:01,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=1253, Invalid=8253, Unknown=0, NotChecked=0, Total=9506 [2023-12-25 10:04:01,834 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 2345 mSDsluCounter, 5541 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2345 SdHoareTripleChecker+Valid, 5861 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:01,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2345 Valid, 5861 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1860 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-25 10:04:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23518 states. [2023-12-25 10:04:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23518 to 11510. [2023-12-25 10:04:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11510 states, 11509 states have (on average 1.1668259622903814) internal successors, (13429), 11509 states have internal predecessors, (13429), 0 states have call successors, (0), 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:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11510 states to 11510 states and 13429 transitions. [2023-12-25 10:04:01,961 INFO L78 Accepts]: Start accepts. Automaton has 11510 states and 13429 transitions. Word has length 106 [2023-12-25 10:04:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:01,961 INFO L495 AbstractCegarLoop]: Abstraction has 11510 states and 13429 transitions. [2023-12-25 10:04:01,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.757575757575758) internal successors, (190), 33 states have internal predecessors, (190), 0 states have call successors, (0), 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:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 11510 states and 13429 transitions. [2023-12-25 10:04:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-25 10:04:01,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:01,965 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-25 10:04:01,972 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:04:02,168 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:04:02,168 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:04:02,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash 892873518, now seen corresponding path program 1 times [2023-12-25 10:04:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:02,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208518872] [2023-12-25 10:04:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:02,169 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:02,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:02,170 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:04:02,176 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:04:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:02,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 10:04:02,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 64 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-25 10:04:03,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 34 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:04,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208518872] [2023-12-25 10:04:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208518872] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:04,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2023-12-25 10:04:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074353882] [2023-12-25 10:04:04,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:04,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 10:04:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 10:04:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2023-12-25 10:04:04,052 INFO L87 Difference]: Start difference. First operand 11510 states and 13429 transitions. Second operand has 32 states, 32 states have (on average 8.34375) internal successors, (267), 32 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:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:04:07,296 INFO L93 Difference]: Finished difference Result 18258 states and 21398 transitions. [2023-12-25 10:04:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-25 10:04:07,296 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.34375) internal successors, (267), 32 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 151 [2023-12-25 10:04:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:04:07,309 INFO L225 Difference]: With dead ends: 18258 [2023-12-25 10:04:07,309 INFO L226 Difference]: Without dead ends: 15752 [2023-12-25 10:04:07,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1010, Invalid=4540, Unknown=0, NotChecked=0, Total=5550 [2023-12-25 10:04:07,312 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1942 mSDsluCounter, 3881 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:04:07,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1942 Valid, 4045 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 10:04:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15752 states. [2023-12-25 10:04:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15752 to 9233. [2023-12-25 10:04:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9233 states, 9232 states have (on average 1.1613951473136914) internal successors, (10722), 9232 states have internal predecessors, (10722), 0 states have call successors, (0), 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:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9233 states to 9233 states and 10722 transitions. [2023-12-25 10:04:07,397 INFO L78 Accepts]: Start accepts. Automaton has 9233 states and 10722 transitions. Word has length 151 [2023-12-25 10:04:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:04:07,397 INFO L495 AbstractCegarLoop]: Abstraction has 9233 states and 10722 transitions. [2023-12-25 10:04:07,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.34375) internal successors, (267), 32 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:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9233 states and 10722 transitions. [2023-12-25 10:04:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:04:07,400 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:04:07,400 INFO L195 NwaCegarLoop]: trace histogram [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, 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:07,403 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:04:07,603 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:04:07,603 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:04:07,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:04:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1438151026, now seen corresponding path program 1 times [2023-12-25 10:04:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:04:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193641448] [2023-12-25 10:04:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:04:07,604 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:07,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:04:07,605 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:04:07,606 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:04:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:04:07,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 10:04:07,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:04:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:09,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:04:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:04:10,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:04:10,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193641448] [2023-12-25 10:04:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193641448] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:04:10,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:04:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2023-12-25 10:04:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617900648] [2023-12-25 10:04:10,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:04:10,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-25 10:04:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:04:10,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-25 10:04:10,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 10:04:10,610 INFO L87 Difference]: Start difference. First operand 9233 states and 10722 transitions. Second operand has 49 states, 49 states have (on average 5.591836734693878) internal successors, (274), 49 states have internal predecessors, (274), 0 states have call successors, (0), 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:05:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:32,786 INFO L93 Difference]: Finished difference Result 30301 states and 35726 transitions. [2023-12-25 10:05:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 413 states. [2023-12-25 10:05:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.591836734693878) internal successors, (274), 49 states have internal predecessors, (274), 0 states have call successors, (0), 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 152 [2023-12-25 10:05:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:32,811 INFO L225 Difference]: With dead ends: 30301 [2023-12-25 10:05:32,812 INFO L226 Difference]: Without dead ends: 27696 [2023-12-25 10:05:32,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 453 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 83917 ImplicationChecksByTransitivity, 75.2s TimeCoverageRelationStatistics Valid=16920, Invalid=189650, Unknown=0, NotChecked=0, Total=206570 [2023-12-25 10:05:32,826 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 5968 mSDsluCounter, 12916 mSDsCounter, 0 mSdLazyCounter, 7914 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5968 SdHoareTripleChecker+Valid, 13373 SdHoareTripleChecker+Invalid, 8088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 7914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:32,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5968 Valid, 13373 Invalid, 8088 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [174 Valid, 7914 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-12-25 10:05:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27696 states. [2023-12-25 10:05:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27696 to 15425. [2023-12-25 10:05:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15425 states, 15424 states have (on average 1.1713563278008299) internal successors, (18067), 15424 states have internal predecessors, (18067), 0 states have call successors, (0), 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:05:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15425 states to 15425 states and 18067 transitions. [2023-12-25 10:05:33,010 INFO L78 Accepts]: Start accepts. Automaton has 15425 states and 18067 transitions. Word has length 152 [2023-12-25 10:05:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:33,011 INFO L495 AbstractCegarLoop]: Abstraction has 15425 states and 18067 transitions. [2023-12-25 10:05:33,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.591836734693878) internal successors, (274), 49 states have internal predecessors, (274), 0 states have call successors, (0), 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:05:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 15425 states and 18067 transitions. [2023-12-25 10:05:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:05:33,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:33,015 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:33,018 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:05:33,217 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:05:33,218 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:05:33,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1717802432, now seen corresponding path program 1 times [2023-12-25 10:05:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121182505] [2023-12-25 10:05:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:33,219 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:05:33,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:33,220 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:05:33,255 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:05:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:33,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:05:33,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 10:05:33,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 10:05:34,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121182505] [2023-12-25 10:05:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121182505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:34,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 10:05:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002261259] [2023-12-25 10:05:34,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:34,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 10:05:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 10:05:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 10:05:34,205 INFO L87 Difference]: Start difference. First operand 15425 states and 18067 transitions. Second operand has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 17 states have internal predecessors, (255), 0 states have call successors, (0), 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:05:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:35,034 INFO L93 Difference]: Finished difference Result 21547 states and 25378 transitions. [2023-12-25 10:05:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 10:05:35,034 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 17 states have internal predecessors, (255), 0 states have call successors, (0), 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 152 [2023-12-25 10:05:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:35,042 INFO L225 Difference]: With dead ends: 21547 [2023-12-25 10:05:35,042 INFO L226 Difference]: Without dead ends: 9799 [2023-12-25 10:05:35,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 286 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:05:35,050 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 601 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:35,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 546 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 10:05:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9799 states. [2023-12-25 10:05:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9799 to 7746. [2023-12-25 10:05:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7746 states, 7745 states have (on average 1.1524854744996773) internal successors, (8926), 7745 states have internal predecessors, (8926), 0 states have call successors, (0), 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:05:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7746 states to 7746 states and 8926 transitions. [2023-12-25 10:05:35,200 INFO L78 Accepts]: Start accepts. Automaton has 7746 states and 8926 transitions. Word has length 152 [2023-12-25 10:05:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:35,200 INFO L495 AbstractCegarLoop]: Abstraction has 7746 states and 8926 transitions. [2023-12-25 10:05:35,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 17 states have internal predecessors, (255), 0 states have call successors, (0), 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:05:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7746 states and 8926 transitions. [2023-12-25 10:05:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:05:35,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:35,202 INFO L195 NwaCegarLoop]: trace histogram [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, 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:05:35,205 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 (43)] Ended with exit code 0 [2023-12-25 10:05:35,405 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:05:35,405 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:05:35,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 683865997, now seen corresponding path program 1 times [2023-12-25 10:05:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980153150] [2023-12-25 10:05:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:35,406 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:05:35,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:35,407 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:05:35,411 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:05:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:35,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 10:05:35,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:05:36,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 31 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:05:36,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:36,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980153150] [2023-12-25 10:05:36,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980153150] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:36,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2023-12-25 10:05:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593883422] [2023-12-25 10:05:36,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:36,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 10:05:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 10:05:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2023-12-25 10:05:36,672 INFO L87 Difference]: Start difference. First operand 7746 states and 8926 transitions. Second operand has 31 states, 31 states have (on average 9.193548387096774) internal successors, (285), 31 states have internal predecessors, (285), 0 states have call successors, (0), 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:05:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:40,791 INFO L93 Difference]: Finished difference Result 11613 states and 13415 transitions. [2023-12-25 10:05:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-25 10:05:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.193548387096774) internal successors, (285), 31 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-12-25 10:05:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:40,799 INFO L225 Difference]: With dead ends: 11613 [2023-12-25 10:05:40,799 INFO L226 Difference]: Without dead ends: 9291 [2023-12-25 10:05:40,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1943 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1156, Invalid=7216, Unknown=0, NotChecked=0, Total=8372 [2023-12-25 10:05:40,807 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 1427 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:40,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 5102 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 10:05:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9291 states. [2023-12-25 10:05:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9291 to 7453. [2023-12-25 10:05:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7453 states, 7452 states have (on average 1.1512345679012346) internal successors, (8579), 7452 states have internal predecessors, (8579), 0 states have call successors, (0), 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:05:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7453 states to 7453 states and 8579 transitions. [2023-12-25 10:05:40,884 INFO L78 Accepts]: Start accepts. Automaton has 7453 states and 8579 transitions. Word has length 153 [2023-12-25 10:05:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:40,886 INFO L495 AbstractCegarLoop]: Abstraction has 7453 states and 8579 transitions. [2023-12-25 10:05:40,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.193548387096774) internal successors, (285), 31 states have internal predecessors, (285), 0 states have call successors, (0), 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:05:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 7453 states and 8579 transitions. [2023-12-25 10:05:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:05:40,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:40,889 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-12-25 10:05:40,894 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:05:41,092 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:05:41,092 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:05:41,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1266312493, now seen corresponding path program 1 times [2023-12-25 10:05:41,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915957813] [2023-12-25 10:05:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:41,112 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:05:41,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:41,120 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:05:41,121 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:05:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:41,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:05:41,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 10:05:41,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 10:05:41,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:41,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915957813] [2023-12-25 10:05:41,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915957813] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:41,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:41,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 10:05:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6283383] [2023-12-25 10:05:41,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:41,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 10:05:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 10:05:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 10:05:41,547 INFO L87 Difference]: Start difference. First operand 7453 states and 8579 transitions. Second operand has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 0 states have call successors, (0), 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:05:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:41,708 INFO L93 Difference]: Finished difference Result 28765 states and 34491 transitions. [2023-12-25 10:05:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 10:05:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-12-25 10:05:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:41,726 INFO L225 Difference]: With dead ends: 28765 [2023-12-25 10:05:41,726 INFO L226 Difference]: Without dead ends: 21921 [2023-12-25 10:05:41,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 296 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:05:41,730 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 343 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:41,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 984 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:05:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2023-12-25 10:05:41,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 21913. [2023-12-25 10:05:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21913 states, 21912 states have (on average 1.1277838627236219) internal successors, (24712), 21912 states have internal predecessors, (24712), 0 states have call successors, (0), 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:05:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21913 states to 21913 states and 24712 transitions. [2023-12-25 10:05:41,895 INFO L78 Accepts]: Start accepts. Automaton has 21913 states and 24712 transitions. Word has length 153 [2023-12-25 10:05:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:41,895 INFO L495 AbstractCegarLoop]: Abstraction has 21913 states and 24712 transitions. [2023-12-25 10:05:41,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 0 states have call successors, (0), 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:05:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21913 states and 24712 transitions. [2023-12-25 10:05:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:05:41,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:41,897 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-25 10:05:41,901 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:05:42,100 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:05:42,100 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:05:42,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -752860901, now seen corresponding path program 1 times [2023-12-25 10:05:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712345189] [2023-12-25 10:05:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:42,101 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:05:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:42,102 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:05:42,104 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:05:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:42,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 10:05:42,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-25 10:05:42,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 66 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-25 10:05:43,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712345189] [2023-12-25 10:05:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712345189] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:43,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 10:05:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283707866] [2023-12-25 10:05:43,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:43,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 10:05:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 10:05:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-12-25 10:05:43,192 INFO L87 Difference]: Start difference. First operand 21913 states and 24712 transitions. Second operand has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 21 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 10:05:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:44,638 INFO L93 Difference]: Finished difference Result 32785 states and 36810 transitions. [2023-12-25 10:05:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 10:05:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 21 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) Word has length 153 [2023-12-25 10:05:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:44,660 INFO L225 Difference]: With dead ends: 32785 [2023-12-25 10:05:44,660 INFO L226 Difference]: Without dead ends: 24788 [2023-12-25 10:05:44,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=331, Invalid=1229, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 10:05:44,665 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 789 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:44,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2427 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 10:05:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24788 states. [2023-12-25 10:05:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24788 to 18988. [2023-12-25 10:05:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18988 states, 18987 states have (on average 1.130405013956918) internal successors, (21463), 18987 states have internal predecessors, (21463), 0 states have call successors, (0), 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:05:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18988 states to 18988 states and 21463 transitions. [2023-12-25 10:05:44,833 INFO L78 Accepts]: Start accepts. Automaton has 18988 states and 21463 transitions. Word has length 153 [2023-12-25 10:05:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:44,833 INFO L495 AbstractCegarLoop]: Abstraction has 18988 states and 21463 transitions. [2023-12-25 10:05:44,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.761904761904763) internal successors, (226), 21 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 10:05:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18988 states and 21463 transitions. [2023-12-25 10:05:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:05:44,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:44,835 INFO L195 NwaCegarLoop]: trace histogram [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, 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:05:44,838 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:05:45,037 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:05:45,038 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:05:45,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1535018851, now seen corresponding path program 1 times [2023-12-25 10:05:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788122834] [2023-12-25 10:05:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:45,039 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:05:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:45,040 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:05:45,066 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:05:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:45,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 10:05:45,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:05:45,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:05:46,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788122834] [2023-12-25 10:05:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788122834] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:46,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:46,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-25 10:05:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869215671] [2023-12-25 10:05:46,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:46,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 10:05:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 10:05:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2023-12-25 10:05:46,091 INFO L87 Difference]: Start difference. First operand 18988 states and 21463 transitions. Second operand has 29 states, 29 states have (on average 9.862068965517242) internal successors, (286), 29 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 10:05:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:48,989 INFO L93 Difference]: Finished difference Result 35380 states and 39825 transitions. [2023-12-25 10:05:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-25 10:05:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.862068965517242) internal successors, (286), 29 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) Word has length 153 [2023-12-25 10:05:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:49,014 INFO L225 Difference]: With dead ends: 35380 [2023-12-25 10:05:49,015 INFO L226 Difference]: Without dead ends: 25627 [2023-12-25 10:05:49,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=767, Invalid=4933, Unknown=0, NotChecked=0, Total=5700 [2023-12-25 10:05:49,025 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 1100 mSDsluCounter, 4451 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 4743 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:49,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 4743 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 10:05:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25627 states. [2023-12-25 10:05:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25627 to 20508. [2023-12-25 10:05:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20508 states, 20507 states have (on average 1.1274686692348954) internal successors, (23121), 20507 states have internal predecessors, (23121), 0 states have call successors, (0), 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:05:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20508 states to 20508 states and 23121 transitions. [2023-12-25 10:05:49,302 INFO L78 Accepts]: Start accepts. Automaton has 20508 states and 23121 transitions. Word has length 153 [2023-12-25 10:05:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:49,303 INFO L495 AbstractCegarLoop]: Abstraction has 20508 states and 23121 transitions. [2023-12-25 10:05:49,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.862068965517242) internal successors, (286), 29 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 10:05:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 20508 states and 23121 transitions. [2023-12-25 10:05:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:05:49,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:49,304 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-25 10:05:49,307 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:05:49,507 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:05:49,507 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:05:49,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash -910954333, now seen corresponding path program 1 times [2023-12-25 10:05:49,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:49,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585695321] [2023-12-25 10:05:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:49,509 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:05:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:49,510 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:05:49,513 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:05:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:49,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 10:05:49,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:05:51,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:05:52,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585695321] [2023-12-25 10:05:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585695321] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:52,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:52,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2023-12-25 10:05:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521436137] [2023-12-25 10:05:52,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:52,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-25 10:05:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-25 10:05:52,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=2418, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 10:05:52,892 INFO L87 Difference]: Start difference. First operand 20508 states and 23121 transitions. Second operand has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 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:07:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:07:26,734 INFO L93 Difference]: Finished difference Result 44053 states and 50180 transitions. [2023-12-25 10:07:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 377 states. [2023-12-25 10:07:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-12-25 10:07:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:07:26,772 INFO L225 Difference]: With dead ends: 44053 [2023-12-25 10:07:26,772 INFO L226 Difference]: Without dead ends: 43145 [2023-12-25 10:07:26,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 421 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 71921 ImplicationChecksByTransitivity, 88.1s TimeCoverageRelationStatistics Valid=14729, Invalid=163777, Unknown=0, NotChecked=0, Total=178506 [2023-12-25 10:07:26,788 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 4877 mSDsluCounter, 9360 mSDsCounter, 0 mSdLazyCounter, 5975 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4877 SdHoareTripleChecker+Valid, 9639 SdHoareTripleChecker+Invalid, 6125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 5975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:07:26,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4877 Valid, 9639 Invalid, 6125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 5975 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-25 10:07:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43145 states. [2023-12-25 10:07:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43145 to 21978. [2023-12-25 10:07:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21978 states, 21977 states have (on average 1.1314101105701415) internal successors, (24865), 21977 states have internal predecessors, (24865), 0 states have call successors, (0), 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:07:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21978 states to 21978 states and 24865 transitions. [2023-12-25 10:07:27,113 INFO L78 Accepts]: Start accepts. Automaton has 21978 states and 24865 transitions. Word has length 153 [2023-12-25 10:07:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:07:27,113 INFO L495 AbstractCegarLoop]: Abstraction has 21978 states and 24865 transitions. [2023-12-25 10:07:27,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.372549019607843) internal successors, (274), 51 states have internal predecessors, (274), 0 states have call successors, (0), 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:07:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21978 states and 24865 transitions. [2023-12-25 10:07:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 10:07:27,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:07:27,115 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-25 10:07:27,118 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:07:27,318 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:07:27,318 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:07:27,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:07:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1919800275, now seen corresponding path program 1 times [2023-12-25 10:07:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:07:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125877448] [2023-12-25 10:07:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:07:27,319 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:07:27,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:07:27,320 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:07:27,353 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:07:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:07:27,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 10:07:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:07:27,575 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 10:07:27,575 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 10:07:27,576 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-25 10:07:27,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-25 10:07:27,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-25 10:07:27,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-25 10:07:27,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-25 10:07:27,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-25 10:07:27,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-25 10:07:27,580 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 (49)] Ended with exit code 0 [2023-12-25 10:07:27,780 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:07:27,783 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:07:27,786 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 10:07:27,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 10:07:27 BoogieIcfgContainer [2023-12-25 10:07:27,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 10:07:27,928 INFO L158 Benchmark]: Toolchain (without parser) took 673333.70ms. Allocated memory was 321.9MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 267.4MB in the beginning and 513.9MB in the end (delta: -246.5MB). Peak memory consumption was 980.6MB. Max. memory is 8.0GB. [2023-12-25 10:07:27,928 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 10:07:27,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.50ms. Allocated memory is still 321.9MB. Free memory was 266.9MB in the beginning and 234.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-25 10:07:27,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.71ms. Allocated memory is still 321.9MB. Free memory was 234.9MB in the beginning and 230.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 10:07:27,928 INFO L158 Benchmark]: Boogie Preprocessor took 81.88ms. Allocated memory is still 321.9MB. Free memory was 230.7MB in the beginning and 224.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-25 10:07:27,928 INFO L158 Benchmark]: RCFGBuilder took 930.79ms. Allocated memory is still 321.9MB. Free memory was 224.9MB in the beginning and 234.8MB in the end (delta: -9.9MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. [2023-12-25 10:07:27,929 INFO L158 Benchmark]: TraceAbstraction took 671819.50ms. Allocated memory was 321.9MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 234.3MB in the beginning and 513.9MB in the end (delta: -279.6MB). Peak memory consumption was 945.9MB. Max. memory is 8.0GB. [2023-12-25 10:07:27,933 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 186.6MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.50ms. Allocated memory is still 321.9MB. Free memory was 266.9MB in the beginning and 234.9MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.71ms. Allocated memory is still 321.9MB. Free memory was 234.9MB in the beginning and 230.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 81.88ms. Allocated memory is still 321.9MB. Free memory was 230.7MB in the beginning and 224.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 930.79ms. Allocated memory is still 321.9MB. Free memory was 224.9MB in the beginning and 234.8MB in the end (delta: -9.9MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. * TraceAbstraction took 671819.50ms. Allocated memory was 321.9MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 234.3MB in the beginning and 513.9MB in the end (delta: -279.6MB). Peak memory consumption was 945.9MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] port_t p2 = 0; [L36] char p2_old = '\x0'; [L37] char p2_new = '\x0'; [L38] char id2 = '\x0'; [L39] char st2 = '\x0'; [L40] msg_t send2 = '\x0'; [L41] _Bool mode2 = 0; [L42] port_t p3 = 0; [L43] char p3_old = '\x0'; [L44] char p3_new = '\x0'; [L45] char id3 = '\x0'; [L46] char st3 = '\x0'; [L47] msg_t send3 = '\x0'; [L48] _Bool mode3 = 0; [L52] void (*nodes[3])() = { &node1, &node2, &node3 }; [L56] int __return_1394; [L57] int __return_2202; [L58] int __return_1532; [L59] int __return_1599; [L60] int __return_1834; [L61] int __return_2011; [L62] int __return_2169; [L63] int __return_1751; [L64] int __return_1900; [L65] int __return_2089; [L66] int __return_2235; [L67] int __return_2136; [L68] int __return_2044; [L69] int __return_1963; [L70] int __return_1867; [L71] int __return_1798; [L72] int __return_1690; [L73] int __return_1467; [L76] int main__c1; [L77] int main__i2; [L78] main__c1 = 0 [L79] r1 = __VERIFIER_nondet_uchar() [L80] id1 = __VERIFIER_nondet_char() [L81] st1 = __VERIFIER_nondet_char() [L82] send1 = __VERIFIER_nondet_char() [L83] mode1 = __VERIFIER_nondet_bool() [L84] id2 = __VERIFIER_nondet_char() [L85] st2 = __VERIFIER_nondet_char() [L86] send2 = __VERIFIER_nondet_char() [L87] mode2 = __VERIFIER_nondet_bool() [L88] id3 = __VERIFIER_nondet_char() [L89] st3 = __VERIFIER_nondet_char() [L90] send3 = __VERIFIER_nondet_char() [L91] mode3 = __VERIFIER_nondet_bool() [L93] int init__tmp; VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L94] COND TRUE ((int)r1) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L96] COND TRUE ((int)id1) >= 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L98] COND TRUE ((int)st1) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L100] COND TRUE ((int)send1) == ((int)id1) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L102] COND TRUE ((int)mode1) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L104] COND TRUE ((int)id2) >= 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L106] COND TRUE ((int)st2) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L108] COND TRUE ((int)send2) == ((int)id2) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L110] COND TRUE ((int)mode2) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L112] COND TRUE ((int)id3) >= 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L114] COND TRUE ((int)st3) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L116] COND TRUE ((int)send3) == ((int)id3) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L118] COND TRUE ((int)mode3) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L120] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L122] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L124] COND TRUE ((int)id2) != ((int)id3) [L126] init__tmp = 1 [L127] __return_1394 = init__tmp [L128] main__i2 = __return_1394 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L129] COND TRUE main__i2 != 0 [L131] p1_old = nomsg [L132] p1_new = nomsg [L133] p2_old = nomsg [L134] p2_new = nomsg [L135] p3_old = nomsg [L136] p3_new = nomsg [L137] main__i2 = 0 [L139] msg_t node1__m1; [L140] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L141] COND FALSE !(!(mode1 == 0)) [L147] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L148] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L150] COND TRUE p1_new == nomsg [L152] node1____CPAchecker_TMP_0 = send1 [L153] p1_new = node1____CPAchecker_TMP_0 [L154] mode1 = 1 [L156] msg_t node2__m2; [L157] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L158] COND FALSE !(!(mode2 == 0)) [L164] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L165] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L167] COND TRUE p2_new == nomsg [L169] node2____CPAchecker_TMP_0 = send2 [L170] p2_new = node2____CPAchecker_TMP_0 [L171] mode2 = 1 [L173] msg_t node3__m3; [L174] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L175] COND FALSE !(!(mode3 == 0)) [L181] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L182] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L184] COND TRUE p3_new == nomsg [L186] node3____CPAchecker_TMP_0 = send3 [L187] p3_new = node3____CPAchecker_TMP_0 [L188] mode3 = 1 [L189] p1_old = p1_new [L190] p1_new = nomsg [L191] p2_old = p2_new [L192] p2_new = nomsg [L193] p3_old = p3_new [L194] p3_new = nomsg [L196] int check__tmp; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L197] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L199] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L205] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=0, __return_2235=0, __return_main=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] [L207] COND TRUE ((int)r1) < 3 [L209] check__tmp = 1 [L210] __return_2202 = check__tmp [L211] main__c1 = __return_2202 [L213] _Bool __tmp_1; [L214] __tmp_1 = main__c1 [L215] _Bool assert__arg; [L216] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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] [L217] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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] [L225] msg_t node1__m1; [L226] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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, 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] [L227] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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, 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] [L229] COND FALSE !(r1 == 255) [L235] r1 = r1 + 1 [L236] node1__m1 = p3_old [L237] p3_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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, 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] [L238] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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, 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] [L240] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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, 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] [L816] COND FALSE !(((int)node1__m1) == ((int)id1)) [L1079] send1 = node1__m1 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, 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, 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] [L244] mode1 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L247] msg_t node2__m2; [L248] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L249] COND TRUE !(mode2 == 0) [L251] node2__m2 = p1_old [L252] p1_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L253] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L255] COND TRUE ((int)node2__m2) > ((int)id2) [L257] send2 = node2__m2 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L259] mode2 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L262] msg_t node3__m3; [L263] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L264] COND TRUE !(mode3 == 0) [L266] node3__m3 = p2_old [L267] p2_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L268] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L270] COND TRUE ((int)node3__m3) > ((int)id3) [L272] send3 = node3__m3 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L274] mode3 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L276] p1_old = p1_new [L277] p1_new = nomsg [L278] p2_old = p2_new [L279] p2_new = nomsg [L280] p3_old = p3_new [L281] p3_new = nomsg [L283] int check__tmp; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L284] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L286] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L292] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L294] COND TRUE ((int)r1) < 3 [L296] check__tmp = 1 [L297] __return_1532 = check__tmp [L298] main__c1 = __return_1532 [L300] _Bool __tmp_2; [L301] __tmp_2 = main__c1 [L302] _Bool assert__arg; [L303] assert__arg = __tmp_2 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L304] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L312] msg_t node1__m1; [L313] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L314] COND FALSE !(!(mode1 == 0)) [L550] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L551] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L553] COND TRUE p1_new == nomsg [L555] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L557] p1_new = node1____CPAchecker_TMP_0 [L558] mode1 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L332] msg_t node2__m2; [L333] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L334] COND FALSE !(!(mode2 == 0)) [L499] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L500] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L502] COND TRUE p2_new == nomsg [L504] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L506] p2_new = node2____CPAchecker_TMP_0 [L507] mode2 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L347] msg_t node3__m3; [L348] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L349] COND FALSE !(!(mode3 == 0)) [L454] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L455] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L457] COND TRUE p3_new == nomsg [L459] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=32, id3=0, init__tmp=1, main__c1=1, main__i2=0, 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] [L461] p3_new = node3____CPAchecker_TMP_0 [L462] mode3 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=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=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] [L361] p1_old = p1_new [L362] p1_new = nomsg [L363] p2_old = p2_new [L364] p2_new = nomsg [L365] p3_old = p3_new [L366] p3_new = nomsg [L368] int check__tmp; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=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=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] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=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=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] [L371] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=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=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] [L416] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, assert__arg=1, assert__arg=1, check__tmp=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=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] [L374] COND TRUE ((int)r1) < 3 [L376] check__tmp = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=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__c1=1, main__i2=0, 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] [L380] __return_1599 = check__tmp [L381] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=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__c1=1, main__i2=0, 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] [L384] _Bool __tmp_3; [L385] __tmp_3 = main__c1 [L386] _Bool assert__arg; [L387] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L388] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L312] msg_t node1__m1; [L313] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L314] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L316] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L320] r1 = r1 + 1 [L321] node1__m1 = p3_old [L322] p3_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L323] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L325] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L526] COND FALSE !(((int)node1__m1) == ((int)id1)) [L533] send1 = node1__m1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L329] mode1 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L332] msg_t node2__m2; [L333] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L334] COND TRUE !(mode2 == 0) [L336] node2__m2 = p1_old [L337] p1_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L338] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L340] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L481] COND FALSE !(((int)node2__m2) == ((int)id2)) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L344] mode2 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L347] msg_t node3__m3; [L348] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L349] COND TRUE !(mode3 == 0) [L351] node3__m3 = p2_old [L352] p2_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L353] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L355] COND TRUE ((int)node3__m3) > ((int)id3) [L357] send3 = node3__m3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L359] mode3 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L361] p1_old = p1_new [L362] p1_new = nomsg [L363] p2_old = p2_new [L364] p2_new = nomsg [L365] p3_old = p3_new [L366] p3_new = nomsg [L368] int check__tmp; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L371] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L416] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L374] COND TRUE ((int)r1) < 3 [L376] check__tmp = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L380] __return_1599 = check__tmp [L381] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L384] _Bool __tmp_3; [L385] __tmp_3 = main__c1 [L386] _Bool assert__arg; [L387] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L388] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L312] msg_t node1__m1; [L313] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L314] COND FALSE !(!(mode1 == 0)) [L550] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L551] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L553] COND TRUE p1_new == nomsg [L555] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L557] p1_new = node1____CPAchecker_TMP_0 [L558] mode1 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L332] msg_t node2__m2; [L333] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L334] COND FALSE !(!(mode2 == 0)) [L499] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L500] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L502] COND TRUE p2_new == nomsg [L504] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L506] p2_new = node2____CPAchecker_TMP_0 [L507] mode2 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L347] msg_t node3__m3; [L348] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L349] COND FALSE !(!(mode3 == 0)) [L454] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L455] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L457] COND TRUE p3_new == nomsg [L459] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L461] p3_new = node3____CPAchecker_TMP_0 [L462] mode3 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L361] p1_old = p1_new [L362] p1_new = nomsg [L363] p2_old = p2_new [L364] p2_new = nomsg [L365] p3_old = p3_new [L366] p3_new = nomsg [L368] int check__tmp; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L369] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L371] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L416] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L374] COND TRUE ((int)r1) < 3 [L376] check__tmp = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L380] __return_1599 = check__tmp [L381] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L384] _Bool __tmp_3; [L385] __tmp_3 = main__c1 [L386] _Bool assert__arg; [L387] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L388] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L312] msg_t node1__m1; [L313] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L314] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L316] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L320] r1 = r1 + 1 [L321] node1__m1 = p3_old [L322] p3_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L323] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L325] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L526] COND TRUE ((int)node1__m1) == ((int)id1) [L528] st1 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L329] mode1 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L332] msg_t node2__m2; [L333] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L334] COND TRUE !(mode2 == 0) [L336] node2__m2 = p1_old [L337] p1_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L338] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L340] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L481] COND TRUE ((int)node2__m2) == ((int)id2) [L483] st2 = 1 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L344] mode2 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L347] msg_t node3__m3; [L348] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L349] COND TRUE !(mode3 == 0) [L351] node3__m3 = p2_old [L352] p2_old = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L353] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L355] COND TRUE ((int)node3__m3) > ((int)id3) [L357] send3 = node3__m3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L359] mode3 = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L361] p1_old = p1_new [L362] p1_new = nomsg [L363] p2_old = p2_new [L364] p2_new = nomsg [L365] p3_old = p3_new [L366] p3_new = nomsg [L368] int check__tmp; VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L369] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L429] check__tmp = 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=1, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=1, main__i2=0, 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] [L380] __return_1599 = check__tmp [L381] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, 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__c1=0, main__i2=0, 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] [L384] _Bool __tmp_3; [L385] __tmp_3 = main__c1 [L386] _Bool assert__arg; [L387] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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__c1=0, main__i2=0, 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] [L388] COND TRUE assert__arg == 0 VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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__c1=0, main__i2=0, 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] [L390] reach_error() VAL [__return_1394=1, __return_1467=0, __return_1532=1, __return_1599=0, __return_1690=0, __return_1751=0, __return_1798=0, __return_1834=0, __return_1867=0, __return_1900=0, __return_1963=0, __return_2011=0, __return_2044=0, __return_2089=0, __return_2136=0, __return_2169=0, __return_2202=1, __return_2235=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=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__c1=0, main__i2=0, 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: 632]: 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: 720]: 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: 767]: 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: 882]: 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: 929]: 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: 1003]: 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, 204 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 671.6s, OverallIterations: 48, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 611.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63228 SdHoareTripleChecker+Valid, 70.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63228 mSDsluCounter, 107952 SdHoareTripleChecker+Invalid, 65.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98649 mSDsCounter, 1221 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51785 IncrementalHoareTripleChecker+Invalid, 53006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1221 mSolverCounterUnsat, 9303 mSDtfsCounter, 51785 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9677 GetRequests, 6213 SyntacticMatches, 5 SemanticMatches, 3459 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 532134 ImplicationChecksByTransitivity, 547.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43610occurred in iteration=31, InterpolantAutomatonStates: 3048, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 47 MinimizatonAttempts, 358901 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 38.2s InterpolantComputationTime, 4606 NumberOfCodeBlocks, 4606 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 6841 ConstructedInterpolants, 1933 QuantifiedInterpolants, 84348 SizeOfPredicates, 302 NumberOfNonLiveVariables, 10427 ConjunctsInSsa, 520 ConjunctsInUnsatCore, 67 InterpolantComputations, 27 PerfectInterpolantSequences, 998/1965 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:07:28,168 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:07:28,226 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...