/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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:56:17,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:56:17,622 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:17,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:56:17,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:56:17,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:56:17,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:56:17,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:56:17,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:56:17,662 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:56:17,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:56:17,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:56:17,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:56:17,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:56:17,664 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:56:17,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:56:17,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:56:17,665 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:56:17,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:56:17,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:56:17,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:56:17,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:56:17,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:56:17,666 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:56:17,666 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:56:17,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:56:17,666 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:56:17,666 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:56:17,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:56:17,667 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:56:17,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:56:17,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:56:17,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:56:17,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:56:17,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:56:17,669 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:56:17,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:56:17,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:56:17,669 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:56:17,669 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:17,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:56:17,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:56:17,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:56:17,865 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:56:17,867 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:56:17,868 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+nlh-reducer.c [2023-12-25 09:56:18,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:56:19,064 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:56:19,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-25 09:56:19,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59dd03465/e1237c8bd4db4e33b587cf97253c71d0/FLAGa404b974f [2023-12-25 09:56:19,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59dd03465/e1237c8bd4db4e33b587cf97253c71d0 [2023-12-25 09:56:19,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:56:19,087 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:56:19,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:56:19,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:56:19,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:56:19,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:56:19" (1/1) ... [2023-12-25 09:56:19,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343f0411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:19, skipping insertion in model container [2023-12-25 09:56:19,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:56:19" (1/1) ... [2023-12-25 09:56:19,130 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:56:19,269 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+nlh-reducer.c[6876,6889] [2023-12-25 09:56:19,280 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+nlh-reducer.c[9071,9084] [2023-12-25 09:56:19,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:56:19,297 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:56:19,342 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+nlh-reducer.c[6876,6889] [2023-12-25 09:56:19,348 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+nlh-reducer.c[9071,9084] [2023-12-25 09:56:19,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:56:19,365 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:56:19,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:19 WrapperNode [2023-12-25 09:56:19,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:56:19,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:56:19,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:56:19,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:56:19,372 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:19" (1/1) ... [2023-12-25 09:56:19,388 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:19" (1/1) ... [2023-12-25 09:56:19,413 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 473 [2023-12-25 09:56:19,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:56:19,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:56:19,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:56:19,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:56:19,422 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:19" (1/1) ... [2023-12-25 09:56:19,422 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:19" (1/1) ... [2023-12-25 09:56:19,425 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:19" (1/1) ... [2023-12-25 09:56:19,436 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:19,437 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:19" (1/1) ... [2023-12-25 09:56:19,437 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:19" (1/1) ... [2023-12-25 09:56:19,443 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:19" (1/1) ... [2023-12-25 09:56:19,445 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:19" (1/1) ... [2023-12-25 09:56:19,447 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:19" (1/1) ... [2023-12-25 09:56:19,453 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:19" (1/1) ... [2023-12-25 09:56:19,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:56:19,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:56:19,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:56:19,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:56:19,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:19" (1/1) ... [2023-12-25 09:56:19,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:56:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:56:19,497 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:19,502 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:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:56:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:56:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:56:19,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:56:19,600 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:56:19,601 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:56:20,007 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:56:20,034 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:56:20,034 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:56:20,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:56:20 BoogieIcfgContainer [2023-12-25 09:56:20,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:56:20,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:56:20,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:56:20,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:56:20,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:56:19" (1/3) ... [2023-12-25 09:56:20,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703e2e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:56:20, skipping insertion in model container [2023-12-25 09:56:20,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:56:19" (2/3) ... [2023-12-25 09:56:20,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703e2e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:56:20, skipping insertion in model container [2023-12-25 09:56:20,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:56:20" (3/3) ... [2023-12-25 09:56:20,041 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2023-12-25 09:56:20,053 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:56:20,054 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-25 09:56:20,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:56:20,123 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;@42e41af6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:56:20,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-25 09:56:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 101 states have (on average 1.7623762376237624) internal successors, (178), 103 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have 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,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 09:56:20,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:20,135 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:20,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:20,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash -945003803, now seen corresponding path program 1 times [2023-12-25 09:56:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100480955] [2023-12-25 09:56:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:20,160 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,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:20,163 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:20,192 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:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:20,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:20,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:20,611 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,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:20,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:20,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100480955] [2023-12-25 09:56:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100480955] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:20,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:20,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904747511] [2023-12-25 09:56:20,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:20,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:20,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:20,661 INFO L87 Difference]: Start difference. First operand has 104 states, 101 states have (on average 1.7623762376237624) internal successors, (178), 103 states have internal predecessors, (178), 0 states have call successors, (0), 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.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:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:20,910 INFO L93 Difference]: Finished difference Result 253 states and 418 transitions. [2023-12-25 09:56:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:20,913 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:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:20,921 INFO L225 Difference]: With dead ends: 253 [2023-12-25 09:56:20,922 INFO L226 Difference]: Without dead ends: 164 [2023-12-25 09:56:20,924 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:20,929 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 668 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:20,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 175 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-25 09:56:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2023-12-25 09:56:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.4458598726114649) internal successors, (227), 158 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have 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,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 227 transitions. [2023-12-25 09:56:20,983 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 227 transitions. Word has length 46 [2023-12-25 09:56:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:20,983 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 227 transitions. [2023-12-25 09:56:20,983 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:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 227 transitions. [2023-12-25 09:56:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 09:56:20,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:20,985 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:21,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:21,191 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:21,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:21,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1004655178, now seen corresponding path program 1 times [2023-12-25 09:56:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:21,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149062018] [2023-12-25 09:56:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:21,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:21,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:21,195 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:21,199 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:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:21,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:21,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:21,426 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,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:21,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:21,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149062018] [2023-12-25 09:56:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149062018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:21,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:21,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:21,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716953761] [2023-12-25 09:56:21,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:21,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:21,432 INFO L87 Difference]: Start difference. First operand 159 states and 227 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:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:21,522 INFO L93 Difference]: Finished difference Result 293 states and 428 transitions. [2023-12-25 09:56:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:21,523 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:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:21,527 INFO L225 Difference]: With dead ends: 293 [2023-12-25 09:56:21,527 INFO L226 Difference]: Without dead ends: 159 [2023-12-25 09:56:21,528 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:21,530 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 352 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:21,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 88 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-25 09:56:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2023-12-25 09:56:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 158 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 224 transitions. [2023-12-25 09:56:21,545 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 224 transitions. Word has length 47 [2023-12-25 09:56:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:21,546 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 224 transitions. [2023-12-25 09:56:21,546 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:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 224 transitions. [2023-12-25 09:56:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 09:56:21,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:21,547 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:21,556 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:21,747 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:21,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:21,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1766368239, now seen corresponding path program 1 times [2023-12-25 09:56:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:21,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680925343] [2023-12-25 09:56:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:21,749 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,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:21,750 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:21,751 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:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:21,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:21,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:21,955 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,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:21,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:21,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680925343] [2023-12-25 09:56:21,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680925343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:21,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:21,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583046916] [2023-12-25 09:56:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:21,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:21,957 INFO L87 Difference]: Start difference. First operand 159 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:22,046 INFO L93 Difference]: Finished difference Result 289 states and 418 transitions. [2023-12-25 09:56:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:22,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:22,048 INFO L225 Difference]: With dead ends: 289 [2023-12-25 09:56:22,048 INFO L226 Difference]: Without dead ends: 159 [2023-12-25 09:56:22,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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:22,052 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 227 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:22,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 96 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-25 09:56:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2023-12-25 09:56:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.4076433121019107) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have 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:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2023-12-25 09:56:22,061 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 48 [2023-12-25 09:56:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:22,061 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2023-12-25 09:56:22,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2023-12-25 09:56:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:56:22,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:22,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:22,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:22,268 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:22,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:22,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1050360310, now seen corresponding path program 1 times [2023-12-25 09:56:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402439005] [2023-12-25 09:56:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:22,270 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:22,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:22,271 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:22,271 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:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:22,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 09:56:22,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:22,686 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,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:22,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402439005] [2023-12-25 09:56:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402439005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 09:56:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281005451] [2023-12-25 09:56:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:22,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:56:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:22,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:56:22,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:56:22,692 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:23,004 INFO L93 Difference]: Finished difference Result 262 states and 375 transitions. [2023-12-25 09:56:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 09:56:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-25 09:56:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:23,005 INFO L225 Difference]: With dead ends: 262 [2023-12-25 09:56:23,005 INFO L226 Difference]: Without dead ends: 159 [2023-12-25 09:56:23,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-25 09:56:23,006 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 536 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:23,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 182 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-25 09:56:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2023-12-25 09:56:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.4012738853503184) internal successors, (220), 158 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 220 transitions. [2023-12-25 09:56:23,010 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 220 transitions. Word has length 49 [2023-12-25 09:56:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:23,010 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 220 transitions. [2023-12-25 09:56:23,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 220 transitions. [2023-12-25 09:56:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:56:23,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:23,011 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:23,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 (5)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:23,213 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:23,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:23,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1334558207, now seen corresponding path program 1 times [2023-12-25 09:56:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170305940] [2023-12-25 09:56:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:23,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:23,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:23,216 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:23,220 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:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:23,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:23,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:23,605 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:23,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:23,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170305940] [2023-12-25 09:56:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170305940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:56:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560380088] [2023-12-25 09:56:23,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:23,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:56:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:56:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:56:23,607 INFO L87 Difference]: Start difference. First operand 159 states and 220 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 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:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:24,127 INFO L93 Difference]: Finished difference Result 273 states and 385 transitions. [2023-12-25 09:56:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:56:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 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:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:24,129 INFO L225 Difference]: With dead ends: 273 [2023-12-25 09:56:24,129 INFO L226 Difference]: Without dead ends: 164 [2023-12-25 09:56:24,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:56:24,130 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 912 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:24,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 270 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:56:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-25 09:56:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2023-12-25 09:56:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 158 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:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 218 transitions. [2023-12-25 09:56:24,133 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 218 transitions. Word has length 50 [2023-12-25 09:56:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:24,133 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 218 transitions. [2023-12-25 09:56:24,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 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:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2023-12-25 09:56:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 09:56:24,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:24,134 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,143 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:24,335 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:24,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:24,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash -855620319, now seen corresponding path program 1 times [2023-12-25 09:56:24,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723858444] [2023-12-25 09:56:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:24,337 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:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:24,338 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:24,344 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:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:24,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:24,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:24,716 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,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:24,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723858444] [2023-12-25 09:56:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723858444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:24,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:24,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:56:24,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781757774] [2023-12-25 09:56:24,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:24,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:56:24,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:56:24,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:56:24,717 INFO L87 Difference]: Start difference. First operand 159 states and 218 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:25,115 INFO L93 Difference]: Finished difference Result 258 states and 364 transitions. [2023-12-25 09:56:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:56:25,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:25,116 INFO L225 Difference]: With dead ends: 258 [2023-12-25 09:56:25,116 INFO L226 Difference]: Without dead ends: 159 [2023-12-25 09:56:25,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:56:25,117 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 452 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:25,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 229 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-25 09:56:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2023-12-25 09:56:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.375796178343949) internal successors, (216), 158 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have 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:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 216 transitions. [2023-12-25 09:56:25,120 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 216 transitions. Word has length 51 [2023-12-25 09:56:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:25,120 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 216 transitions. [2023-12-25 09:56:25,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 216 transitions. [2023-12-25 09:56:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 09:56:25,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:25,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:25,128 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 (7)] Ended with exit code 0 [2023-12-25 09:56:25,326 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:25,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:25,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash 872198696, now seen corresponding path program 1 times [2023-12-25 09:56:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:25,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758080453] [2023-12-25 09:56:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:25,327 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,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:25,328 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:25,328 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:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:25,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:25,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:25,589 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:25,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:25,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758080453] [2023-12-25 09:56:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758080453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:25,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:25,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915117927] [2023-12-25 09:56:25,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:25,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:25,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:25,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:25,591 INFO L87 Difference]: Start difference. First operand 159 states and 216 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:25,674 INFO L93 Difference]: Finished difference Result 550 states and 798 transitions. [2023-12-25 09:56:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-25 09:56:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:25,676 INFO L225 Difference]: With dead ends: 550 [2023-12-25 09:56:25,676 INFO L226 Difference]: Without dead ends: 463 [2023-12-25 09:56:25,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:25,677 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 234 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:25,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 462 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-25 09:56:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 358. [2023-12-25 09:56:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 356 states have (on average 1.4297752808988764) internal successors, (509), 357 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have 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:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 509 transitions. [2023-12-25 09:56:25,683 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 509 transitions. Word has length 52 [2023-12-25 09:56:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:25,684 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 509 transitions. [2023-12-25 09:56:25,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 509 transitions. [2023-12-25 09:56:25,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:56:25,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:25,684 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:25,689 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:25,886 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:25,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:25,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1883376843, now seen corresponding path program 1 times [2023-12-25 09:56:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:25,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806248241] [2023-12-25 09:56:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:25,888 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,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:25,889 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:25,889 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:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:25,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:25,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:26,091 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,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:26,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:26,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806248241] [2023-12-25 09:56:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806248241] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:26,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:26,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181402589] [2023-12-25 09:56:26,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:26,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:26,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:26,093 INFO L87 Difference]: Start difference. First operand 358 states and 509 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:26,177 INFO L93 Difference]: Finished difference Result 727 states and 1054 transitions. [2023-12-25 09:56:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:26,179 INFO L225 Difference]: With dead ends: 727 [2023-12-25 09:56:26,179 INFO L226 Difference]: Without dead ends: 639 [2023-12-25 09:56:26,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:26,180 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 222 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:26,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 509 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-12-25 09:56:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 535. [2023-12-25 09:56:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 533 states have (on average 1.4371482176360224) internal successors, (766), 534 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have 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:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 766 transitions. [2023-12-25 09:56:26,189 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 766 transitions. Word has length 53 [2023-12-25 09:56:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:26,189 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 766 transitions. [2023-12-25 09:56:26,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 766 transitions. [2023-12-25 09:56:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:56:26,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:26,190 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:26,206 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:26,393 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:26,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:26,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash 296441260, now seen corresponding path program 1 times [2023-12-25 09:56:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:26,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134616651] [2023-12-25 09:56:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:26,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 09:56:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:26,395 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:26,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 (10)] Waiting until timeout for monitored process [2023-12-25 09:56:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:26,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:26,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:26,582 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,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:26,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:26,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134616651] [2023-12-25 09:56:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134616651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:26,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051230861] [2023-12-25 09:56:26,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:26,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:26,584 INFO L87 Difference]: Start difference. First operand 535 states and 766 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:26,688 INFO L93 Difference]: Finished difference Result 801 states and 1163 transitions. [2023-12-25 09:56:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:26,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:26,690 INFO L225 Difference]: With dead ends: 801 [2023-12-25 09:56:26,690 INFO L226 Difference]: Without dead ends: 549 [2023-12-25 09:56:26,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:26,691 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 217 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:26,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 744 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-12-25 09:56:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 441. [2023-12-25 09:56:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 439 states have (on average 1.419134396355353) internal successors, (623), 440 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have 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:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 623 transitions. [2023-12-25 09:56:26,700 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 623 transitions. Word has length 53 [2023-12-25 09:56:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:26,700 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 623 transitions. [2023-12-25 09:56:26,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 623 transitions. [2023-12-25 09:56:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 09:56:26,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:26,700 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:26,705 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:26,905 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:26,906 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:26,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash 5078122, now seen corresponding path program 1 times [2023-12-25 09:56:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902552405] [2023-12-25 09:56:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:26,906 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:26,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:26,907 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:26,914 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:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:26,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:26,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:27,088 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:27,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:27,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902552405] [2023-12-25 09:56:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902552405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:27,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:27,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884902371] [2023-12-25 09:56:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:27,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:27,089 INFO L87 Difference]: Start difference. First operand 441 states and 623 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:27,172 INFO L93 Difference]: Finished difference Result 722 states and 1039 transitions. [2023-12-25 09:56:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:27,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:27,174 INFO L225 Difference]: With dead ends: 722 [2023-12-25 09:56:27,174 INFO L226 Difference]: Without dead ends: 636 [2023-12-25 09:56:27,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:27,175 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 297 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:27,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 584 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:56:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-12-25 09:56:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 523. [2023-12-25 09:56:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 521 states have (on average 1.4280230326295584) internal successors, (744), 522 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have 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,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 744 transitions. [2023-12-25 09:56:27,184 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 744 transitions. Word has length 53 [2023-12-25 09:56:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:27,184 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 744 transitions. [2023-12-25 09:56:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 744 transitions. [2023-12-25 09:56:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:56:27,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:27,185 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:27,191 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:27,387 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:27,387 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:27,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1921420051, now seen corresponding path program 1 times [2023-12-25 09:56:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988364884] [2023-12-25 09:56:27,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:27,388 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,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:27,389 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:27,417 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:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:27,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:56:27,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:27,841 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:27,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:27,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:27,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988364884] [2023-12-25 09:56:27,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988364884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 09:56:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148622564] [2023-12-25 09:56:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:27,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:56:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:56:27,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:56:27,843 INFO L87 Difference]: Start difference. First operand 523 states and 744 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:28,386 INFO L93 Difference]: Finished difference Result 675 states and 963 transitions. [2023-12-25 09:56:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:56:28,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:28,388 INFO L225 Difference]: With dead ends: 675 [2023-12-25 09:56:28,388 INFO L226 Difference]: Without dead ends: 557 [2023-12-25 09:56:28,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:56:28,389 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 663 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:28,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 653 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:56:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-12-25 09:56:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 507. [2023-12-25 09:56:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 1.4237623762376237) internal successors, (719), 506 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have 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:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 719 transitions. [2023-12-25 09:56:28,396 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 719 transitions. Word has length 54 [2023-12-25 09:56:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:28,396 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 719 transitions. [2023-12-25 09:56:28,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 719 transitions. [2023-12-25 09:56:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:56:28,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:28,397 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:28,401 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:28,599 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:28,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:28,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 423184428, now seen corresponding path program 1 times [2023-12-25 09:56:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:28,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267153383] [2023-12-25 09:56:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:28,600 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:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:28,601 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:28,622 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:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:28,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 09:56:28,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:30,525 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:30,525 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:30,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:30,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267153383] [2023-12-25 09:56:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267153383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:30,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:30,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-25 09:56:30,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081948836] [2023-12-25 09:56:30,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:30,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 09:56:30,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:30,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 09:56:30,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-12-25 09:56:30,527 INFO L87 Difference]: Start difference. First operand 507 states and 719 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:37,359 INFO L93 Difference]: Finished difference Result 1952 states and 2830 transitions. [2023-12-25 09:56:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 09:56:37,359 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:37,363 INFO L225 Difference]: With dead ends: 1952 [2023-12-25 09:56:37,363 INFO L226 Difference]: Without dead ends: 1527 [2023-12-25 09:56:37,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2023-12-25 09:56:37,365 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 858 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 2952 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:37,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 2952 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-25 09:56:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2023-12-25 09:56:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 512. [2023-12-25 09:56:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 510 states have (on average 1.419607843137255) internal successors, (724), 511 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have 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,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 724 transitions. [2023-12-25 09:56:37,375 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 724 transitions. Word has length 54 [2023-12-25 09:56:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:37,375 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 724 transitions. [2023-12-25 09:56:37,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 724 transitions. [2023-12-25 09:56:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:56:37,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:37,376 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:37,381 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:37,578 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:37,579 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:37,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash -19138258, now seen corresponding path program 1 times [2023-12-25 09:56:37,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:37,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455494123] [2023-12-25 09:56:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:37,580 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,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:37,581 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:37,582 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:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:37,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:37,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:37,911 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:37,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:37,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:37,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455494123] [2023-12-25 09:56:37,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455494123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:37,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:37,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 09:56:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695018097] [2023-12-25 09:56:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:37,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:56:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:37,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:56:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:56:37,913 INFO L87 Difference]: Start difference. First operand 512 states and 724 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:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:38,247 INFO L93 Difference]: Finished difference Result 1027 states and 1482 transitions. [2023-12-25 09:56:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:56:38,247 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:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:38,249 INFO L225 Difference]: With dead ends: 1027 [2023-12-25 09:56:38,249 INFO L226 Difference]: Without dead ends: 920 [2023-12-25 09:56:38,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-25 09:56:38,250 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 541 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:38,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 499 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2023-12-25 09:56:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 496. [2023-12-25 09:56:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 494 states have (on average 1.4210526315789473) internal successors, (702), 495 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 702 transitions. [2023-12-25 09:56:38,258 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 702 transitions. Word has length 54 [2023-12-25 09:56:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:38,258 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 702 transitions. [2023-12-25 09:56:38,258 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:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 702 transitions. [2023-12-25 09:56:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 09:56:38,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:38,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:38,271 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:38,461 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:38,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:38,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1760940237, now seen corresponding path program 1 times [2023-12-25 09:56:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:38,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059032939] [2023-12-25 09:56:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:38,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:38,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:38,463 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:38,465 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:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:38,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:56:38,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:38,905 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:38,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:38,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059032939] [2023-12-25 09:56:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059032939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:38,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 09:56:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827933819] [2023-12-25 09:56:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:38,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:56:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:38,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:56:38,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:56:38,907 INFO L87 Difference]: Start difference. First operand 496 states and 702 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:39,327 INFO L93 Difference]: Finished difference Result 925 states and 1333 transitions. [2023-12-25 09:56:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:56:39,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-25 09:56:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:39,342 INFO L225 Difference]: With dead ends: 925 [2023-12-25 09:56:39,342 INFO L226 Difference]: Without dead ends: 918 [2023-12-25 09:56:39,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:56:39,343 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 704 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:39,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 460 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2023-12-25 09:56:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 488. [2023-12-25 09:56:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.4229979466119096) internal successors, (693), 487 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 693 transitions. [2023-12-25 09:56:39,352 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 693 transitions. Word has length 55 [2023-12-25 09:56:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:39,352 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 693 transitions. [2023-12-25 09:56:39,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 693 transitions. [2023-12-25 09:56:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 09:56:39,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:39,353 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:39,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:39,555 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:39,556 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:39,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash 771114546, now seen corresponding path program 1 times [2023-12-25 09:56:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412991023] [2023-12-25 09:56:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:39,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:39,557 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:39,559 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:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:39,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:39,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:39,640 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:39,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:39,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:39,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412991023] [2023-12-25 09:56:39,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412991023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:39,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157956514] [2023-12-25 09:56:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:39,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:39,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:39,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:39,642 INFO L87 Difference]: Start difference. First operand 488 states and 693 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:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:39,655 INFO L93 Difference]: Finished difference Result 1232 states and 1797 transitions. [2023-12-25 09:56:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:39,656 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:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:39,658 INFO L225 Difference]: With dead ends: 1232 [2023-12-25 09:56:39,658 INFO L226 Difference]: Without dead ends: 820 [2023-12-25 09:56:39,661 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:39,662 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 67 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 237 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:39,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 237 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:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2023-12-25 09:56:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2023-12-25 09:56:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 1.4369645042839658) internal successors, (1174), 817 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1174 transitions. [2023-12-25 09:56:39,673 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1174 transitions. Word has length 75 [2023-12-25 09:56:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:39,674 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1174 transitions. [2023-12-25 09:56:39,674 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:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1174 transitions. [2023-12-25 09:56:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-25 09:56:39,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:39,675 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:39,678 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:39,877 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:39,877 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:39,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1959476458, now seen corresponding path program 1 times [2023-12-25 09:56:39,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:39,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018251869] [2023-12-25 09:56:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:39,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:39,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:39,879 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:39,880 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:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:39,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:39,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:39,979 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:39,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:39,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:39,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018251869] [2023-12-25 09:56:39,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018251869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:39,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:39,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391454656] [2023-12-25 09:56:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:39,981 INFO L87 Difference]: Start difference. First operand 818 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:39,994 INFO L93 Difference]: Finished difference Result 2142 states and 3120 transitions. [2023-12-25 09:56:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:39,998 INFO L225 Difference]: With dead ends: 2142 [2023-12-25 09:56:39,998 INFO L226 Difference]: Without dead ends: 1400 [2023-12-25 09:56:39,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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:40,000 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 60 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 235 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:40,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 235 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:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-12-25 09:56:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1398. [2023-12-25 09:56:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1397 states have (on average 1.435934144595562) internal successors, (2006), 1397 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have 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:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2006 transitions. [2023-12-25 09:56:40,018 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2006 transitions. Word has length 76 [2023-12-25 09:56:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:40,018 INFO L495 AbstractCegarLoop]: Abstraction has 1398 states and 2006 transitions. [2023-12-25 09:56:40,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2006 transitions. [2023-12-25 09:56:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 09:56:40,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:40,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, 1, 1, 1, 1, 1, 1, 1, 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:40,036 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 (17)] Ended with exit code 0 [2023-12-25 09:56:40,221 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:40,222 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:40,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:40,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2082677025, now seen corresponding path program 1 times [2023-12-25 09:56:40,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:40,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707651286] [2023-12-25 09:56:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:40,223 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:40,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:40,224 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:40,227 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:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:40,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:56:40,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:40,351 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:40,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:40,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707651286] [2023-12-25 09:56:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707651286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:56:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756095682] [2023-12-25 09:56:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:40,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:56:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:40,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:56:40,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:56:40,352 INFO L87 Difference]: Start difference. First operand 1398 states and 2006 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:40,385 INFO L93 Difference]: Finished difference Result 3602 states and 5180 transitions. [2023-12-25 09:56:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 09:56:40,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-12-25 09:56:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:40,401 INFO L225 Difference]: With dead ends: 3602 [2023-12-25 09:56:40,401 INFO L226 Difference]: Without dead ends: 2280 [2023-12-25 09:56:40,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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:40,403 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 40 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 284 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:40,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 284 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:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2023-12-25 09:56:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2246. [2023-12-25 09:56:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2245 states have (on average 1.3995545657015591) internal successors, (3142), 2245 states have internal predecessors, (3142), 0 states have call successors, (0), 0 states have 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:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3142 transitions. [2023-12-25 09:56:40,424 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3142 transitions. Word has length 77 [2023-12-25 09:56:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:40,424 INFO L495 AbstractCegarLoop]: Abstraction has 2246 states and 3142 transitions. [2023-12-25 09:56:40,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3142 transitions. [2023-12-25 09:56:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-25 09:56:40,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:40,425 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:40,430 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:40,628 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:40,628 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:40,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 343334696, now seen corresponding path program 1 times [2023-12-25 09:56:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:40,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335043954] [2023-12-25 09:56:40,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:40,629 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:40,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:40,630 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:40,648 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:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:40,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:56:40,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:40,712 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:40,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:40,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335043954] [2023-12-25 09:56:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335043954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:40,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:40,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062206943] [2023-12-25 09:56:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:40,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:40,715 INFO L87 Difference]: Start difference. First operand 2246 states and 3142 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:40,759 INFO L93 Difference]: Finished difference Result 4200 states and 5824 transitions. [2023-12-25 09:56:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 09:56:40,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:40,770 INFO L225 Difference]: With dead ends: 4200 [2023-12-25 09:56:40,770 INFO L226 Difference]: Without dead ends: 4198 [2023-12-25 09:56:40,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 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:40,771 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 202 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:40,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 498 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2023-12-25 09:56:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 2390. [2023-12-25 09:56:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2389 states have (on average 1.3721222268731688) internal successors, (3278), 2389 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have 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:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3278 transitions. [2023-12-25 09:56:40,805 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3278 transitions. Word has length 78 [2023-12-25 09:56:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:40,805 INFO L495 AbstractCegarLoop]: Abstraction has 2390 states and 3278 transitions. [2023-12-25 09:56:40,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3278 transitions. [2023-12-25 09:56:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-25 09:56:40,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:40,808 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:40,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:41,011 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:41,011 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:41,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash 198534444, now seen corresponding path program 1 times [2023-12-25 09:56:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284656544] [2023-12-25 09:56:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:41,012 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:41,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:41,013 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:41,020 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:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:41,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:41,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:41,099 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:41,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:41,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:41,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284656544] [2023-12-25 09:56:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284656544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:41,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:41,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126911247] [2023-12-25 09:56:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:41,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:41,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:41,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:41,101 INFO L87 Difference]: Start difference. First operand 2390 states and 3278 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:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:41,118 INFO L93 Difference]: Finished difference Result 4880 states and 6756 transitions. [2023-12-25 09:56:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:41,119 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:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:41,126 INFO L225 Difference]: With dead ends: 4880 [2023-12-25 09:56:41,126 INFO L226 Difference]: Without dead ends: 3436 [2023-12-25 09:56:41,128 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:41,129 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 70 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 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:41,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 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:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2023-12-25 09:56:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3434. [2023-12-25 09:56:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 3433 states have (on average 1.3591610836003496) internal successors, (4666), 3433 states have internal predecessors, (4666), 0 states have call successors, (0), 0 states have 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:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4666 transitions. [2023-12-25 09:56:41,163 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4666 transitions. Word has length 79 [2023-12-25 09:56:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:41,163 INFO L495 AbstractCegarLoop]: Abstraction has 3434 states and 4666 transitions. [2023-12-25 09:56:41,163 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:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4666 transitions. [2023-12-25 09:56:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 09:56:41,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:41,165 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] [2023-12-25 09:56:41,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:41,367 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:41,368 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:41,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1558547986, now seen corresponding path program 1 times [2023-12-25 09:56:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:41,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696584230] [2023-12-25 09:56:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:41,369 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:41,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:41,369 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:41,372 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:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:41,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:41,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:41,465 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 09:56:41,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:41,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696584230] [2023-12-25 09:56:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696584230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:41,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33405974] [2023-12-25 09:56:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:41,467 INFO L87 Difference]: Start difference. First operand 3434 states and 4666 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:41,484 INFO L93 Difference]: Finished difference Result 5972 states and 8159 transitions. [2023-12-25 09:56:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-25 09:56:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:41,490 INFO L225 Difference]: With dead ends: 5972 [2023-12-25 09:56:41,490 INFO L226 Difference]: Without dead ends: 2618 [2023-12-25 09:56:41,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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:41,494 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 57 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 233 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:41,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 233 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:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2023-12-25 09:56:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2616. [2023-12-25 09:56:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2615 states have (on average 1.3518164435946463) internal successors, (3535), 2615 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states have 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:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3535 transitions. [2023-12-25 09:56:41,521 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3535 transitions. Word has length 100 [2023-12-25 09:56:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:41,521 INFO L495 AbstractCegarLoop]: Abstraction has 2616 states and 3535 transitions. [2023-12-25 09:56:41,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3535 transitions. [2023-12-25 09:56:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-25 09:56:41,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:41,523 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] [2023-12-25 09:56:41,528 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:41,725 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:41,725 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:41,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash -742776548, now seen corresponding path program 1 times [2023-12-25 09:56:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16381292] [2023-12-25 09:56:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:41,726 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:41,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:41,727 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:41,728 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:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:41,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:56:41,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:42,500 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 09:56:42,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:42,801 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 09:56:42,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:42,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16381292] [2023-12-25 09:56:42,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16381292] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:42,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:42,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:56:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065126475] [2023-12-25 09:56:42,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:42,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:56:42,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:56:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:56:42,804 INFO L87 Difference]: Start difference. First operand 2616 states and 3535 transitions. Second operand has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:50,338 INFO L93 Difference]: Finished difference Result 15522 states and 20552 transitions. [2023-12-25 09:56:50,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-25 09:56:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 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:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:50,366 INFO L225 Difference]: With dead ends: 15522 [2023-12-25 09:56:50,366 INFO L226 Difference]: Without dead ends: 13040 [2023-12-25 09:56:50,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2214, Invalid=8498, Unknown=0, NotChecked=0, Total=10712 [2023-12-25 09:56:50,373 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 4356 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4356 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:50,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 1333 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 09:56:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13040 states. [2023-12-25 09:56:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13040 to 2616. [2023-12-25 09:56:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2615 states have (on average 1.344168260038241) internal successors, (3515), 2615 states have internal predecessors, (3515), 0 states have call successors, (0), 0 states have 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:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3515 transitions. [2023-12-25 09:56:50,464 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3515 transitions. Word has length 100 [2023-12-25 09:56:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:50,464 INFO L495 AbstractCegarLoop]: Abstraction has 2616 states and 3515 transitions. [2023-12-25 09:56:50,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3515 transitions. [2023-12-25 09:56:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 09:56:50,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:50,465 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] [2023-12-25 09:56:50,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:50,668 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:50,669 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:50,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1970825707, now seen corresponding path program 1 times [2023-12-25 09:56:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624040873] [2023-12-25 09:56:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:50,670 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:50,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:50,671 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:50,671 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:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:50,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 09:56:50,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:51,452 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 09:56:51,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:51,714 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 09:56:51,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:51,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624040873] [2023-12-25 09:56:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624040873] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:51,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-25 09:56:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215184779] [2023-12-25 09:56:51,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:51,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 09:56:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 09:56:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2023-12-25 09:56:51,715 INFO L87 Difference]: Start difference. First operand 2616 states and 3515 transitions. Second operand has 24 states, 24 states have (on average 7.833333333333333) internal successors, (188), 23 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 09:56:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:57,115 INFO L93 Difference]: Finished difference Result 12578 states and 16822 transitions. [2023-12-25 09:56:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-25 09:56:57,117 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.833333333333333) internal successors, (188), 23 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 101 [2023-12-25 09:56:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:57,130 INFO L225 Difference]: With dead ends: 12578 [2023-12-25 09:56:57,130 INFO L226 Difference]: Without dead ends: 10071 [2023-12-25 09:56:57,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1413, Invalid=4439, Unknown=0, NotChecked=0, Total=5852 [2023-12-25 09:56:57,135 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4063 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4063 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:57,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4063 Valid, 1690 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:56:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10071 states. [2023-12-25 09:56:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10071 to 2635. [2023-12-25 09:56:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.3397873955960515) internal successors, (3529), 2634 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have 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:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3529 transitions. [2023-12-25 09:56:57,180 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3529 transitions. Word has length 101 [2023-12-25 09:56:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:57,180 INFO L495 AbstractCegarLoop]: Abstraction has 2635 states and 3529 transitions. [2023-12-25 09:56:57,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.833333333333333) internal successors, (188), 23 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 09:56:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3529 transitions. [2023-12-25 09:56:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-25 09:56:57,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:57,181 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:57,184 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:57,384 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:57,384 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:57,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1954776131, now seen corresponding path program 1 times [2023-12-25 09:56:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057002327] [2023-12-25 09:56:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:57,385 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:57,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:57,386 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:57,387 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:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:57,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:57,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:57,994 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:57,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:58,185 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:58,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:58,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057002327] [2023-12-25 09:56:58,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057002327] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:58,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:58,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:56:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222633945] [2023-12-25 09:56:58,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:58,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:56:58,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:56:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:56:58,186 INFO L87 Difference]: Start difference. First operand 2635 states and 3529 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:57:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:00,581 INFO L93 Difference]: Finished difference Result 11913 states and 15882 transitions. [2023-12-25 09:57:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-25 09:57:00,581 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:57:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:00,592 INFO L225 Difference]: With dead ends: 11913 [2023-12-25 09:57:00,592 INFO L226 Difference]: Without dead ends: 9371 [2023-12-25 09:57:00,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1207, Invalid=3485, Unknown=0, NotChecked=0, Total=4692 [2023-12-25 09:57:00,597 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 1271 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:00,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 852 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 09:57:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9371 states. [2023-12-25 09:57:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9371 to 2775. [2023-12-25 09:57:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2774 states have (on average 1.3298485940879596) internal successors, (3689), 2774 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have 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:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3689 transitions. [2023-12-25 09:57:00,643 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3689 transitions. Word has length 101 [2023-12-25 09:57:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:00,644 INFO L495 AbstractCegarLoop]: Abstraction has 2775 states and 3689 transitions. [2023-12-25 09:57:00,644 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:57:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3689 transitions. [2023-12-25 09:57:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:57:00,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:00,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] [2023-12-25 09:57:00,648 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:57:00,848 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:57:00,848 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:00,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1283612984, now seen corresponding path program 1 times [2023-12-25 09:57:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910538359] [2023-12-25 09:57:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:00,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 09:57:00,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:00,850 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:57:00,850 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:57:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:00,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:57:00,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:01,581 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:01,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:01,856 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:01,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910538359] [2023-12-25 09:57:01,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910538359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:01,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:01,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:57:01,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758102752] [2023-12-25 09:57:01,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:01,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:57:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:01,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:57:01,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:57:01,858 INFO L87 Difference]: Start difference. First operand 2775 states and 3689 transitions. Second operand has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:07,503 INFO L93 Difference]: Finished difference Result 34083 states and 44997 transitions. [2023-12-25 09:57:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-25 09:57:07,504 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-25 09:57:07,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:07,570 INFO L225 Difference]: With dead ends: 34083 [2023-12-25 09:57:07,570 INFO L226 Difference]: Without dead ends: 31401 [2023-12-25 09:57:07,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1545, Invalid=4935, Unknown=0, NotChecked=0, Total=6480 [2023-12-25 09:57:07,577 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 2481 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2481 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:07,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2481 Valid, 3333 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:57:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31401 states. [2023-12-25 09:57:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31401 to 10696. [2023-12-25 09:57:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10696 states, 10695 states have (on average 1.3294997662459094) internal successors, (14219), 10695 states have internal predecessors, (14219), 0 states have call successors, (0), 0 states have 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:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10696 states to 10696 states and 14219 transitions. [2023-12-25 09:57:07,789 INFO L78 Accepts]: Start accepts. Automaton has 10696 states and 14219 transitions. Word has length 102 [2023-12-25 09:57:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:07,790 INFO L495 AbstractCegarLoop]: Abstraction has 10696 states and 14219 transitions. [2023-12-25 09:57:07,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.304347826086957) internal successors, (191), 23 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10696 states and 14219 transitions. [2023-12-25 09:57:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:57:07,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:07,793 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:57:07,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 09:57:07,995 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:57:07,996 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:07,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1740742798, now seen corresponding path program 1 times [2023-12-25 09:57:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828686645] [2023-12-25 09:57:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:07,997 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:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:07,998 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:57:08,004 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:57:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:08,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:57:08,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:08,090 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:57:08,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:57:08,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828686645] [2023-12-25 09:57:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828686645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:57:08,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:57:08,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:57:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786196262] [2023-12-25 09:57:08,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:57:08,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:57:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:08,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:57:08,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:57:08,091 INFO L87 Difference]: Start difference. First operand 10696 states and 14219 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:57:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:08,123 INFO L93 Difference]: Finished difference Result 16010 states and 21285 transitions. [2023-12-25 09:57:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:57:08,123 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:57:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:08,128 INFO L225 Difference]: With dead ends: 16010 [2023-12-25 09:57:08,128 INFO L226 Difference]: Without dead ends: 5518 [2023-12-25 09:57:08,135 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:57:08,136 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 50 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 213 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:57:08,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:57:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2023-12-25 09:57:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5336. [2023-12-25 09:57:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5336 states, 5335 states have (on average 1.2924086223055296) internal successors, (6895), 5335 states have internal predecessors, (6895), 0 states have call successors, (0), 0 states have 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:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5336 states to 5336 states and 6895 transitions. [2023-12-25 09:57:08,183 INFO L78 Accepts]: Start accepts. Automaton has 5336 states and 6895 transitions. Word has length 102 [2023-12-25 09:57:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:08,183 INFO L495 AbstractCegarLoop]: Abstraction has 5336 states and 6895 transitions. [2023-12-25 09:57:08,184 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:57:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5336 states and 6895 transitions. [2023-12-25 09:57:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:57:08,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:08,185 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:57:08,188 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:57:08,388 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:57:08,388 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:08,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:08,389 INFO L85 PathProgramCache]: Analyzing trace with hash -227589618, now seen corresponding path program 1 times [2023-12-25 09:57:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:08,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872038595] [2023-12-25 09:57:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:08,389 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:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:08,390 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:57:08,392 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:57:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:08,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-25 09:57:08,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:10,898 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:57:10,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:12,598 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:57:12,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:12,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872038595] [2023-12-25 09:57:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872038595] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:12,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2023-12-25 09:57:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869638068] [2023-12-25 09:57:12,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:12,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-25 09:57:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-25 09:57:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2437, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 09:57:12,603 INFO L87 Difference]: Start difference. First operand 5336 states and 6895 transitions. Second operand has 53 states, 53 states have (on average 3.5849056603773586) internal successors, (190), 53 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 09:58:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:36,573 INFO L93 Difference]: Finished difference Result 71567 states and 92548 transitions. [2023-12-25 09:58:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 387 states. [2023-12-25 09:58:36,574 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.5849056603773586) internal successors, (190), 53 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 102 [2023-12-25 09:58:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:36,632 INFO L225 Difference]: With dead ends: 71567 [2023-12-25 09:58:36,632 INFO L226 Difference]: Without dead ends: 67963 [2023-12-25 09:58:36,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78535 ImplicationChecksByTransitivity, 73.6s TimeCoverageRelationStatistics Valid=21825, Invalid=166965, Unknown=0, NotChecked=0, Total=188790 [2023-12-25 09:58:36,655 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 12314 mSDsluCounter, 11368 mSDsCounter, 0 mSdLazyCounter, 7164 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12314 SdHoareTripleChecker+Valid, 11793 SdHoareTripleChecker+Invalid, 7625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 7164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:36,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12314 Valid, 11793 Invalid, 7625 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [461 Valid, 7164 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2023-12-25 09:58:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67963 states. [2023-12-25 09:58:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67963 to 11660. [2023-12-25 09:58:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11660 states, 11659 states have (on average 1.298310318209109) internal successors, (15137), 11659 states have internal predecessors, (15137), 0 states have call successors, (0), 0 states have 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:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11660 states to 11660 states and 15137 transitions. [2023-12-25 09:58:37,053 INFO L78 Accepts]: Start accepts. Automaton has 11660 states and 15137 transitions. Word has length 102 [2023-12-25 09:58:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:37,053 INFO L495 AbstractCegarLoop]: Abstraction has 11660 states and 15137 transitions. [2023-12-25 09:58:37,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.5849056603773586) internal successors, (190), 53 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 09:58:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 11660 states and 15137 transitions. [2023-12-25 09:58:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 09:58:37,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:37,056 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:58:37,059 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 (27)] Ended with exit code 0 [2023-12-25 09:58:37,258 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:58:37,259 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:37,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1555732217, now seen corresponding path program 1 times [2023-12-25 09:58:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060628252] [2023-12-25 09:58:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:37,260 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:37,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:37,261 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:58:37,261 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:58:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:37,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 09:58:37,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:39,502 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:39,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:40,575 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:40,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060628252] [2023-12-25 09:58:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060628252] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:40,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 41 [2023-12-25 09:58:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639309634] [2023-12-25 09:58:40,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:40,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 09:58:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 09:58:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 09:58:40,577 INFO L87 Difference]: Start difference. First operand 11660 states and 15137 transitions. Second operand has 41 states, 41 states have (on average 4.7560975609756095) internal successors, (195), 41 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:01:04,522 INFO L93 Difference]: Finished difference Result 84043 states and 108472 transitions. [2023-12-25 10:01:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 436 states. [2023-12-25 10:01:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.7560975609756095) internal successors, (195), 41 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 102 [2023-12-25 10:01:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:01:04,594 INFO L225 Difference]: With dead ends: 84043 [2023-12-25 10:01:04,594 INFO L226 Difference]: Without dead ends: 82188 [2023-12-25 10:01:04,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97285 ImplicationChecksByTransitivity, 135.4s TimeCoverageRelationStatistics Valid=25611, Invalid=197645, Unknown=0, NotChecked=0, Total=223256 [2023-12-25 10:01:04,620 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 6776 mSDsluCounter, 7649 mSDsCounter, 0 mSdLazyCounter, 5543 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6776 SdHoareTripleChecker+Valid, 8051 SdHoareTripleChecker+Invalid, 5694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 5543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:01:04,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6776 Valid, 8051 Invalid, 5694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 5543 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-12-25 10:01:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82188 states. [2023-12-25 10:01:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82188 to 19104. [2023-12-25 10:01:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19104 states, 19103 states have (on average 1.3028843637125058) internal successors, (24889), 19103 states have internal predecessors, (24889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19104 states to 19104 states and 24889 transitions. [2023-12-25 10:01:05,196 INFO L78 Accepts]: Start accepts. Automaton has 19104 states and 24889 transitions. Word has length 102 [2023-12-25 10:01:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:01:05,196 INFO L495 AbstractCegarLoop]: Abstraction has 19104 states and 24889 transitions. [2023-12-25 10:01:05,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.7560975609756095) internal successors, (195), 41 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 19104 states and 24889 transitions. [2023-12-25 10:01:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-25 10:01:05,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:01:05,204 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 10:01:05,209 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 10:01:05,407 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 10:01:05,407 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:01:05,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:01:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 258484044, now seen corresponding path program 1 times [2023-12-25 10:01:05,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:01:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633760615] [2023-12-25 10:01:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:01:05,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:01:05,410 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 10:01:05,410 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 10:01:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:01:05,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 10:01:05,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:01:07,400 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 10:01:07,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:01:08,451 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 10:01:08,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:01:08,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633760615] [2023-12-25 10:01:08,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633760615] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:01:08,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:01:08,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2023-12-25 10:01:08,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175940756] [2023-12-25 10:01:08,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:01:08,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-25 10:01:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:01:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-25 10:01:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1521, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 10:01:08,453 INFO L87 Difference]: Start difference. First operand 19104 states and 24889 transitions. Second operand has 42 states, 42 states have (on average 4.642857142857143) internal successors, (195), 42 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:39,243 INFO L93 Difference]: Finished difference Result 97136 states and 125261 transitions. [2023-12-25 10:05:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 731 states. [2023-12-25 10:05:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.642857142857143) internal successors, (195), 42 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 102 [2023-12-25 10:05:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:39,339 INFO L225 Difference]: With dead ends: 97136 [2023-12-25 10:05:39,340 INFO L226 Difference]: Without dead ends: 93791 [2023-12-25 10:05:39,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 767 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279658 ImplicationChecksByTransitivity, 249.9s TimeCoverageRelationStatistics Valid=46613, Invalid=543979, Unknown=0, NotChecked=0, Total=590592 [2023-12-25 10:05:39,381 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 9337 mSDsluCounter, 13258 mSDsCounter, 0 mSdLazyCounter, 9835 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9337 SdHoareTripleChecker+Valid, 13936 SdHoareTripleChecker+Invalid, 10047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 9835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:39,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9337 Valid, 13936 Invalid, 10047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [212 Valid, 9835 Invalid, 0 Unknown, 0 Unchecked, 20.6s Time] [2023-12-25 10:05:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93791 states. [2023-12-25 10:05:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93791 to 30197. [2023-12-25 10:05:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30197 states, 30196 states have (on average 1.3033514372764605) internal successors, (39356), 30196 states have internal predecessors, (39356), 0 states have call successors, (0), 0 states have 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,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30197 states to 30197 states and 39356 transitions. [2023-12-25 10:05:40,179 INFO L78 Accepts]: Start accepts. Automaton has 30197 states and 39356 transitions. Word has length 102 [2023-12-25 10:05:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:40,180 INFO L495 AbstractCegarLoop]: Abstraction has 30197 states and 39356 transitions. [2023-12-25 10:05:40,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.642857142857143) internal successors, (195), 42 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30197 states and 39356 transitions. [2023-12-25 10:05:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 10:05:40,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:40,186 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] [2023-12-25 10:05:40,191 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 10:05:40,389 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 10:05:40,389 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:05:40,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1265022754, now seen corresponding path program 1 times [2023-12-25 10:05:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787343815] [2023-12-25 10:05:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:40,390 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:40,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:40,391 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 10:05:40,391 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 10:05:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:40,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 10:05:40,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 10:05:40,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 10:05:40,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787343815] [2023-12-25 10:05:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787343815] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:40,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 10:05:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645594682] [2023-12-25 10:05:40,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:40,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 10:05:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 10:05:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 10:05:40,676 INFO L87 Difference]: Start difference. First operand 30197 states and 39356 transitions. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:40,844 INFO L93 Difference]: Finished difference Result 80857 states and 104613 transitions. [2023-12-25 10:05:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 10:05:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-25 10:05:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:41,073 INFO L225 Difference]: With dead ends: 80857 [2023-12-25 10:05:41,073 INFO L226 Difference]: Without dead ends: 52283 [2023-12-25 10:05:41,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 198 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:05:41,090 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 109 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:41,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 511 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:05:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52283 states. [2023-12-25 10:05:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52283 to 43131. [2023-12-25 10:05:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43131 states, 43130 states have (on average 1.2539067934152561) internal successors, (54081), 43130 states have internal predecessors, (54081), 0 states have call successors, (0), 0 states have 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,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43131 states to 43131 states and 54081 transitions. [2023-12-25 10:05:41,656 INFO L78 Accepts]: Start accepts. Automaton has 43131 states and 54081 transitions. Word has length 103 [2023-12-25 10:05:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:41,656 INFO L495 AbstractCegarLoop]: Abstraction has 43131 states and 54081 transitions. [2023-12-25 10:05:41,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43131 states and 54081 transitions. [2023-12-25 10:05:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 10:05:41,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:41,661 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] [2023-12-25 10:05:41,666 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 10:05:41,864 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 10:05:41,864 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:05:41,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:41,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1188570852, now seen corresponding path program 1 times [2023-12-25 10:05:41,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447130328] [2023-12-25 10:05:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:41,865 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,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:41,866 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 10:05:41,867 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 10:05:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:41,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 10:05:41,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:42,468 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:05:42,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:42,636 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:05:42,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447130328] [2023-12-25 10:05:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447130328] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:42,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:42,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 10:05:42,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124588913] [2023-12-25 10:05:42,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:42,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 10:05:42,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 10:05:42,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-12-25 10:05:42,638 INFO L87 Difference]: Start difference. First operand 43131 states and 54081 transitions. Second operand has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have 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,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:44,496 INFO L93 Difference]: Finished difference Result 102748 states and 129076 transitions. [2023-12-25 10:05:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 10:05:44,497 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 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:05:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:44,585 INFO L225 Difference]: With dead ends: 102748 [2023-12-25 10:05:44,585 INFO L226 Difference]: Without dead ends: 81314 [2023-12-25 10:05:44,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=498, Invalid=1664, Unknown=0, NotChecked=0, Total=2162 [2023-12-25 10:05:44,618 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 1474 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:44,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 2999 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 10:05:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81314 states. [2023-12-25 10:05:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81314 to 60226. [2023-12-25 10:05:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60226 states, 60225 states have (on average 1.250942299709423) internal successors, (75338), 60225 states have internal predecessors, (75338), 0 states have call successors, (0), 0 states have 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:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60226 states to 60226 states and 75338 transitions. [2023-12-25 10:05:45,661 INFO L78 Accepts]: Start accepts. Automaton has 60226 states and 75338 transitions. Word has length 103 [2023-12-25 10:05:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:45,661 INFO L495 AbstractCegarLoop]: Abstraction has 60226 states and 75338 transitions. [2023-12-25 10:05:45,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have 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:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 60226 states and 75338 transitions. [2023-12-25 10:05:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 10:05:45,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:45,666 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 10:05:45,684 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 10:05:45,869 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 10:05:45,869 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:05:45,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1215739735, now seen corresponding path program 1 times [2023-12-25 10:05:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37589796] [2023-12-25 10:05:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:45,871 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,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:45,872 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 10:05:45,874 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 10:05:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:45,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:05:45,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:45,971 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:05:45,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:05:45,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37589796] [2023-12-25 10:05:45,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37589796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:05:45,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:05:45,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:05:45,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196573024] [2023-12-25 10:05:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:05:45,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:05:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:05:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:05:45,972 INFO L87 Difference]: Start difference. First operand 60226 states and 75338 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:46,192 INFO L93 Difference]: Finished difference Result 94711 states and 118712 transitions. [2023-12-25 10:05:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:05:46,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-25 10:05:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:46,229 INFO L225 Difference]: With dead ends: 94711 [2023-12-25 10:05:46,229 INFO L226 Difference]: Without dead ends: 35121 [2023-12-25 10:05:46,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:05:46,260 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 81 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:46,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 97 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:05:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35121 states. [2023-12-25 10:05:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35121 to 34615. [2023-12-25 10:05:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34615 states, 34614 states have (on average 1.2309759057028948) internal successors, (42609), 34614 states have internal predecessors, (42609), 0 states have call successors, (0), 0 states have 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:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34615 states to 34615 states and 42609 transitions. [2023-12-25 10:05:46,635 INFO L78 Accepts]: Start accepts. Automaton has 34615 states and 42609 transitions. Word has length 103 [2023-12-25 10:05:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:46,635 INFO L495 AbstractCegarLoop]: Abstraction has 34615 states and 42609 transitions. [2023-12-25 10:05:46,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34615 states and 42609 transitions. [2023-12-25 10:05:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-25 10:05:46,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:46,638 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 10:05:46,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-25 10:05:46,840 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:05:46,841 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:05:46,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:46,841 INFO L85 PathProgramCache]: Analyzing trace with hash -747304644, now seen corresponding path program 1 times [2023-12-25 10:05:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:46,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413509410] [2023-12-25 10:05:46,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:46,842 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:46,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:46,845 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:05:46,854 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:05:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:46,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:05:46,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 10:05:47,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:05:47,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:47,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413509410] [2023-12-25 10:05:47,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413509410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:05:47,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:05:47,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:05:47,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507290533] [2023-12-25 10:05:47,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:05:47,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:05:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:47,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:05:47,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:05:47,072 INFO L87 Difference]: Start difference. First operand 34615 states and 42609 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:05:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:47,205 INFO L93 Difference]: Finished difference Result 56282 states and 69513 transitions. [2023-12-25 10:05:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:05:47,206 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 103 [2023-12-25 10:05:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:47,227 INFO L225 Difference]: With dead ends: 56282 [2023-12-25 10:05:47,228 INFO L226 Difference]: Without dead ends: 22293 [2023-12-25 10:05:47,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:05:47,245 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 79 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:47,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 113 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:05:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22293 states. [2023-12-25 10:05:47,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22293 to 22034. [2023-12-25 10:05:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22034 states, 22033 states have (on average 1.2169473063132574) internal successors, (26813), 22033 states have internal predecessors, (26813), 0 states have call successors, (0), 0 states have 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:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22034 states to 22034 states and 26813 transitions. [2023-12-25 10:05:47,432 INFO L78 Accepts]: Start accepts. Automaton has 22034 states and 26813 transitions. Word has length 103 [2023-12-25 10:05:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:47,432 INFO L495 AbstractCegarLoop]: Abstraction has 22034 states and 26813 transitions. [2023-12-25 10:05:47,432 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:05:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 22034 states and 26813 transitions. [2023-12-25 10:05:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:05:47,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:47,434 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:05:47,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-25 10:05:47,634 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:05:47,634 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:05:47,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash -118509936, now seen corresponding path program 1 times [2023-12-25 10:05:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175520486] [2023-12-25 10:05:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:47,635 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:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:47,636 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:05:47,636 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:05:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:47,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:05:47,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:47,718 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:05:47,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:05:47,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:47,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175520486] [2023-12-25 10:05:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175520486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:05:47,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:05:47,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:05:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769452323] [2023-12-25 10:05:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:05:47,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:05:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:05:47,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:05:47,720 INFO L87 Difference]: Start difference. First operand 22034 states and 26813 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:05:47,968 INFO L93 Difference]: Finished difference Result 40785 states and 49740 transitions. [2023-12-25 10:05:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:05:47,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-25 10:05:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:05:47,984 INFO L225 Difference]: With dead ends: 40785 [2023-12-25 10:05:47,984 INFO L226 Difference]: Without dead ends: 19036 [2023-12-25 10:05:47,992 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:05:47,992 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 76 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:05:47,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 121 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:05:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19036 states. [2023-12-25 10:05:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19036 to 19026. [2023-12-25 10:05:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19026 states, 19025 states have (on average 1.208777923784494) internal successors, (22997), 19025 states have internal predecessors, (22997), 0 states have call successors, (0), 0 states have 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,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19026 states to 19026 states and 22997 transitions. [2023-12-25 10:05:48,182 INFO L78 Accepts]: Start accepts. Automaton has 19026 states and 22997 transitions. Word has length 104 [2023-12-25 10:05:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:05:48,182 INFO L495 AbstractCegarLoop]: Abstraction has 19026 states and 22997 transitions. [2023-12-25 10:05:48,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:05:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 19026 states and 22997 transitions. [2023-12-25 10:05:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:05:48,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:05:48,184 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:05:48,186 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 (34)] Ended with exit code 0 [2023-12-25 10:05:48,384 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:05:48,384 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:05:48,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:05:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1355472254, now seen corresponding path program 1 times [2023-12-25 10:05:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:05:48,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467548618] [2023-12-25 10:05:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:05:48,385 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:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:05:48,386 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:05:48,387 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:05:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:05:48,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 10:05:48,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:05:49,789 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:05:49,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:05:50,660 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:05:50,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:05:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467548618] [2023-12-25 10:05:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467548618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:05:50,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:05:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2023-12-25 10:05:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50611104] [2023-12-25 10:05:50,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:05:50,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 10:05:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:05:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 10:05:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1198, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 10:05:50,662 INFO L87 Difference]: Start difference. First operand 19026 states and 22997 transitions. Second operand has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 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 10:06:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:06:01,476 INFO L93 Difference]: Finished difference Result 43044 states and 51725 transitions. [2023-12-25 10:06:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-12-25 10:06:01,477 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 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 104 [2023-12-25 10:06:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:06:01,509 INFO L225 Difference]: With dead ends: 43044 [2023-12-25 10:06:01,509 INFO L226 Difference]: Without dead ends: 34247 [2023-12-25 10:06:01,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5207 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2878, Invalid=14678, Unknown=0, NotChecked=0, Total=17556 [2023-12-25 10:06:01,523 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 2384 mSDsluCounter, 5628 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 5903 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:06:01,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 5903 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-25 10:06:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34247 states. [2023-12-25 10:06:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34247 to 19208. [2023-12-25 10:06:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19208 states, 19207 states have (on average 1.207372312177852) internal successors, (23190), 19207 states have internal predecessors, (23190), 0 states have call successors, (0), 0 states have 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:06:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 23190 transitions. [2023-12-25 10:06:01,805 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 23190 transitions. Word has length 104 [2023-12-25 10:06:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:06:01,805 INFO L495 AbstractCegarLoop]: Abstraction has 19208 states and 23190 transitions. [2023-12-25 10:06:01,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.078947368421052) internal successors, (193), 38 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 10:06:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 23190 transitions. [2023-12-25 10:06:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:06:01,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:06:01,806 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:06:01,809 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:06:02,007 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:06:02,007 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:06:02,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:06:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -482233164, now seen corresponding path program 1 times [2023-12-25 10:06:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:06:02,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636749711] [2023-12-25 10:06:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:06:02,008 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:06:02,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:06:02,010 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:06:02,011 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:06:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:06:02,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 10:06:02,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:06:03,312 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:06:03,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:06:03,824 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:06:03,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:06:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636749711] [2023-12-25 10:06:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636749711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:06:03,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:06:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 10:06:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566134115] [2023-12-25 10:06:03,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:06:03,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:06:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:06:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:06:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:06:03,826 INFO L87 Difference]: Start difference. First operand 19208 states and 23190 transitions. Second operand has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 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:06:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:06:12,206 INFO L93 Difference]: Finished difference Result 32988 states and 39657 transitions. [2023-12-25 10:06:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-25 10:06:12,207 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 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:06:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:06:12,232 INFO L225 Difference]: With dead ends: 32988 [2023-12-25 10:06:12,232 INFO L226 Difference]: Without dead ends: 26105 [2023-12-25 10:06:12,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2060 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1052, Invalid=7138, Unknown=0, NotChecked=0, Total=8190 [2023-12-25 10:06:12,242 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 2527 mSDsluCounter, 5760 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2527 SdHoareTripleChecker+Valid, 6148 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 10:06:12,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2527 Valid, 6148 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 10:06:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26105 states. [2023-12-25 10:06:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26105 to 19159. [2023-12-25 10:06:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19159 states, 19158 states have (on average 1.2075373212235097) internal successors, (23134), 19158 states have internal predecessors, (23134), 0 states have call successors, (0), 0 states have 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:06:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19159 states to 19159 states and 23134 transitions. [2023-12-25 10:06:12,418 INFO L78 Accepts]: Start accepts. Automaton has 19159 states and 23134 transitions. Word has length 104 [2023-12-25 10:06:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:06:12,419 INFO L495 AbstractCegarLoop]: Abstraction has 19159 states and 23134 transitions. [2023-12-25 10:06:12,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 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:06:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 19159 states and 23134 transitions. [2023-12-25 10:06:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-25 10:06:12,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:06:12,420 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:06:12,422 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 (36)] Ended with exit code 0 [2023-12-25 10:06:12,620 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:06:12,620 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:06:12,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:06:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 320826172, now seen corresponding path program 1 times [2023-12-25 10:06:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:06:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104967666] [2023-12-25 10:06:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:06:12,621 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:06:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:06:12,622 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:06:12,626 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:06:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:06:12,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 10:06:12,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:06:13,900 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:06:13,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:06:14,546 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:06:14,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:06:14,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104967666] [2023-12-25 10:06:14,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104967666] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:06:14,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:06:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2023-12-25 10:06:14,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740478061] [2023-12-25 10:06:14,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:06:14,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 10:06:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:06:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 10:06:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 10:06:14,548 INFO L87 Difference]: Start difference. First operand 19159 states and 23134 transitions. Second operand has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 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:06:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:06:25,666 INFO L93 Difference]: Finished difference Result 44433 states and 53751 transitions. [2023-12-25 10:06:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2023-12-25 10:06:25,667 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-25 10:06:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:06:25,700 INFO L225 Difference]: With dead ends: 44433 [2023-12-25 10:06:25,700 INFO L226 Difference]: Without dead ends: 35749 [2023-12-25 10:06:25,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8053 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=4584, Invalid=20856, Unknown=0, NotChecked=0, Total=25440 [2023-12-25 10:06:25,715 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 2310 mSDsluCounter, 6876 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 7308 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 10:06:25,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 7308 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 10:06:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35749 states. [2023-12-25 10:06:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35749 to 20753. [2023-12-25 10:06:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20753 states, 20752 states have (on average 1.2077390131071704) internal successors, (25063), 20752 states have internal predecessors, (25063), 0 states have call successors, (0), 0 states have 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:06:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20753 states to 20753 states and 25063 transitions. [2023-12-25 10:06:26,027 INFO L78 Accepts]: Start accepts. Automaton has 20753 states and 25063 transitions. Word has length 104 [2023-12-25 10:06:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:06:26,027 INFO L495 AbstractCegarLoop]: Abstraction has 20753 states and 25063 transitions. [2023-12-25 10:06:26,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 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:06:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20753 states and 25063 transitions. [2023-12-25 10:06:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 10:06:26,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:06:26,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:06:26,034 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:06:26,230 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:06:26,230 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:06:26,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:06:26,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1638637385, now seen corresponding path program 1 times [2023-12-25 10:06:26,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:06:26,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889348231] [2023-12-25 10:06:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:06:26,231 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:06:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:06:26,232 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:06:26,233 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:06:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:06:26,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 10:06:26,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:06:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 10:06:26,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 10:06:26,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:06:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889348231] [2023-12-25 10:06:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889348231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 10:06:26,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 10:06:26,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 10:06:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103537683] [2023-12-25 10:06:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 10:06:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 10:06:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:06:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 10:06:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 10:06:26,333 INFO L87 Difference]: Start difference. First operand 20753 states and 25063 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have 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:06:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:06:26,383 INFO L93 Difference]: Finished difference Result 26963 states and 32488 transitions. [2023-12-25 10:06:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 10:06:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 126 [2023-12-25 10:06:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:06:26,388 INFO L225 Difference]: With dead ends: 26963 [2023-12-25 10:06:26,388 INFO L226 Difference]: Without dead ends: 6736 [2023-12-25 10:06:26,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 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:06:26,397 INFO L413 NwaCegarLoop]: 124 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, 191 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:06:26,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 10:06:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2023-12-25 10:06:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 6734. [2023-12-25 10:06:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6734 states, 6733 states have (on average 1.1638199910886677) internal successors, (7836), 6733 states have internal predecessors, (7836), 0 states have call successors, (0), 0 states have 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:06:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 7836 transitions. [2023-12-25 10:06:26,441 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 7836 transitions. Word has length 126 [2023-12-25 10:06:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:06:26,441 INFO L495 AbstractCegarLoop]: Abstraction has 6734 states and 7836 transitions. [2023-12-25 10:06:26,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have 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:06:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 7836 transitions. [2023-12-25 10:06:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-25 10:06:26,443 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:06:26,443 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] [2023-12-25 10:06:26,446 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:06:26,643 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:06:26,644 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:06:26,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:06:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash -570156462, now seen corresponding path program 1 times [2023-12-25 10:06:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:06:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16422235] [2023-12-25 10:06:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:06:26,645 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:06:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:06:26,646 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:06:26,655 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:06:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:06:26,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 10:06:26,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:06:28,266 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:06:28,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:06:29,989 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:06:29,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:06:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16422235] [2023-12-25 10:06:29,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16422235] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:06:29,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:06:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2023-12-25 10:06:29,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872155037] [2023-12-25 10:06:29,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:06:29,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-25 10:06:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:06:29,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-25 10:06:29,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2619, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 10:06:29,991 INFO L87 Difference]: Start difference. First operand 6734 states and 7836 transitions. Second operand has 53 states, 53 states have (on average 5.0754716981132075) internal successors, (269), 53 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:08:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:08:06,023 INFO L93 Difference]: Finished difference Result 21546 states and 25426 transitions. [2023-12-25 10:08:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2023-12-25 10:08:06,023 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.0754716981132075) internal successors, (269), 53 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2023-12-25 10:08:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:08:06,037 INFO L225 Difference]: With dead ends: 21546 [2023-12-25 10:08:06,037 INFO L226 Difference]: Without dead ends: 20174 [2023-12-25 10:08:06,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 77070 ImplicationChecksByTransitivity, 89.6s TimeCoverageRelationStatistics Valid=16580, Invalid=178342, Unknown=0, NotChecked=0, Total=194922 [2023-12-25 10:08:06,046 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 6092 mSDsluCounter, 11597 mSDsCounter, 0 mSdLazyCounter, 7479 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6092 SdHoareTripleChecker+Valid, 12032 SdHoareTripleChecker+Invalid, 7641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 7479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:08:06,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6092 Valid, 12032 Invalid, 7641 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [162 Valid, 7479 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-12-25 10:08:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20174 states. [2023-12-25 10:08:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20174 to 11246. [2023-12-25 10:08:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11246 states, 11245 states have (on average 1.174299688750556) internal successors, (13205), 11245 states have internal predecessors, (13205), 0 states have call successors, (0), 0 states have 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:08:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 13205 transitions. [2023-12-25 10:08:06,187 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 13205 transitions. Word has length 150 [2023-12-25 10:08:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:08:06,187 INFO L495 AbstractCegarLoop]: Abstraction has 11246 states and 13205 transitions. [2023-12-25 10:08:06,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.0754716981132075) internal successors, (269), 53 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:08:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 13205 transitions. [2023-12-25 10:08:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-25 10:08:06,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:08:06,190 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] [2023-12-25 10:08:06,193 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:08:06,393 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:08:06,393 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:08:06,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:08:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash 964728213, now seen corresponding path program 1 times [2023-12-25 10:08:06,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:08:06,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909065762] [2023-12-25 10:08:06,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:08:06,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:08:06,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:08:06,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:08:06,395 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:08:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:08:06,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 10:08:06,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:08:07,460 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:08:07,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:08:08,454 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:08:08,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:08:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909065762] [2023-12-25 10:08:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909065762] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:08:08,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:08:08,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2023-12-25 10:08:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186576629] [2023-12-25 10:08:08,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:08:08,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 10:08:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:08:08,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 10:08:08,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 10:08:08,456 INFO L87 Difference]: Start difference. First operand 11246 states and 13205 transitions. Second operand has 36 states, 36 states have (on average 7.361111111111111) internal successors, (265), 36 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:08:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:08:12,792 INFO L93 Difference]: Finished difference Result 21089 states and 24862 transitions. [2023-12-25 10:08:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-25 10:08:12,793 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.361111111111111) internal successors, (265), 36 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2023-12-25 10:08:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:08:12,809 INFO L225 Difference]: With dead ends: 21089 [2023-12-25 10:08:12,809 INFO L226 Difference]: Without dead ends: 18994 [2023-12-25 10:08:12,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2023-12-25 10:08:12,815 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1893 mSDsluCounter, 4824 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1893 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:08:12,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1893 Valid, 5017 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 10:08:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18994 states. [2023-12-25 10:08:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18994 to 13412. [2023-12-25 10:08:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13412 states, 13411 states have (on average 1.1735142793229438) internal successors, (15738), 13411 states have internal predecessors, (15738), 0 states have call successors, (0), 0 states have 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:08:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13412 states to 13412 states and 15738 transitions. [2023-12-25 10:08:12,949 INFO L78 Accepts]: Start accepts. Automaton has 13412 states and 15738 transitions. Word has length 150 [2023-12-25 10:08:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:08:12,949 INFO L495 AbstractCegarLoop]: Abstraction has 13412 states and 15738 transitions. [2023-12-25 10:08:12,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.361111111111111) internal successors, (265), 36 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:08:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 13412 states and 15738 transitions. [2023-12-25 10:08:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-25 10:08:12,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:08:12,952 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] [2023-12-25 10:08:12,954 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:08:13,153 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:08:13,153 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:08:13,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:08:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1187203563, now seen corresponding path program 1 times [2023-12-25 10:08:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:08:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230015980] [2023-12-25 10:08:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:08:13,154 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:08:13,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:08:13,155 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:08:13,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 (41)] Waiting until timeout for monitored process [2023-12-25 10:08:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:08:13,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 10:08:13,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:08:13,824 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:08:13,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:08:14,043 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:08:14,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:08:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230015980] [2023-12-25 10:08:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230015980] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:08:14,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:08:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 10:08:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454416729] [2023-12-25 10:08:14,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:08:14,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 10:08:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:08:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 10:08:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 10:08:14,044 INFO L87 Difference]: Start difference. First operand 13412 states and 15738 transitions. Second operand has 18 states, 18 states have (on average 14.055555555555555) internal successors, (253), 17 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:08:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:08:14,920 INFO L93 Difference]: Finished difference Result 18812 states and 22200 transitions. [2023-12-25 10:08:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 10:08:14,920 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.055555555555555) internal successors, (253), 17 states have internal predecessors, (253), 0 states have call successors, (0), 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:08:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:08:14,927 INFO L225 Difference]: With dead ends: 18812 [2023-12-25 10:08:14,927 INFO L226 Difference]: Without dead ends: 8560 [2023-12-25 10:08:14,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2023-12-25 10:08:14,932 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 583 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:08:14,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 586 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 10:08:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2023-12-25 10:08:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 6804. [2023-12-25 10:08:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6804 states, 6803 states have (on average 1.1540496839629575) internal successors, (7851), 6803 states have internal predecessors, (7851), 0 states have call successors, (0), 0 states have 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:08:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6804 states to 6804 states and 7851 transitions. [2023-12-25 10:08:14,985 INFO L78 Accepts]: Start accepts. Automaton has 6804 states and 7851 transitions. Word has length 151 [2023-12-25 10:08:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:08:14,985 INFO L495 AbstractCegarLoop]: Abstraction has 6804 states and 7851 transitions. [2023-12-25 10:08:14,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.055555555555555) internal successors, (253), 17 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have 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:08:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6804 states and 7851 transitions. [2023-12-25 10:08:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:08:14,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:08:14,987 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] [2023-12-25 10:08:14,990 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 (41)] Ended with exit code 0 [2023-12-25 10:08:15,190 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:08:15,190 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:08:15,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:08:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1322513025, now seen corresponding path program 1 times [2023-12-25 10:08:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:08:15,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976816215] [2023-12-25 10:08:15,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:08:15,191 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:08:15,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:08:15,192 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:08:15,192 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:08:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:08:15,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 10:08:15,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:08:16,031 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:08:16,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:08:16,462 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:08:16,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:08:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976816215] [2023-12-25 10:08:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976816215] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:08:16,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:08:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 10:08:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079365583] [2023-12-25 10:08:16,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:08:16,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:08:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:08:16,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:08:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:08:16,464 INFO L87 Difference]: Start difference. First operand 6804 states and 7851 transitions. Second operand has 33 states, 33 states have (on average 8.575757575757576) internal successors, (283), 33 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:08:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:08:21,262 INFO L93 Difference]: Finished difference Result 10559 states and 12211 transitions. [2023-12-25 10:08:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-12-25 10:08:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.575757575757576) internal successors, (283), 33 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2023-12-25 10:08:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:08:21,268 INFO L225 Difference]: With dead ends: 10559 [2023-12-25 10:08:21,268 INFO L226 Difference]: Without dead ends: 8127 [2023-12-25 10:08:21,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1389, Invalid=7923, Unknown=0, NotChecked=0, Total=9312 [2023-12-25 10:08:21,271 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1808 mSDsluCounter, 4368 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 4639 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:08:21,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 4639 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 10:08:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8127 states. [2023-12-25 10:08:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8127 to 6401. [2023-12-25 10:08:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6401 states, 6400 states have (on average 1.15171875) internal successors, (7371), 6400 states have internal predecessors, (7371), 0 states have call successors, (0), 0 states have 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:08:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 7371 transitions. [2023-12-25 10:08:21,320 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 7371 transitions. Word has length 152 [2023-12-25 10:08:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:08:21,321 INFO L495 AbstractCegarLoop]: Abstraction has 6401 states and 7371 transitions. [2023-12-25 10:08:21,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.575757575757576) internal successors, (283), 33 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:08:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 7371 transitions. [2023-12-25 10:08:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:08:21,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:08:21,323 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] [2023-12-25 10:08:21,325 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 (42)] Ended with exit code 0 [2023-12-25 10:08:21,523 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:08:21,523 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:08:21,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:08:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 907941889, now seen corresponding path program 1 times [2023-12-25 10:08:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:08:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029644670] [2023-12-25 10:08:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:08:21,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 10:08:21,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:08:21,525 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:08:21,525 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:08:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:08:21,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:08:21,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:08:21,753 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:08:21,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:08:21,936 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:08:21,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:08:21,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029644670] [2023-12-25 10:08:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029644670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:08:21,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:08:21,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 10:08:21,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565350298] [2023-12-25 10:08:21,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:08:21,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 10:08:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:08:21,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 10:08:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 10:08:21,938 INFO L87 Difference]: Start difference. First operand 6401 states and 7371 transitions. Second operand has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 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:08:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:08:22,058 INFO L93 Difference]: Finished difference Result 24178 states and 29078 transitions. [2023-12-25 10:08:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 10:08:22,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 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:08:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:08:22,074 INFO L225 Difference]: With dead ends: 24178 [2023-12-25 10:08:22,074 INFO L226 Difference]: Without dead ends: 18453 [2023-12-25 10:08:22,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 294 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:08:22,081 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 424 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:08:22,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 863 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:08:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18453 states. [2023-12-25 10:08:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18453 to 18445. [2023-12-25 10:08:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18445 states, 18444 states have (on average 1.1325092170895685) internal successors, (20888), 18444 states have internal predecessors, (20888), 0 states have call successors, (0), 0 states have 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:08:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18445 states to 18445 states and 20888 transitions. [2023-12-25 10:08:22,209 INFO L78 Accepts]: Start accepts. Automaton has 18445 states and 20888 transitions. Word has length 152 [2023-12-25 10:08:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:08:22,209 INFO L495 AbstractCegarLoop]: Abstraction has 18445 states and 20888 transitions. [2023-12-25 10:08:22,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 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:08:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18445 states and 20888 transitions. [2023-12-25 10:08:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:08:22,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:08:22,211 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] [2023-12-25 10:08:22,213 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:08:22,411 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:08:22,412 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:08:22,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:08:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -64521817, now seen corresponding path program 1 times [2023-12-25 10:08:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:08:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492577132] [2023-12-25 10:08:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:08:22,412 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:08:22,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:08:22,413 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:08:22,414 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:08:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:08:22,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 10:08:22,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:08:23,203 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:08:23,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:08:23,591 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:08:23,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:08:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492577132] [2023-12-25 10:08:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492577132] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:08:23,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:08:23,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2023-12-25 10:08:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152242976] [2023-12-25 10:08:23,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:08:23,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 10:08:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:08:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 10:08:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2023-12-25 10:08:23,593 INFO L87 Difference]: Start difference. First operand 18445 states and 20888 transitions. Second operand has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 31 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have 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:08:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:08:26,700 INFO L93 Difference]: Finished difference Result 32762 states and 36998 transitions. [2023-12-25 10:08:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-25 10:08:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 31 states have internal predecessors, (284), 0 states have call successors, (0), 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:08:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:08:26,721 INFO L225 Difference]: With dead ends: 32762 [2023-12-25 10:08:26,721 INFO L226 Difference]: Without dead ends: 22993 [2023-12-25 10:08:26,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=952, Invalid=5368, Unknown=0, NotChecked=0, Total=6320 [2023-12-25 10:08:26,735 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 1468 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 10:08:26,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 3687 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 10:08:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22993 states. [2023-12-25 10:08:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22993 to 18037. [2023-12-25 10:08:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18037 states, 18036 states have (on average 1.1332335329341316) internal successors, (20439), 18036 states have internal predecessors, (20439), 0 states have call successors, (0), 0 states have 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:08:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18037 states to 18037 states and 20439 transitions. [2023-12-25 10:08:26,892 INFO L78 Accepts]: Start accepts. Automaton has 18037 states and 20439 transitions. Word has length 152 [2023-12-25 10:08:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:08:26,892 INFO L495 AbstractCegarLoop]: Abstraction has 18037 states and 20439 transitions. [2023-12-25 10:08:26,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 31 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have 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:08:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18037 states and 20439 transitions. [2023-12-25 10:08:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:08:26,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:08:26,894 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] [2023-12-25 10:08:26,896 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 (44)] Ended with exit code 0 [2023-12-25 10:08:27,094 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:08:27,094 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:08:27,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:08:27,095 INFO L85 PathProgramCache]: Analyzing trace with hash 233704075, now seen corresponding path program 1 times [2023-12-25 10:08:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:08:27,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605671664] [2023-12-25 10:08:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:08:27,095 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:08:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:08:27,096 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:08:27,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 (45)] Waiting until timeout for monitored process [2023-12-25 10:08:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:08:27,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 10:08:27,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:08:28,707 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:08:28,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:08:30,465 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:08:30,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:08:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605671664] [2023-12-25 10:08:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605671664] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:08:30,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:08:30,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2023-12-25 10:08:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650816641] [2023-12-25 10:08:30,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:08:30,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-25 10:08:30,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:08:30,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-25 10:08:30,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2826, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 10:08:30,467 INFO L87 Difference]: Start difference. First operand 18037 states and 20439 transitions. Second operand has 55 states, 55 states have (on average 4.945454545454545) internal successors, (272), 55 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have 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:10:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:10:23,337 INFO L93 Difference]: Finished difference Result 38979 states and 44583 transitions. [2023-12-25 10:10:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 375 states. [2023-12-25 10:10:23,338 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.945454545454545) internal successors, (272), 55 states have internal predecessors, (272), 0 states have call successors, (0), 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:10:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:10:23,369 INFO L225 Difference]: With dead ends: 38979 [2023-12-25 10:10:23,369 INFO L226 Difference]: Without dead ends: 38071 [2023-12-25 10:10:23,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 71911 ImplicationChecksByTransitivity, 106.9s TimeCoverageRelationStatistics Valid=16064, Invalid=165838, Unknown=0, NotChecked=0, Total=181902 [2023-12-25 10:10:23,382 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 5060 mSDsluCounter, 9411 mSDsCounter, 0 mSdLazyCounter, 6276 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5060 SdHoareTripleChecker+Valid, 9682 SdHoareTripleChecker+Invalid, 6429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 6276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-25 10:10:23,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5060 Valid, 9682 Invalid, 6429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 6276 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-12-25 10:10:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38071 states. [2023-12-25 10:10:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38071 to 19507. [2023-12-25 10:10:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19507 states, 19506 states have (on average 1.1372398236440069) internal successors, (22183), 19506 states have internal predecessors, (22183), 0 states have call successors, (0), 0 states have 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:10:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19507 states to 19507 states and 22183 transitions. [2023-12-25 10:10:23,676 INFO L78 Accepts]: Start accepts. Automaton has 19507 states and 22183 transitions. Word has length 152 [2023-12-25 10:10:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:10:23,676 INFO L495 AbstractCegarLoop]: Abstraction has 19507 states and 22183 transitions. [2023-12-25 10:10:23,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.945454545454545) internal successors, (272), 55 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have 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:10:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 19507 states and 22183 transitions. [2023-12-25 10:10:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:10:23,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:10:23,677 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:10:23,680 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 (45)] Ended with exit code 0 [2023-12-25 10:10:23,880 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:10:23,880 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:10:23,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:10:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1039775515, now seen corresponding path program 1 times [2023-12-25 10:10:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:10:23,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827862197] [2023-12-25 10:10:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:10:23,881 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:10:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:10:23,882 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:10:23,883 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:10:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:10:23,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 10:10:23,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:10:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 29 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:10:25,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:10:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:10:25,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:10:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827862197] [2023-12-25 10:10:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827862197] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:10:25,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:10:25,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2023-12-25 10:10:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204727925] [2023-12-25 10:10:25,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:10:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 10:10:25,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:10:25,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 10:10:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2023-12-25 10:10:25,523 INFO L87 Difference]: Start difference. First operand 19507 states and 22183 transitions. Second operand has 28 states, 28 states have (on average 10.535714285714286) internal successors, (295), 28 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:10:34,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:10:34,108 INFO L93 Difference]: Finished difference Result 73070 states and 82740 transitions. [2023-12-25 10:10:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-25 10:10:34,109 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.535714285714286) internal successors, (295), 28 states have internal predecessors, (295), 0 states have call successors, (0), 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:10:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:10:34,169 INFO L225 Difference]: With dead ends: 73070 [2023-12-25 10:10:34,169 INFO L226 Difference]: Without dead ends: 64383 [2023-12-25 10:10:34,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3578 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2062, Invalid=10370, Unknown=0, NotChecked=0, Total=12432 [2023-12-25 10:10:34,189 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 2538 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2538 SdHoareTripleChecker+Valid, 3890 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 10:10:34,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2538 Valid, 3890 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 10:10:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64383 states. [2023-12-25 10:10:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64383 to 20277. [2023-12-25 10:10:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20277 states, 20276 states have (on average 1.1301538765042414) internal successors, (22915), 20276 states have internal predecessors, (22915), 0 states have call successors, (0), 0 states have 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:10:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20277 states to 20277 states and 22915 transitions. [2023-12-25 10:10:34,591 INFO L78 Accepts]: Start accepts. Automaton has 20277 states and 22915 transitions. Word has length 152 [2023-12-25 10:10:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:10:34,591 INFO L495 AbstractCegarLoop]: Abstraction has 20277 states and 22915 transitions. [2023-12-25 10:10:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.535714285714286) internal successors, (295), 28 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:10:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20277 states and 22915 transitions. [2023-12-25 10:10:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 10:10:34,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:10:34,593 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] [2023-12-25 10:10:34,597 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 (46)] Forceful destruction successful, exit code 0 [2023-12-25 10:10:34,793 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:10:34,793 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:10:34,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:10:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2095798881, now seen corresponding path program 1 times [2023-12-25 10:10:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:10:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031229180] [2023-12-25 10:10:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:10:34,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 10:10:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:10:34,795 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:10:34,796 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:10:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:10:34,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 10:10:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:10:35,150 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 10:10:35,151 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 10:10:35,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-25 10:10:35,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-25 10:10:35,156 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:10:35,356 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:10:35,359 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] [2023-12-25 10:10:35,361 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 10:10:35,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 10:10:35 BoogieIcfgContainer [2023-12-25 10:10:35,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 10:10:35,483 INFO L158 Benchmark]: Toolchain (without parser) took 856396.50ms. Allocated memory was 288.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 236.1MB in the beginning and 1.1GB in the end (delta: -877.2MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-25 10:10:35,483 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 10:10:35,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.14ms. Allocated memory is still 288.4MB. Free memory was 235.8MB in the beginning and 216.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-25 10:10:35,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.12ms. Allocated memory is still 288.4MB. Free memory was 216.2MB in the beginning and 213.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 10:10:35,484 INFO L158 Benchmark]: Boogie Preprocessor took 42.07ms. Allocated memory is still 288.4MB. Free memory was 213.8MB in the beginning and 210.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 10:10:35,484 INFO L158 Benchmark]: RCFGBuilder took 578.54ms. Allocated memory is still 288.4MB. Free memory was 210.3MB in the beginning and 236.8MB in the end (delta: -26.5MB). Peak memory consumption was 21.7MB. Max. memory is 8.0GB. [2023-12-25 10:10:35,484 INFO L158 Benchmark]: TraceAbstraction took 855446.63ms. Allocated memory was 288.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 236.3MB in the beginning and 1.1GB in the end (delta: -877.0MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-25 10:10:35,485 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.11ms. Allocated memory is still 205.5MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.14ms. Allocated memory is still 288.4MB. Free memory was 235.8MB in the beginning and 216.5MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.12ms. Allocated memory is still 288.4MB. Free memory was 216.2MB in the beginning and 213.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.07ms. Allocated memory is still 288.4MB. Free memory was 213.8MB in the beginning and 210.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 578.54ms. Allocated memory is still 288.4MB. Free memory was 210.3MB in the beginning and 236.8MB in the end (delta: -26.5MB). Peak memory consumption was 21.7MB. Max. memory is 8.0GB. * TraceAbstraction took 855446.63ms. Allocated memory was 288.4MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 236.3MB in the beginning and 1.1GB in the end (delta: -877.0MB). Peak memory consumption was 1.6GB. 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: 377]: 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_1467; [L58] int __return_1532; [L59] int __return_1599; [L60] int __return_1677; [L61] int __return_1696; [L64] int main__c1; [L65] int main__i2; [L66] main__c1 = 0 [L67] r1 = __VERIFIER_nondet_uchar() [L68] id1 = __VERIFIER_nondet_char() [L69] st1 = __VERIFIER_nondet_char() [L70] send1 = __VERIFIER_nondet_char() [L71] mode1 = __VERIFIER_nondet_bool() [L72] id2 = __VERIFIER_nondet_char() [L73] st2 = __VERIFIER_nondet_char() [L74] send2 = __VERIFIER_nondet_char() [L75] mode2 = __VERIFIER_nondet_bool() [L76] id3 = __VERIFIER_nondet_char() [L77] st3 = __VERIFIER_nondet_char() [L78] send3 = __VERIFIER_nondet_char() [L79] mode3 = __VERIFIER_nondet_bool() [L81] int init__tmp; VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L82] COND TRUE ((int)r1) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L84] COND TRUE ((int)id1) >= 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L86] COND TRUE ((int)st1) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L88] COND TRUE ((int)send1) == ((int)id1) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L90] COND TRUE ((int)mode1) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L92] COND TRUE ((int)id2) >= 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L94] COND TRUE ((int)st2) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L96] COND TRUE ((int)send2) == ((int)id2) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L98] COND TRUE ((int)mode2) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L100] COND TRUE ((int)id3) >= 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L102] COND TRUE ((int)st3) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L104] COND TRUE ((int)send3) == ((int)id3) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L106] COND TRUE ((int)mode3) == 0 VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L108] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L110] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1394=0, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L112] COND TRUE ((int)id2) != ((int)id3) [L114] init__tmp = 1 [L115] __return_1394 = init__tmp [L116] main__i2 = __return_1394 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L117] COND TRUE main__i2 != 0 [L119] p1_old = nomsg [L120] p1_new = nomsg [L121] p2_old = nomsg [L122] p2_new = nomsg [L123] p3_old = nomsg [L124] p3_new = nomsg [L125] main__i2 = 0 [L127] msg_t node1__m1; [L128] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L129] COND FALSE !(!(mode1 == 0)) [L135] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L136] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L138] COND TRUE p1_new == nomsg [L140] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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____CPAchecker_TMP_0=64, 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] [L142] p1_new = node1____CPAchecker_TMP_0 [L143] mode1 = 1 [L145] msg_t node2__m2; [L146] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L147] COND FALSE !(!(mode2 == 0)) [L153] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L154] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L156] COND TRUE p2_new == nomsg [L158] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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____CPAchecker_TMP_0=32, 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] [L160] p2_new = node2____CPAchecker_TMP_0 [L161] mode2 = 1 [L163] msg_t node3__m3; [L164] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L165] COND FALSE !(!(mode3 == 0)) [L171] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L172] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L174] COND TRUE p3_new == nomsg [L176] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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____CPAchecker_TMP_0=0, 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] [L178] p3_new = node3____CPAchecker_TMP_0 [L179] mode3 = 1 [L180] p1_old = p1_new [L181] p1_new = nomsg [L182] p2_old = p2_new [L183] p2_new = nomsg [L184] p3_old = p3_new [L185] p3_new = nomsg [L187] int check__tmp; VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L188] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L190] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=0, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 [L201] __return_1467 = check__tmp [L202] main__c1 = __return_1467 [L204] _Bool __tmp_1; [L205] __tmp_1 = main__c1 [L206] _Bool assert__arg; [L207] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L208] COND FALSE !(assert__arg == 0) [L215] msg_t node1__m1; [L216] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L217] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L219] COND FALSE !(r1 == 255) [L225] r1 = r1 + 1 [L226] node1__m1 = p3_old [L227] p3_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L228] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L230] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L650] COND FALSE !(((int)node1__m1) == ((int)id1)) [L657] send1 = node1__m1 VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L234] mode1 = 0 [L236] msg_t node2__m2; [L237] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L238] COND TRUE !(mode2 == 0) [L240] node2__m2 = p1_old [L241] p1_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L242] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L244] COND TRUE ((int)node2__m2) > ((int)id2) [L246] send2 = node2__m2 VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L248] mode2 = 0 [L250] msg_t node3__m3; [L251] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L252] COND TRUE !(mode3 == 0) [L254] node3__m3 = p2_old [L255] p2_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L256] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L258] COND TRUE ((int)node3__m3) > ((int)id3) [L260] send3 = node3__m3 VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L262] mode3 = 0 [L263] p1_old = p1_new [L264] p1_new = nomsg [L265] p2_old = p2_new [L266] p2_new = nomsg [L267] p3_old = p3_new [L268] p3_new = nomsg [L270] int check__tmp; VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L271] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L273] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L279] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=1, __return_1532=0, __return_1599=0, __return_1677=0, __return_1696=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] [L281] COND TRUE ((int)r1) < 3 [L283] check__tmp = 1 [L284] __return_1532 = check__tmp [L285] main__c1 = __return_1532 [L287] _Bool __tmp_2; [L288] __tmp_2 = main__c1 [L289] _Bool assert__arg; [L290] assert__arg = __tmp_2 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L291] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L299] msg_t node1__m1; [L300] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L301] COND FALSE !(!(mode1 == 0)) [L536] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L537] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L539] COND TRUE p1_new == nomsg [L541] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L543] p1_new = node1____CPAchecker_TMP_0 [L544] mode1 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L319] msg_t node2__m2; [L320] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L321] COND FALSE !(!(mode2 == 0)) [L485] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L486] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L488] COND TRUE p2_new == nomsg [L490] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L492] p2_new = node2____CPAchecker_TMP_0 [L493] mode2 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L334] msg_t node3__m3; [L335] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L336] COND FALSE !(!(mode3 == 0)) [L440] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L441] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L443] COND TRUE p3_new == nomsg [L445] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L447] p3_new = node3____CPAchecker_TMP_0 [L448] mode3 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L348] p1_old = p1_new [L349] p1_new = nomsg [L350] p2_old = p2_new [L351] p2_new = nomsg [L352] p3_old = p3_new [L353] p3_new = nomsg [L355] int check__tmp; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L356] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L358] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L402] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L361] COND TRUE ((int)r1) < 3 [L363] check__tmp = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L367] __return_1599 = check__tmp [L368] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L375] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L299] msg_t node1__m1; [L300] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L301] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L303] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L307] r1 = r1 + 1 [L308] node1__m1 = p3_old [L309] p3_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L310] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L312] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L512] COND FALSE !(((int)node1__m1) == ((int)id1)) [L519] send1 = node1__m1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L316] mode1 = 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L319] msg_t node2__m2; [L320] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L321] COND TRUE !(mode2 == 0) [L323] node2__m2 = p1_old [L324] p1_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L325] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L327] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L467] COND FALSE !(((int)node2__m2) == ((int)id2)) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L331] mode2 = 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L334] msg_t node3__m3; [L335] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L336] COND TRUE !(mode3 == 0) [L338] node3__m3 = p2_old [L339] p2_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L340] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L342] COND TRUE ((int)node3__m3) > ((int)id3) [L344] send3 = node3__m3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L346] mode3 = 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L348] p1_old = p1_new [L349] p1_new = nomsg [L350] p2_old = p2_new [L351] p2_new = nomsg [L352] p3_old = p3_new [L353] p3_new = nomsg [L355] int check__tmp; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L356] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L358] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L402] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L361] COND TRUE ((int)r1) < 3 [L363] check__tmp = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L367] __return_1599 = check__tmp [L368] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L375] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L299] msg_t node1__m1; [L300] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L301] COND FALSE !(!(mode1 == 0)) [L536] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L537] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L539] COND TRUE p1_new == nomsg [L541] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L543] p1_new = node1____CPAchecker_TMP_0 [L544] mode1 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L319] msg_t node2__m2; [L320] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L321] COND FALSE !(!(mode2 == 0)) [L485] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L486] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L488] COND TRUE p2_new == nomsg [L490] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L492] p2_new = node2____CPAchecker_TMP_0 [L493] mode2 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L334] msg_t node3__m3; [L335] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L336] COND FALSE !(!(mode3 == 0)) [L440] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L441] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L443] COND TRUE p3_new == nomsg [L445] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L447] p3_new = node3____CPAchecker_TMP_0 [L448] mode3 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L348] p1_old = p1_new [L349] p1_new = nomsg [L350] p2_old = p2_new [L351] p2_new = nomsg [L352] p3_old = p3_new [L353] p3_new = nomsg [L355] int check__tmp; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L356] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L358] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L402] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L361] COND TRUE ((int)r1) < 3 [L363] check__tmp = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L367] __return_1599 = check__tmp [L368] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L375] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L299] msg_t node1__m1; [L300] node1__m1 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L301] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L303] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L307] r1 = r1 + 1 [L308] node1__m1 = p3_old [L309] p3_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L310] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L312] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L512] COND TRUE ((int)node1__m1) == ((int)id1) [L514] st1 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L316] mode1 = 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L319] msg_t node2__m2; [L320] node2__m2 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L321] COND TRUE !(mode2 == 0) [L323] node2__m2 = p1_old [L324] p1_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L325] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L327] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L467] COND TRUE ((int)node2__m2) == ((int)id2) [L469] st2 = 1 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L331] mode2 = 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L334] msg_t node3__m3; [L335] node3__m3 = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L336] COND TRUE !(mode3 == 0) [L338] node3__m3 = p2_old [L339] p2_old = nomsg VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L340] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L342] COND TRUE ((int)node3__m3) > ((int)id3) [L344] send3 = node3__m3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L346] mode3 = 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L348] p1_old = p1_new [L349] p1_new = nomsg [L350] p2_old = p2_new [L351] p2_new = nomsg [L352] p3_old = p3_new [L353] p3_new = nomsg [L355] int check__tmp; VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L356] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L415] check__tmp = 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=1, __return_1677=0, __return_1696=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] [L367] __return_1599 = check__tmp [L368] main__c1 = __return_1599 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L371] _Bool __tmp_3; [L372] __tmp_3 = main__c1 [L373] _Bool assert__arg; [L374] assert__arg = __tmp_3 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L375] COND TRUE assert__arg == 0 VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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] [L377] reach_error() VAL [__return_1394=1, __return_1467=1, __return_1532=1, __return_1599=0, __return_1677=0, __return_1696=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: 580]: 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, 104 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 855.3s, OverallIterations: 46, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 795.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76973 SdHoareTripleChecker+Valid, 84.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76973 mSDsluCounter, 114619 SdHoareTripleChecker+Invalid, 77.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105443 mSDsCounter, 1518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59358 IncrementalHoareTripleChecker+Invalid, 60876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1518 mSolverCounterUnsat, 9176 mSDtfsCounter, 59358 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9771 GetRequests, 5916 SyntacticMatches, 2 SemanticMatches, 3853 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 636178 ImplicationChecksByTransitivity, 719.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60226occurred in iteration=30, InterpolantAutomatonStates: 3355, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 45 MinimizatonAttempts, 386157 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 39.7s InterpolantComputationTime, 4333 NumberOfCodeBlocks, 4333 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 6555 ConstructedInterpolants, 1893 QuantifiedInterpolants, 82498 SizeOfPredicates, 288 NumberOfNonLiveVariables, 9297 ConjunctsInSsa, 493 ConjunctsInUnsatCore, 65 InterpolantComputations, 25 PerfectInterpolantSequences, 891/1966 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:10:35,695 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:10:35,801 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...