/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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:19:39,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:19:39,085 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:19:39,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:19:39,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:19:39,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:19:39,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:19:39,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:19:39,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:19:39,105 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:19:39,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:19:39,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:19:39,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:19:39,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:19:39,107 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:19:39,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:19:39,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:19:39,107 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:19:39,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:19:39,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:19:39,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:19:39,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:19:39,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:19:39,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:19:39,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:19:39,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:19:39,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:19:39,110 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:19:39,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:19:39,110 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:19:39,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:19:39,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:19:39,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:19:39,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:19:39,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:19:39,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:19:39,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:19:39,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:19:39,112 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:19:39,112 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:19:39,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:19:39,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:19:39,116 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:19:39,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:19:39,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:19:39,117 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:19:39,117 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:19:39,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:19:39,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:19:39,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:19:39,354 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:19:39,354 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:19:39,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2023-12-25 09:19:40,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:19:40,657 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:19:40,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2023-12-25 09:19:40,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5353f725/1d084a4f859649f7b6b6bcb5e5e10bcd/FLAG394c1ed3c [2023-12-25 09:19:40,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5353f725/1d084a4f859649f7b6b6bcb5e5e10bcd [2023-12-25 09:19:40,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:19:40,689 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:19:40,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:19:40,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:19:40,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:19:40,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:19:40" (1/1) ... [2023-12-25 09:19:40,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4ed63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:40, skipping insertion in model container [2023-12-25 09:19:40,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:19:40" (1/1) ... [2023-12-25 09:19:40,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:19:40,915 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2023-12-25 09:19:40,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:19:40,987 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:19:41,025 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2023-12-25 09:19:41,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:19:41,086 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:19:41,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41 WrapperNode [2023-12-25 09:19:41,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:19:41,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:19:41,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:19:41,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:19:41,108 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:19:41" (1/1) ... [2023-12-25 09:19:41,122 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:19:41" (1/1) ... [2023-12-25 09:19:41,147 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 652 [2023-12-25 09:19:41,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:19:41,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:19:41,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:19:41,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:19:41,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,178 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:19:41,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:19:41,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:19:41,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:19:41,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:19:41,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (1/1) ... [2023-12-25 09:19:41,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:19:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:19:41,272 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:19:41,316 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:19:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:19:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:19:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:19:41,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:19:41,424 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:19:41,426 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:19:41,845 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:19:41,875 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:19:41,875 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:19:41,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:19:41 BoogieIcfgContainer [2023-12-25 09:19:41,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:19:41,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:19:41,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:19:41,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:19:41,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:19:40" (1/3) ... [2023-12-25 09:19:41,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791b2c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:19:41, skipping insertion in model container [2023-12-25 09:19:41,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:19:41" (2/3) ... [2023-12-25 09:19:41,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791b2c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:19:41, skipping insertion in model container [2023-12-25 09:19:41,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:19:41" (3/3) ... [2023-12-25 09:19:41,882 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2023-12-25 09:19:41,895 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:19:41,895 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 09:19:41,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:19:41,944 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;@42eb09b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:19:41,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 09:19:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 158 states have (on average 1.7151898734177216) internal successors, (271), 159 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 09:19:41,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:41,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:19:41,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:41,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1160311881, now seen corresponding path program 1 times [2023-12-25 09:19:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:41,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51761507] [2023-12-25 09:19:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:41,968 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:19:41,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:41,980 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:19:42,014 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:19:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:42,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:42,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:42,296 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:19:42,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:42,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51761507] [2023-12-25 09:19:42,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51761507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:42,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416980330] [2023-12-25 09:19:42,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:42,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:42,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:42,329 INFO L87 Difference]: Start difference. First operand has 160 states, 158 states have (on average 1.7151898734177216) internal successors, (271), 159 states have internal predecessors, (271), 0 states have call successors, (0), 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.8) internal successors, (49), 5 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:19:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:42,481 INFO L93 Difference]: Finished difference Result 472 states and 780 transitions. [2023-12-25 09:19:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:19:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:42,491 INFO L225 Difference]: With dead ends: 472 [2023-12-25 09:19:42,492 INFO L226 Difference]: Without dead ends: 349 [2023-12-25 09:19:42,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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:19:42,496 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 572 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:42,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1032 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:19:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-12-25 09:19:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2023-12-25 09:19:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.4883720930232558) internal successors, (512), 344 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 512 transitions. [2023-12-25 09:19:42,534 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 512 transitions. Word has length 49 [2023-12-25 09:19:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:42,535 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 512 transitions. [2023-12-25 09:19:42,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:19:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 512 transitions. [2023-12-25 09:19:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:19:42,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:42,536 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:19:42,553 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:19:42,740 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:19:42,740 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:42,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:42,741 INFO L85 PathProgramCache]: Analyzing trace with hash 75421063, now seen corresponding path program 1 times [2023-12-25 09:19:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:42,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944766320] [2023-12-25 09:19:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:42,742 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:19:42,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:42,743 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:19:42,746 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:19:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:42,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:42,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:43,067 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:19:43,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:43,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944766320] [2023-12-25 09:19:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944766320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:19:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797291016] [2023-12-25 09:19:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:43,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:43,074 INFO L87 Difference]: Start difference. First operand 345 states and 512 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:43,330 INFO L93 Difference]: Finished difference Result 912 states and 1379 transitions. [2023-12-25 09:19:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:43,333 INFO L225 Difference]: With dead ends: 912 [2023-12-25 09:19:43,333 INFO L226 Difference]: Without dead ends: 594 [2023-12-25 09:19:43,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:19:43,335 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 916 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:43,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 216 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:19:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2023-12-25 09:19:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2023-12-25 09:19:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.49746192893401) internal successors, (885), 591 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 885 transitions. [2023-12-25 09:19:43,373 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 885 transitions. Word has length 50 [2023-12-25 09:19:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:43,373 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 885 transitions. [2023-12-25 09:19:43,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 885 transitions. [2023-12-25 09:19:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:19:43,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:43,375 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:19:43,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:43,577 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:19:43,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:43,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1763657750, now seen corresponding path program 1 times [2023-12-25 09:19:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:43,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079528321] [2023-12-25 09:19:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:43,579 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:19:43,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:43,580 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:19:43,604 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:19:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:43,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:43,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:43,853 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:19:43,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:43,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079528321] [2023-12-25 09:19:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079528321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:43,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:19:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129301905] [2023-12-25 09:19:43,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:43,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:43,865 INFO L87 Difference]: Start difference. First operand 592 states and 885 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:44,089 INFO L93 Difference]: Finished difference Result 1566 states and 2367 transitions. [2023-12-25 09:19:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:44,093 INFO L225 Difference]: With dead ends: 1566 [2023-12-25 09:19:44,093 INFO L226 Difference]: Without dead ends: 1017 [2023-12-25 09:19:44,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:19:44,095 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 893 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:44,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 229 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:19:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2023-12-25 09:19:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2023-12-25 09:19:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.5009861932938855) internal successors, (1522), 1014 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1522 transitions. [2023-12-25 09:19:44,126 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1522 transitions. Word has length 50 [2023-12-25 09:19:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:44,126 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1522 transitions. [2023-12-25 09:19:44,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1522 transitions. [2023-12-25 09:19:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 09:19:44,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:44,133 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:19:44,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 09:19:44,335 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:19:44,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:44,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1764578075, now seen corresponding path program 1 times [2023-12-25 09:19:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:44,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958857715] [2023-12-25 09:19:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:44,338 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:19:44,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:44,339 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:19:44,343 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:19:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:44,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:44,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:44,540 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:19:44,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:44,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958857715] [2023-12-25 09:19:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958857715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:19:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448101252] [2023-12-25 09:19:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:44,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:44,543 INFO L87 Difference]: Start difference. First operand 1015 states and 1522 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:44,766 INFO L93 Difference]: Finished difference Result 2714 states and 4109 transitions. [2023-12-25 09:19:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:44,772 INFO L225 Difference]: With dead ends: 2714 [2023-12-25 09:19:44,772 INFO L226 Difference]: Without dead ends: 1762 [2023-12-25 09:19:44,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:19:44,775 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 665 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:44,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 231 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:19:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2023-12-25 09:19:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2023-12-25 09:19:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1759 states have (on average 1.504832291074474) internal successors, (2647), 1759 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2647 transitions. [2023-12-25 09:19:44,831 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2647 transitions. Word has length 50 [2023-12-25 09:19:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:44,832 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2647 transitions. [2023-12-25 09:19:44,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 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:19:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2647 transitions. [2023-12-25 09:19:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 09:19:44,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:44,833 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:19:44,853 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:19:45,036 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:19:45,036 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:45,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1136576117, now seen corresponding path program 1 times [2023-12-25 09:19:45,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:45,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197324356] [2023-12-25 09:19:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:45,037 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:19:45,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:45,038 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:19:45,060 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:19:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:45,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:19:45,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:45,498 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:19:45,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:45,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:45,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197324356] [2023-12-25 09:19:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197324356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:19:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039093440] [2023-12-25 09:19:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:45,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:19:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:19:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:19:45,500 INFO L87 Difference]: Start difference. First operand 1760 states and 2647 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:19:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:46,766 INFO L93 Difference]: Finished difference Result 4083 states and 6174 transitions. [2023-12-25 09:19:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 09:19:46,766 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:19:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:46,774 INFO L225 Difference]: With dead ends: 4083 [2023-12-25 09:19:46,774 INFO L226 Difference]: Without dead ends: 2619 [2023-12-25 09:19:46,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 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:19:46,777 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 1322 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:46,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 988 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 09:19:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2023-12-25 09:19:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 1725. [2023-12-25 09:19:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1724 states have (on average 1.4976798143851509) internal successors, (2582), 1724 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2582 transitions. [2023-12-25 09:19:46,807 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2582 transitions. Word has length 51 [2023-12-25 09:19:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:46,807 INFO L495 AbstractCegarLoop]: Abstraction has 1725 states and 2582 transitions. [2023-12-25 09:19:46,807 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:19:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2582 transitions. [2023-12-25 09:19:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 09:19:46,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:46,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] [2023-12-25 09:19:46,834 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:19:47,011 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:19:47,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:47,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:47,012 INFO L85 PathProgramCache]: Analyzing trace with hash -722823829, now seen corresponding path program 1 times [2023-12-25 09:19:47,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:47,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601380350] [2023-12-25 09:19:47,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:47,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:19:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:47,013 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:19:47,042 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:19:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:47,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:19:47,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:47,434 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:19:47,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:47,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601380350] [2023-12-25 09:19:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601380350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:47,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:47,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:19:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997129627] [2023-12-25 09:19:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:47,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:19:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:19:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:19:47,437 INFO L87 Difference]: Start difference. First operand 1725 states and 2582 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:19:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:48,608 INFO L93 Difference]: Finished difference Result 3413 states and 5127 transitions. [2023-12-25 09:19:48,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 09:19:48,608 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:19:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:48,615 INFO L225 Difference]: With dead ends: 3413 [2023-12-25 09:19:48,615 INFO L226 Difference]: Without dead ends: 2613 [2023-12-25 09:19:48,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 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:19:48,617 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1544 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:48,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 1061 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:19:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2023-12-25 09:19:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 1795. [2023-12-25 09:19:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.4899665551839465) internal successors, (2673), 1794 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2673 transitions. [2023-12-25 09:19:48,647 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2673 transitions. Word has length 51 [2023-12-25 09:19:48,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:48,647 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2673 transitions. [2023-12-25 09:19:48,647 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:19:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2673 transitions. [2023-12-25 09:19:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 09:19:48,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:48,648 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:19:48,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:48,851 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:19:48,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:48,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -620283573, now seen corresponding path program 1 times [2023-12-25 09:19:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130042712] [2023-12-25 09:19:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:48,852 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:19:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:48,853 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:19:48,857 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:19:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:48,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:19:48,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:49,188 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:19:49,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:49,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130042712] [2023-12-25 09:19:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130042712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:19:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780863104] [2023-12-25 09:19:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:49,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:19:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:19:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:19:49,189 INFO L87 Difference]: Start difference. First operand 1795 states and 2673 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:19:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:50,222 INFO L93 Difference]: Finished difference Result 2454 states and 3648 transitions. [2023-12-25 09:19:50,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:19:50,222 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:19:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:50,229 INFO L225 Difference]: With dead ends: 2454 [2023-12-25 09:19:50,229 INFO L226 Difference]: Without dead ends: 2138 [2023-12-25 09:19:50,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:19:50,231 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 886 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:50,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 953 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 09:19:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2023-12-25 09:19:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1795. [2023-12-25 09:19:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1794 states have (on average 1.4877369007803791) internal successors, (2669), 1794 states have internal predecessors, (2669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2669 transitions. [2023-12-25 09:19:50,258 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2669 transitions. Word has length 51 [2023-12-25 09:19:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:50,258 INFO L495 AbstractCegarLoop]: Abstraction has 1795 states and 2669 transitions. [2023-12-25 09:19:50,258 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:19:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2669 transitions. [2023-12-25 09:19:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 09:19:50,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:50,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:19:50,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:50,462 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:19:50,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:50,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -853794378, now seen corresponding path program 1 times [2023-12-25 09:19:50,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:50,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087406839] [2023-12-25 09:19:50,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:50,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:50,465 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:19:50,466 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:19:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:50,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:50,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:50,743 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:19:50,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:50,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:50,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087406839] [2023-12-25 09:19:50,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087406839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:50,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787143583] [2023-12-25 09:19:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:50,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:50,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:50,745 INFO L87 Difference]: Start difference. First operand 1795 states and 2669 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:19:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:50,843 INFO L93 Difference]: Finished difference Result 6053 states and 9136 transitions. [2023-12-25 09:19:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:50,843 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:19:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:50,855 INFO L225 Difference]: With dead ends: 6053 [2023-12-25 09:19:50,855 INFO L226 Difference]: Without dead ends: 4827 [2023-12-25 09:19:50,857 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:19:50,858 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 439 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:50,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 840 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:19:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2023-12-25 09:19:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 3339. [2023-12-25 09:19:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3339 states, 3338 states have (on average 1.482025164769323) internal successors, (4947), 3338 states have internal predecessors, (4947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 4947 transitions. [2023-12-25 09:19:50,948 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 4947 transitions. Word has length 52 [2023-12-25 09:19:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:50,949 INFO L495 AbstractCegarLoop]: Abstraction has 3339 states and 4947 transitions. [2023-12-25 09:19:50,949 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:19:50,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4947 transitions. [2023-12-25 09:19:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:19:50,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:50,950 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:19:50,956 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:19:51,153 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:19:51,154 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:51,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash -564648281, now seen corresponding path program 1 times [2023-12-25 09:19:51,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:51,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952273601] [2023-12-25 09:19:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:51,155 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:19:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:51,160 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:19:51,198 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:19:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:51,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:51,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:51,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:51,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:51,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952273601] [2023-12-25 09:19:51,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952273601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:51,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589141968] [2023-12-25 09:19:51,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:51,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:51,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:51,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:51,264 INFO L87 Difference]: Start difference. First operand 3339 states and 4947 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:51,292 INFO L93 Difference]: Finished difference Result 5997 states and 8942 transitions. [2023-12-25 09:19:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:51,302 INFO L225 Difference]: With dead ends: 5997 [2023-12-25 09:19:51,303 INFO L226 Difference]: Without dead ends: 3939 [2023-12-25 09:19:51,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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:19:51,309 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 154 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:51,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 469 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2023-12-25 09:19:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3885. [2023-12-25 09:19:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3885 states, 3884 states have (on average 1.4631822863027806) internal successors, (5683), 3884 states have internal predecessors, (5683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5683 transitions. [2023-12-25 09:19:51,366 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5683 transitions. Word has length 54 [2023-12-25 09:19:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:51,366 INFO L495 AbstractCegarLoop]: Abstraction has 3885 states and 5683 transitions. [2023-12-25 09:19:51,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5683 transitions. [2023-12-25 09:19:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:19:51,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:51,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:19:51,383 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:19:51,570 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:19:51,571 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:51,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:51,571 INFO L85 PathProgramCache]: Analyzing trace with hash -603564216, now seen corresponding path program 1 times [2023-12-25 09:19:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973045172] [2023-12-25 09:19:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:51,572 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:19:51,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:51,573 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:19:51,596 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:19:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:51,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:51,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:51,653 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:19:51,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:51,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973045172] [2023-12-25 09:19:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973045172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011124553] [2023-12-25 09:19:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:51,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:51,654 INFO L87 Difference]: Start difference. First operand 3885 states and 5683 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:51,678 INFO L93 Difference]: Finished difference Result 5442 states and 7940 transitions. [2023-12-25 09:19:51,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:51,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:51,687 INFO L225 Difference]: With dead ends: 5442 [2023-12-25 09:19:51,687 INFO L226 Difference]: Without dead ends: 3974 [2023-12-25 09:19:51,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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:19:51,690 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 142 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:51,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 457 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:51,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2023-12-25 09:19:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3620. [2023-12-25 09:19:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3619 states have (on average 1.4332688588007736) internal successors, (5187), 3619 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 5187 transitions. [2023-12-25 09:19:51,746 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 5187 transitions. Word has length 54 [2023-12-25 09:19:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:51,746 INFO L495 AbstractCegarLoop]: Abstraction has 3620 states and 5187 transitions. [2023-12-25 09:19:51,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5187 transitions. [2023-12-25 09:19:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 09:19:51,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:51,747 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:19:51,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 09:19:51,950 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:19:51,951 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:51,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2097288, now seen corresponding path program 1 times [2023-12-25 09:19:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:51,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374071366] [2023-12-25 09:19:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:51,952 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:19:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:51,953 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:19:51,978 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:19:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:52,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:52,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:52,049 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:19:52,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:52,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374071366] [2023-12-25 09:19:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374071366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:52,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:52,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473909326] [2023-12-25 09:19:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:52,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:52,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:52,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:52,050 INFO L87 Difference]: Start difference. First operand 3620 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:52,084 INFO L93 Difference]: Finished difference Result 7164 states and 10279 transitions. [2023-12-25 09:19:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:52,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:52,111 INFO L225 Difference]: With dead ends: 7164 [2023-12-25 09:19:52,112 INFO L226 Difference]: Without dead ends: 4630 [2023-12-25 09:19:52,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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:19:52,122 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 144 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:52,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 489 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2023-12-25 09:19:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4604. [2023-12-25 09:19:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 4603 states have (on average 1.4016945470345428) internal successors, (6452), 4603 states have internal predecessors, (6452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 6452 transitions. [2023-12-25 09:19:52,249 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 6452 transitions. Word has length 54 [2023-12-25 09:19:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:52,249 INFO L495 AbstractCegarLoop]: Abstraction has 4604 states and 6452 transitions. [2023-12-25 09:19:52,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:19:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 6452 transitions. [2023-12-25 09:19:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 09:19:52,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:52,251 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:19:52,267 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:19:52,454 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:19:52,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:52,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1126819175, now seen corresponding path program 1 times [2023-12-25 09:19:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876181283] [2023-12-25 09:19:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:52,455 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:19:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:52,482 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:19:52,507 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:19:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:52,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:19:52,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:52,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:19:52,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:52,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876181283] [2023-12-25 09:19:52,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876181283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:52,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:52,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711175198] [2023-12-25 09:19:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:52,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:19:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:19:52,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:19:52,642 INFO L87 Difference]: Start difference. First operand 4604 states and 6452 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:52,871 INFO L93 Difference]: Finished difference Result 16487 states and 23076 transitions. [2023-12-25 09:19:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:19:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:52,890 INFO L225 Difference]: With dead ends: 16487 [2023-12-25 09:19:52,890 INFO L226 Difference]: Without dead ends: 12459 [2023-12-25 09:19:52,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:19:52,901 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 965 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:52,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 404 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:19:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12459 states. [2023-12-25 09:19:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12459 to 4577. [2023-12-25 09:19:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.3883304195804196) internal successors, (6353), 4576 states have internal predecessors, (6353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6353 transitions. [2023-12-25 09:19:52,999 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6353 transitions. Word has length 55 [2023-12-25 09:19:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:52,999 INFO L495 AbstractCegarLoop]: Abstraction has 4577 states and 6353 transitions. [2023-12-25 09:19:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6353 transitions. [2023-12-25 09:19:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 09:19:53,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:53,002 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:19:53,005 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 (13)] Ended with exit code 0 [2023-12-25 09:19:53,205 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:19:53,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:53,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -576046312, now seen corresponding path program 1 times [2023-12-25 09:19:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9546047] [2023-12-25 09:19:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:53,206 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:19:53,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:53,208 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:19:53,229 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:19:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:53,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:19:53,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:53,371 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:19:53,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:53,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9546047] [2023-12-25 09:19:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9546047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:53,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:53,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:53,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228929994] [2023-12-25 09:19:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:53,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:19:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:53,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:19:53,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:19:53,403 INFO L87 Difference]: Start difference. First operand 4577 states and 6353 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:53,691 INFO L93 Difference]: Finished difference Result 18673 states and 25624 transitions. [2023-12-25 09:19:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:19:53,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:53,714 INFO L225 Difference]: With dead ends: 18673 [2023-12-25 09:19:53,714 INFO L226 Difference]: Without dead ends: 14776 [2023-12-25 09:19:53,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:19:53,721 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 1001 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:53,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 524 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:19:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14776 states. [2023-12-25 09:19:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14776 to 4582. [2023-12-25 09:19:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 4581 states have (on average 1.3612748308229645) internal successors, (6236), 4581 states have internal predecessors, (6236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 6236 transitions. [2023-12-25 09:19:53,827 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 6236 transitions. Word has length 55 [2023-12-25 09:19:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:53,828 INFO L495 AbstractCegarLoop]: Abstraction has 4582 states and 6236 transitions. [2023-12-25 09:19:53,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 6236 transitions. [2023-12-25 09:19:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 09:19:53,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:53,829 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:19:53,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:54,031 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:19:54,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:54,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1318541163, now seen corresponding path program 1 times [2023-12-25 09:19:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681767566] [2023-12-25 09:19:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:54,033 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:19:54,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:54,050 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:19:54,057 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:19:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:54,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:19:54,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:54,268 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:19:54,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:54,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681767566] [2023-12-25 09:19:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681767566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:54,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200545005] [2023-12-25 09:19:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:19:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:19:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:19:54,270 INFO L87 Difference]: Start difference. First operand 4582 states and 6236 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:54,524 INFO L93 Difference]: Finished difference Result 17732 states and 24056 transitions. [2023-12-25 09:19:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:19:54,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:54,566 INFO L225 Difference]: With dead ends: 17732 [2023-12-25 09:19:54,566 INFO L226 Difference]: Without dead ends: 13936 [2023-12-25 09:19:54,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:19:54,571 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1327 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:54,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 471 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:19:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13936 states. [2023-12-25 09:19:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13936 to 4657. [2023-12-25 09:19:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4657 states, 4656 states have (on average 1.3421391752577319) internal successors, (6249), 4656 states have internal predecessors, (6249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 6249 transitions. [2023-12-25 09:19:54,653 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 6249 transitions. Word has length 55 [2023-12-25 09:19:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:54,653 INFO L495 AbstractCegarLoop]: Abstraction has 4657 states and 6249 transitions. [2023-12-25 09:19:54,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 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:19:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 6249 transitions. [2023-12-25 09:19:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 09:19:54,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:54,654 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] [2023-12-25 09:19:54,669 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:19:54,857 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:19:54,857 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:54,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash -290997780, now seen corresponding path program 1 times [2023-12-25 09:19:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:54,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403425506] [2023-12-25 09:19:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:54,858 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:19:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:54,859 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:19:54,885 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:19:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:54,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:54,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:55,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:19:55,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:55,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403425506] [2023-12-25 09:19:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403425506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:55,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:55,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119397653] [2023-12-25 09:19:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:55,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:55,093 INFO L87 Difference]: Start difference. First operand 4657 states and 6249 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:55,166 INFO L93 Difference]: Finished difference Result 7605 states and 10360 transitions. [2023-12-25 09:19:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:55,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2023-12-25 09:19:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:55,190 INFO L225 Difference]: With dead ends: 7605 [2023-12-25 09:19:55,190 INFO L226 Difference]: Without dead ends: 6466 [2023-12-25 09:19:55,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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:19:55,195 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 512 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 890 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:19:55,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 890 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:19:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6466 states. [2023-12-25 09:19:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6466 to 5889. [2023-12-25 09:19:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5889 states, 5888 states have (on average 1.342561141304348) internal successors, (7905), 5888 states have internal predecessors, (7905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5889 states to 5889 states and 7905 transitions. [2023-12-25 09:19:55,255 INFO L78 Accepts]: Start accepts. Automaton has 5889 states and 7905 transitions. Word has length 57 [2023-12-25 09:19:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:55,256 INFO L495 AbstractCegarLoop]: Abstraction has 5889 states and 7905 transitions. [2023-12-25 09:19:55,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 5889 states and 7905 transitions. [2023-12-25 09:19:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 09:19:55,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:55,257 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] [2023-12-25 09:19:55,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 09:19:55,460 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:19:55,460 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:55,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash 370391341, now seen corresponding path program 1 times [2023-12-25 09:19:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864923276] [2023-12-25 09:19:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:55,461 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:19:55,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:55,462 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:19:55,480 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:19:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:55,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:55,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:55,707 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:19:55,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:55,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:55,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864923276] [2023-12-25 09:19:55,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864923276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:55,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:55,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:55,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819697843] [2023-12-25 09:19:55,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:55,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:55,709 INFO L87 Difference]: Start difference. First operand 5889 states and 7905 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:55,790 INFO L93 Difference]: Finished difference Result 9449 states and 12872 transitions. [2023-12-25 09:19:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:55,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2023-12-25 09:19:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:55,800 INFO L225 Difference]: With dead ends: 9449 [2023-12-25 09:19:55,801 INFO L226 Difference]: Without dead ends: 7698 [2023-12-25 09:19:55,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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:19:55,805 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 523 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:55,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 828 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:19:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7698 states. [2023-12-25 09:19:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7698 to 6813. [2023-12-25 09:19:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6813 states, 6812 states have (on average 1.3402818555490312) internal successors, (9130), 6812 states have internal predecessors, (9130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6813 states to 6813 states and 9130 transitions. [2023-12-25 09:19:55,887 INFO L78 Accepts]: Start accepts. Automaton has 6813 states and 9130 transitions. Word has length 57 [2023-12-25 09:19:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:55,887 INFO L495 AbstractCegarLoop]: Abstraction has 6813 states and 9130 transitions. [2023-12-25 09:19:55,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 6813 states and 9130 transitions. [2023-12-25 09:19:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 09:19:55,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:55,888 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] [2023-12-25 09:19:55,904 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:19:56,091 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:19:56,091 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:56,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash 416488265, now seen corresponding path program 1 times [2023-12-25 09:19:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:56,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850393356] [2023-12-25 09:19:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:56,092 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:19:56,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:56,093 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:19:56,095 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:19:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:56,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:19:56,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:19:56,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:56,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:56,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850393356] [2023-12-25 09:19:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850393356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:56,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:19:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29323590] [2023-12-25 09:19:56,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:56,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:19:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:19:56,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:19:56,321 INFO L87 Difference]: Start difference. First operand 6813 states and 9130 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:56,383 INFO L93 Difference]: Finished difference Result 8788 states and 11850 transitions. [2023-12-25 09:19:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:19:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2023-12-25 09:19:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:56,390 INFO L225 Difference]: With dead ends: 8788 [2023-12-25 09:19:56,390 INFO L226 Difference]: Without dead ends: 8269 [2023-12-25 09:19:56,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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:19:56,393 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 512 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:56,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 802 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8269 states. [2023-12-25 09:19:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8269 to 7415. [2023-12-25 09:19:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7415 states, 7414 states have (on average 1.3404370110601564) internal successors, (9938), 7414 states have internal predecessors, (9938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7415 states to 7415 states and 9938 transitions. [2023-12-25 09:19:56,538 INFO L78 Accepts]: Start accepts. Automaton has 7415 states and 9938 transitions. Word has length 57 [2023-12-25 09:19:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:56,539 INFO L495 AbstractCegarLoop]: Abstraction has 7415 states and 9938 transitions. [2023-12-25 09:19:56,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7415 states and 9938 transitions. [2023-12-25 09:19:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:19:56,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:56,542 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] [2023-12-25 09:19:56,546 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:19:56,744 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:19:56,744 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:56,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash 574436983, now seen corresponding path program 1 times [2023-12-25 09:19:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117885120] [2023-12-25 09:19:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:56,745 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:19:56,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:56,750 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:19:56,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 (19)] Waiting until timeout for monitored process [2023-12-25 09:19:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:56,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:56,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:56,870 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:19:56,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:56,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117885120] [2023-12-25 09:19:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117885120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:56,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595597011] [2023-12-25 09:19:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:56,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:56,888 INFO L87 Difference]: Start difference. First operand 7415 states and 9938 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:56,921 INFO L93 Difference]: Finished difference Result 9243 states and 12347 transitions. [2023-12-25 09:19:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2023-12-25 09:19:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:56,927 INFO L225 Difference]: With dead ends: 9243 [2023-12-25 09:19:56,927 INFO L226 Difference]: Without dead ends: 6169 [2023-12-25 09:19:56,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:19:56,931 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 142 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:56,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 429 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2023-12-25 09:19:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6167. [2023-12-25 09:19:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6167 states, 6166 states have (on average 1.309114498864742) internal successors, (8072), 6166 states have internal predecessors, (8072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 8072 transitions. [2023-12-25 09:19:57,001 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 8072 transitions. Word has length 62 [2023-12-25 09:19:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:57,001 INFO L495 AbstractCegarLoop]: Abstraction has 6167 states and 8072 transitions. [2023-12-25 09:19:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 8072 transitions. [2023-12-25 09:19:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:19:57,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:57,003 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] [2023-12-25 09:19:57,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-25 09:19:57,205 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:19:57,205 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:57,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1863112174, now seen corresponding path program 1 times [2023-12-25 09:19:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:57,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078564262] [2023-12-25 09:19:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:57,206 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:19:57,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:57,207 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:19:57,215 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:19:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:57,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:57,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:57,302 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:19:57,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:57,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078564262] [2023-12-25 09:19:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078564262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:57,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:57,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744147786] [2023-12-25 09:19:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:57,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:57,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:57,305 INFO L87 Difference]: Start difference. First operand 6167 states and 8072 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:57,329 INFO L93 Difference]: Finished difference Result 7361 states and 9643 transitions. [2023-12-25 09:19:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:57,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2023-12-25 09:19:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:57,333 INFO L225 Difference]: With dead ends: 7361 [2023-12-25 09:19:57,333 INFO L226 Difference]: Without dead ends: 4807 [2023-12-25 09:19:57,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:19:57,336 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 139 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:19:57,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 486 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2023-12-25 09:19:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4805. [2023-12-25 09:19:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 4804 states have (on average 1.2935054121565361) internal successors, (6214), 4804 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6214 transitions. [2023-12-25 09:19:57,375 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6214 transitions. Word has length 62 [2023-12-25 09:19:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:57,375 INFO L495 AbstractCegarLoop]: Abstraction has 4805 states and 6214 transitions. [2023-12-25 09:19:57,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6214 transitions. [2023-12-25 09:19:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:19:57,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:57,377 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] [2023-12-25 09:19:57,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-25 09:19:57,579 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:19:57,580 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:57,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1653707668, now seen corresponding path program 1 times [2023-12-25 09:19:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853266221] [2023-12-25 09:19:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:57,581 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:19:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:57,582 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:19:57,604 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:19:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:57,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:19:57,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:57,669 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:19:57,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:57,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:57,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853266221] [2023-12-25 09:19:57,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853266221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:57,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:57,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:19:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995069153] [2023-12-25 09:19:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:57,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:19:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:19:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:19:57,670 INFO L87 Difference]: Start difference. First operand 4805 states and 6214 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:19:57,721 INFO L93 Difference]: Finished difference Result 8706 states and 11346 transitions. [2023-12-25 09:19:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:19:57,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-12-25 09:19:57,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:19:57,727 INFO L225 Difference]: With dead ends: 8706 [2023-12-25 09:19:57,727 INFO L226 Difference]: Without dead ends: 6530 [2023-12-25 09:19:57,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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:19:57,730 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 164 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 331 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:19:57,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 331 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:19:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2023-12-25 09:19:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 4449. [2023-12-25 09:19:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 4448 states have (on average 1.2967625899280575) internal successors, (5768), 4448 states have internal predecessors, (5768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 5768 transitions. [2023-12-25 09:19:57,772 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 5768 transitions. Word has length 63 [2023-12-25 09:19:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:19:57,772 INFO L495 AbstractCegarLoop]: Abstraction has 4449 states and 5768 transitions. [2023-12-25 09:19:57,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:19:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 5768 transitions. [2023-12-25 09:19:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:19:57,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:19:57,774 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] [2023-12-25 09:19:57,784 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:19:57,976 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:19:57,977 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:19:57,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:19:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1460142013, now seen corresponding path program 1 times [2023-12-25 09:19:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:19:57,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831029350] [2023-12-25 09:19:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:19:57,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:19:57,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:19:57,979 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:19:58,007 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:19:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:19:58,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:19:58,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:19:59,405 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:19:59,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:19:59,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:19:59,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831029350] [2023-12-25 09:19:59,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831029350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:19:59,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:19:59,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-25 09:19:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848448668] [2023-12-25 09:19:59,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:19:59,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 09:19:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:19:59,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 09:19:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2023-12-25 09:19:59,406 INFO L87 Difference]: Start difference. First operand 4449 states and 5768 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:02,564 INFO L93 Difference]: Finished difference Result 9274 states and 12117 transitions. [2023-12-25 09:20:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 09:20:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2023-12-25 09:20:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:02,569 INFO L225 Difference]: With dead ends: 9274 [2023-12-25 09:20:02,569 INFO L226 Difference]: Without dead ends: 6024 [2023-12-25 09:20:02,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:20:02,573 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 927 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 4326 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:02,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 4326 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-25 09:20:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2023-12-25 09:20:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 4442. [2023-12-25 09:20:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4442 states, 4441 states have (on average 1.3060121594235532) internal successors, (5800), 4441 states have internal predecessors, (5800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 5800 transitions. [2023-12-25 09:20:02,615 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 5800 transitions. Word has length 63 [2023-12-25 09:20:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:02,615 INFO L495 AbstractCegarLoop]: Abstraction has 4442 states and 5800 transitions. [2023-12-25 09:20:02,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 5800 transitions. [2023-12-25 09:20:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:02,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:02,617 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] [2023-12-25 09:20:02,622 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:20:02,820 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:20:02,820 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:02,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash -758903169, now seen corresponding path program 1 times [2023-12-25 09:20:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:02,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971464488] [2023-12-25 09:20:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:02,821 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:20:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:02,822 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:20:02,844 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:20:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:02,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:20:02,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:04,393 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:20:04,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:04,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971464488] [2023-12-25 09:20:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971464488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:04,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-12-25 09:20:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546013857] [2023-12-25 09:20:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 09:20:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 09:20:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-25 09:20:04,395 INFO L87 Difference]: Start difference. First operand 4442 states and 5800 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:07,503 INFO L93 Difference]: Finished difference Result 6188 states and 8080 transitions. [2023-12-25 09:20:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 09:20:07,505 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2023-12-25 09:20:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:07,511 INFO L225 Difference]: With dead ends: 6188 [2023-12-25 09:20:07,511 INFO L226 Difference]: Without dead ends: 5962 [2023-12-25 09:20:07,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 09:20:07,513 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 855 mSDsluCounter, 3875 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:07,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 4243 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:20:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2023-12-25 09:20:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 4400. [2023-12-25 09:20:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 4399 states have (on average 1.3057513071152536) internal successors, (5744), 4399 states have internal predecessors, (5744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 5744 transitions. [2023-12-25 09:20:07,553 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 5744 transitions. Word has length 64 [2023-12-25 09:20:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:07,553 INFO L495 AbstractCegarLoop]: Abstraction has 4400 states and 5744 transitions. [2023-12-25 09:20:07,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 5744 transitions. [2023-12-25 09:20:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 09:20:07,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:07,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:07,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:07,758 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:20:07,759 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:07,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash -701031860, now seen corresponding path program 1 times [2023-12-25 09:20:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:07,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667569153] [2023-12-25 09:20:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:07,760 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:20:07,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:07,762 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:20:07,766 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:20:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:07,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:07,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:07,839 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:20:07,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:07,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:07,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667569153] [2023-12-25 09:20:07,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667569153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:07,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:07,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:07,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561103133] [2023-12-25 09:20:07,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:07,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:07,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:07,847 INFO L87 Difference]: Start difference. First operand 4400 states and 5744 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:07,906 INFO L93 Difference]: Finished difference Result 11339 states and 14932 transitions. [2023-12-25 09:20:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:07,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-12-25 09:20:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:07,928 INFO L225 Difference]: With dead ends: 11339 [2023-12-25 09:20:07,928 INFO L226 Difference]: Without dead ends: 7318 [2023-12-25 09:20:07,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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:20:07,933 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 126 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:07,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 355 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7318 states. [2023-12-25 09:20:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7318 to 7316. [2023-12-25 09:20:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7316 states, 7315 states have (on average 1.2987012987012987) internal successors, (9500), 7315 states have internal predecessors, (9500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7316 states to 7316 states and 9500 transitions. [2023-12-25 09:20:08,010 INFO L78 Accepts]: Start accepts. Automaton has 7316 states and 9500 transitions. Word has length 71 [2023-12-25 09:20:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:08,010 INFO L495 AbstractCegarLoop]: Abstraction has 7316 states and 9500 transitions. [2023-12-25 09:20:08,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7316 states and 9500 transitions. [2023-12-25 09:20:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-25 09:20:08,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:08,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:08,014 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:20:08,214 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:20:08,215 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:08,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1394163845, now seen corresponding path program 1 times [2023-12-25 09:20:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:08,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556105357] [2023-12-25 09:20:08,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:08,215 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:20:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:08,217 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:20:08,218 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:20:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:08,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:08,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:08,294 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:20:08,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:08,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:08,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556105357] [2023-12-25 09:20:08,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556105357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:08,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:08,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:08,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940506937] [2023-12-25 09:20:08,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:08,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:08,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:08,295 INFO L87 Difference]: Start difference. First operand 7316 states and 9500 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:08,335 INFO L93 Difference]: Finished difference Result 19422 states and 25418 transitions. [2023-12-25 09:20:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2023-12-25 09:20:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:08,347 INFO L225 Difference]: With dead ends: 19422 [2023-12-25 09:20:08,347 INFO L226 Difference]: Without dead ends: 12499 [2023-12-25 09:20:08,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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:20:08,356 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 120 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 364 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:20:08,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 364 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12499 states. [2023-12-25 09:20:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12499 to 12497. [2023-12-25 09:20:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12497 states, 12496 states have (on average 1.2924135723431498) internal successors, (16150), 12496 states have internal predecessors, (16150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12497 states to 12497 states and 16150 transitions. [2023-12-25 09:20:08,515 INFO L78 Accepts]: Start accepts. Automaton has 12497 states and 16150 transitions. Word has length 72 [2023-12-25 09:20:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:08,516 INFO L495 AbstractCegarLoop]: Abstraction has 12497 states and 16150 transitions. [2023-12-25 09:20:08,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12497 states and 16150 transitions. [2023-12-25 09:20:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-25 09:20:08,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:08,517 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] [2023-12-25 09:20:08,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-25 09:20:08,719 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:20:08,719 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:08,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1262986629, now seen corresponding path program 1 times [2023-12-25 09:20:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779403803] [2023-12-25 09:20:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:08,721 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:20:08,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:08,722 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:20:08,724 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:20:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:08,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:08,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:08,823 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:20:08,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:08,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779403803] [2023-12-25 09:20:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779403803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574325939] [2023-12-25 09:20:08,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:08,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:08,824 INFO L87 Difference]: Start difference. First operand 12497 states and 16150 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:08,898 INFO L93 Difference]: Finished difference Result 33425 states and 43392 transitions. [2023-12-25 09:20:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:08,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2023-12-25 09:20:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:08,919 INFO L225 Difference]: With dead ends: 33425 [2023-12-25 09:20:08,920 INFO L226 Difference]: Without dead ends: 21321 [2023-12-25 09:20:08,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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:20:08,935 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 113 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 354 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:20:08,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 354 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21321 states. [2023-12-25 09:20:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21321 to 21319. [2023-12-25 09:20:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21319 states, 21318 states have (on average 1.279951214935735) internal successors, (27286), 21318 states have internal predecessors, (27286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21319 states to 21319 states and 27286 transitions. [2023-12-25 09:20:09,135 INFO L78 Accepts]: Start accepts. Automaton has 21319 states and 27286 transitions. Word has length 73 [2023-12-25 09:20:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:09,135 INFO L495 AbstractCegarLoop]: Abstraction has 21319 states and 27286 transitions. [2023-12-25 09:20:09,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 21319 states and 27286 transitions. [2023-12-25 09:20:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-25 09:20:09,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:09,136 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:20:09,152 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:20:09,339 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:20:09,339 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:09,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash -127158118, now seen corresponding path program 1 times [2023-12-25 09:20:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66866683] [2023-12-25 09:20:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:09,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:09,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:09,341 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:20:09,342 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:20:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:09,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:20:09,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:09,438 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:20:09,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:09,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66866683] [2023-12-25 09:20:09,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66866683] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:09,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:09,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:09,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028191075] [2023-12-25 09:20:09,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:09,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:09,440 INFO L87 Difference]: Start difference. First operand 21319 states and 27286 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:09,609 INFO L93 Difference]: Finished difference Result 36230 states and 45816 transitions. [2023-12-25 09:20:09,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 09:20:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-12-25 09:20:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:09,729 INFO L225 Difference]: With dead ends: 36230 [2023-12-25 09:20:09,729 INFO L226 Difference]: Without dead ends: 30624 [2023-12-25 09:20:09,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 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:20:09,736 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 309 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:09,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 722 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30624 states. [2023-12-25 09:20:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30624 to 17999. [2023-12-25 09:20:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17999 states, 17998 states have (on average 1.2484720524502722) internal successors, (22470), 17998 states have internal predecessors, (22470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17999 states to 17999 states and 22470 transitions. [2023-12-25 09:20:09,935 INFO L78 Accepts]: Start accepts. Automaton has 17999 states and 22470 transitions. Word has length 76 [2023-12-25 09:20:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:09,935 INFO L495 AbstractCegarLoop]: Abstraction has 17999 states and 22470 transitions. [2023-12-25 09:20:09,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17999 states and 22470 transitions. [2023-12-25 09:20:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 09:20:09,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:09,936 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:20:09,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:10,139 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:20:10,141 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:10,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1368110880, now seen corresponding path program 1 times [2023-12-25 09:20:10,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:10,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908032822] [2023-12-25 09:20:10,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:10,142 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:20:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:10,143 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:20:10,144 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:20:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:10,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:20:10,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:10,338 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:20:10,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:10,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908032822] [2023-12-25 09:20:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908032822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:20:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072850988] [2023-12-25 09:20:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:10,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:20:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:20:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:20:10,340 INFO L87 Difference]: Start difference. First operand 17999 states and 22470 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:20:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:10,491 INFO L93 Difference]: Finished difference Result 40285 states and 50274 transitions. [2023-12-25 09:20:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 09:20:10,492 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:20:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:10,515 INFO L225 Difference]: With dead ends: 40285 [2023-12-25 09:20:10,515 INFO L226 Difference]: Without dead ends: 22679 [2023-12-25 09:20:10,529 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:20:10,529 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 105 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:10,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 499 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22679 states. [2023-12-25 09:20:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22679 to 22677. [2023-12-25 09:20:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22677 states, 22676 states have (on average 1.237255247839125) internal successors, (28056), 22676 states have internal predecessors, (28056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22677 states to 22677 states and 28056 transitions. [2023-12-25 09:20:10,851 INFO L78 Accepts]: Start accepts. Automaton has 22677 states and 28056 transitions. Word has length 77 [2023-12-25 09:20:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:10,851 INFO L495 AbstractCegarLoop]: Abstraction has 22677 states and 28056 transitions. [2023-12-25 09:20:10,851 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:20:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 22677 states and 28056 transitions. [2023-12-25 09:20:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 09:20:10,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:10,855 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] [2023-12-25 09:20:10,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:11,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:11,059 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:11,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash 989291744, now seen corresponding path program 1 times [2023-12-25 09:20:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:11,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768020479] [2023-12-25 09:20:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:11,060 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:20:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:11,061 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:11,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 09:20:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:11,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:20:11,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:11,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:11,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768020479] [2023-12-25 09:20:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768020479] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:11,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:11,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:20:11,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350252498] [2023-12-25 09:20:11,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:11,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:20:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:11,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:20:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:20:11,930 INFO L87 Difference]: Start difference. First operand 22677 states and 28056 transitions. Second operand has 16 states, 16 states have (on average 11.1875) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:14,686 INFO L93 Difference]: Finished difference Result 94378 states and 117342 transitions. [2023-12-25 09:20:14,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 09:20:14,687 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.1875) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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 96 [2023-12-25 09:20:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:14,780 INFO L225 Difference]: With dead ends: 94378 [2023-12-25 09:20:14,780 INFO L226 Difference]: Without dead ends: 72292 [2023-12-25 09:20:14,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=1589, Unknown=0, NotChecked=0, Total=2070 [2023-12-25 09:20:14,814 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 2034 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:14,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 2417 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1853 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 09:20:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72292 states. [2023-12-25 09:20:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72292 to 25648. [2023-12-25 09:20:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25648 states, 25647 states have (on average 1.237064763910009) internal successors, (31727), 25647 states have internal predecessors, (31727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25648 states to 25648 states and 31727 transitions. [2023-12-25 09:20:15,386 INFO L78 Accepts]: Start accepts. Automaton has 25648 states and 31727 transitions. Word has length 96 [2023-12-25 09:20:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:15,386 INFO L495 AbstractCegarLoop]: Abstraction has 25648 states and 31727 transitions. [2023-12-25 09:20:15,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.1875) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 25648 states and 31727 transitions. [2023-12-25 09:20:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 09:20:15,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:15,391 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] [2023-12-25 09:20:15,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-12-25 09:20:15,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:15,594 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:15,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1510327294, now seen corresponding path program 1 times [2023-12-25 09:20:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824656513] [2023-12-25 09:20:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:15,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:15,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:15,595 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:15,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 09:20:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:15,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:20:15,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:16,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:16,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:16,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824656513] [2023-12-25 09:20:16,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824656513] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:16,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:16,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:20:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649414436] [2023-12-25 09:20:16,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:16,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:20:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:20:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:20:16,448 INFO L87 Difference]: Start difference. First operand 25648 states and 31727 transitions. Second operand has 16 states, 16 states have (on average 11.4375) internal successors, (183), 15 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:18,103 INFO L93 Difference]: Finished difference Result 69893 states and 86266 transitions. [2023-12-25 09:20:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-25 09:20:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.4375) internal successors, (183), 15 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-25 09:20:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:18,158 INFO L225 Difference]: With dead ends: 69893 [2023-12-25 09:20:18,159 INFO L226 Difference]: Without dead ends: 45185 [2023-12-25 09:20:18,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 09:20:18,203 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1881 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:18,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 1837 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:20:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45185 states. [2023-12-25 09:20:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45185 to 27353. [2023-12-25 09:20:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27353 states, 27352 states have (on average 1.2302573852003509) internal successors, (33650), 27352 states have internal predecessors, (33650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27353 states to 27353 states and 33650 transitions. [2023-12-25 09:20:18,623 INFO L78 Accepts]: Start accepts. Automaton has 27353 states and 33650 transitions. Word has length 96 [2023-12-25 09:20:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:18,623 INFO L495 AbstractCegarLoop]: Abstraction has 27353 states and 33650 transitions. [2023-12-25 09:20:18,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.4375) internal successors, (183), 15 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 27353 states and 33650 transitions. [2023-12-25 09:20:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 09:20:18,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:18,627 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] [2023-12-25 09:20:18,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:18,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:18,831 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:18,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1227486004, now seen corresponding path program 1 times [2023-12-25 09:20:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:18,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994307041] [2023-12-25 09:20:18,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:18,832 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:20:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:18,833 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:18,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 09:20:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:18,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:20:18,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:19,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:19,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994307041] [2023-12-25 09:20:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994307041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 09:20:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383469830] [2023-12-25 09:20:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:19,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:19,432 INFO L87 Difference]: Start difference. First operand 27353 states and 33650 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:20,480 INFO L93 Difference]: Finished difference Result 41349 states and 50720 transitions. [2023-12-25 09:20:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 09:20:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2023-12-25 09:20:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:20,515 INFO L225 Difference]: With dead ends: 41349 [2023-12-25 09:20:20,515 INFO L226 Difference]: Without dead ends: 29103 [2023-12-25 09:20:20,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2023-12-25 09:20:20,531 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 963 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:20,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 886 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 09:20:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29103 states. [2023-12-25 09:20:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29103 to 26623. [2023-12-25 09:20:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26623 states, 26622 states have (on average 1.2257155735857561) internal successors, (32631), 26622 states have internal predecessors, (32631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26623 states to 26623 states and 32631 transitions. [2023-12-25 09:20:20,868 INFO L78 Accepts]: Start accepts. Automaton has 26623 states and 32631 transitions. Word has length 96 [2023-12-25 09:20:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:20,868 INFO L495 AbstractCegarLoop]: Abstraction has 26623 states and 32631 transitions. [2023-12-25 09:20:20,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 26623 states and 32631 transitions. [2023-12-25 09:20:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-25 09:20:20,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:20,873 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] [2023-12-25 09:20:20,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:21,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:21,076 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:21,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash 132470367, now seen corresponding path program 1 times [2023-12-25 09:20:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:21,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934016500] [2023-12-25 09:20:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:21,077 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:20:21,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:21,078 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:21,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 09:20:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:21,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:21,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:21,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:21,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:21,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934016500] [2023-12-25 09:20:21,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934016500] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:21,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:21,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 09:20:21,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096827997] [2023-12-25 09:20:21,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:21,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 09:20:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:21,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 09:20:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-25 09:20:21,390 INFO L87 Difference]: Start difference. First operand 26623 states and 32631 transitions. Second operand has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 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:20:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:21,748 INFO L93 Difference]: Finished difference Result 73490 states and 90288 transitions. [2023-12-25 09:20:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 09:20:21,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 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 97 [2023-12-25 09:20:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:21,819 INFO L225 Difference]: With dead ends: 73490 [2023-12-25 09:20:21,819 INFO L226 Difference]: Without dead ends: 53760 [2023-12-25 09:20:21,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 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 09:20:21,836 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 326 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:21,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1083 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53760 states. [2023-12-25 09:20:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53760 to 43130. [2023-12-25 09:20:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43130 states, 43129 states have (on average 1.2165596234552158) internal successors, (52469), 43129 states have internal predecessors, (52469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43130 states to 43130 states and 52469 transitions. [2023-12-25 09:20:22,637 INFO L78 Accepts]: Start accepts. Automaton has 43130 states and 52469 transitions. Word has length 97 [2023-12-25 09:20:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:22,637 INFO L495 AbstractCegarLoop]: Abstraction has 43130 states and 52469 transitions. [2023-12-25 09:20:22,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.5) internal successors, (188), 8 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:20:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 43130 states and 52469 transitions. [2023-12-25 09:20:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:20:22,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:22,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:22,676 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 09:20:22,847 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 09:20:22,847 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:22,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash -550199222, now seen corresponding path program 1 times [2023-12-25 09:20:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398670652] [2023-12-25 09:20:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:22,848 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:20:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:22,849 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 09:20:22,851 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 09:20:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:22,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:23,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:23,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:23,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:23,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398670652] [2023-12-25 09:20:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398670652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:23,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109696468] [2023-12-25 09:20:23,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:23,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:20:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:20:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:20:23,284 INFO L87 Difference]: Start difference. First operand 43130 states and 52469 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:23,680 INFO L93 Difference]: Finished difference Result 79468 states and 95739 transitions. [2023-12-25 09:20:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:20:23,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 09:20:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:23,735 INFO L225 Difference]: With dead ends: 79468 [2023-12-25 09:20:23,735 INFO L226 Difference]: Without dead ends: 48325 [2023-12-25 09:20:23,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:20:23,757 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 742 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:23,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 379 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48325 states. [2023-12-25 09:20:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48325 to 41597. [2023-12-25 09:20:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41597 states, 41596 states have (on average 1.204298490239446) internal successors, (50094), 41596 states have internal predecessors, (50094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41597 states to 41597 states and 50094 transitions. [2023-12-25 09:20:24,383 INFO L78 Accepts]: Start accepts. Automaton has 41597 states and 50094 transitions. Word has length 107 [2023-12-25 09:20:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:24,383 INFO L495 AbstractCegarLoop]: Abstraction has 41597 states and 50094 transitions. [2023-12-25 09:20:24,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 41597 states and 50094 transitions. [2023-12-25 09:20:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:20:24,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:24,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:24,392 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 09:20:24,592 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 09:20:24,592 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:24,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash -398146486, now seen corresponding path program 1 times [2023-12-25 09:20:24,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:24,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993058625] [2023-12-25 09:20:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:24,593 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:20:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:24,606 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 09:20:24,607 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 09:20:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:24,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:24,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:24,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:25,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:25,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993058625] [2023-12-25 09:20:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993058625] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:25,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306086681] [2023-12-25 09:20:25,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:25,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:25,035 INFO L87 Difference]: Start difference. First operand 41597 states and 50094 transitions. Second operand has 9 states, 9 states have (on average 22.666666666666668) internal successors, (204), 9 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:25,591 INFO L93 Difference]: Finished difference Result 107450 states and 128891 transitions. [2023-12-25 09:20:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:20:25,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.666666666666668) internal successors, (204), 9 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 09:20:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:25,679 INFO L225 Difference]: With dead ends: 107450 [2023-12-25 09:20:25,679 INFO L226 Difference]: Without dead ends: 66805 [2023-12-25 09:20:25,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:25,704 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1434 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:25,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 384 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66805 states. [2023-12-25 09:20:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66805 to 45781. [2023-12-25 09:20:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45781 states, 45780 states have (on average 1.2025775447793796) internal successors, (55054), 45780 states have internal predecessors, (55054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45781 states to 45781 states and 55054 transitions. [2023-12-25 09:20:26,312 INFO L78 Accepts]: Start accepts. Automaton has 45781 states and 55054 transitions. Word has length 107 [2023-12-25 09:20:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:26,312 INFO L495 AbstractCegarLoop]: Abstraction has 45781 states and 55054 transitions. [2023-12-25 09:20:26,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.666666666666668) internal successors, (204), 9 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 45781 states and 55054 transitions. [2023-12-25 09:20:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:20:26,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:26,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:26,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-12-25 09:20:26,523 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 09:20:26,523 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:26,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1896786647, now seen corresponding path program 1 times [2023-12-25 09:20:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:26,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611506554] [2023-12-25 09:20:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:26,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:26,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:26,525 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 09:20:26,556 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 09:20:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:26,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:26,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:26,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:26,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:26,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611506554] [2023-12-25 09:20:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611506554] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:26,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:26,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50565333] [2023-12-25 09:20:26,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:26,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:26,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:26,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:26,968 INFO L87 Difference]: Start difference. First operand 45781 states and 55054 transitions. Second operand has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 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 09:20:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:27,491 INFO L93 Difference]: Finished difference Result 105888 states and 126539 transitions. [2023-12-25 09:20:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:20:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 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 107 [2023-12-25 09:20:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:27,591 INFO L225 Difference]: With dead ends: 105888 [2023-12-25 09:20:27,591 INFO L226 Difference]: Without dead ends: 71447 [2023-12-25 09:20:27,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:27,615 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1222 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:27,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 501 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:20:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71447 states. [2023-12-25 09:20:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71447 to 49147. [2023-12-25 09:20:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49147 states, 49146 states have (on average 1.1998941928132503) internal successors, (58970), 49146 states have internal predecessors, (58970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49147 states to 49147 states and 58970 transitions. [2023-12-25 09:20:28,292 INFO L78 Accepts]: Start accepts. Automaton has 49147 states and 58970 transitions. Word has length 107 [2023-12-25 09:20:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:28,292 INFO L495 AbstractCegarLoop]: Abstraction has 49147 states and 58970 transitions. [2023-12-25 09:20:28,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.0) internal successors, (198), 9 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 09:20:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 49147 states and 58970 transitions. [2023-12-25 09:20:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:28,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:28,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:28,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:28,510 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 09:20:28,511 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:28,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1987660714, now seen corresponding path program 1 times [2023-12-25 09:20:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329136224] [2023-12-25 09:20:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:28,512 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:20:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:28,513 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 09:20:28,515 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 09:20:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:28,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:28,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:20:29,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:29,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:29,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329136224] [2023-12-25 09:20:29,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329136224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:29,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:29,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 09:20:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257226543] [2023-12-25 09:20:29,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:29,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:20:29,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:20:29,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:20:29,157 INFO L87 Difference]: Start difference. First operand 49147 states and 58970 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:30,206 INFO L93 Difference]: Finished difference Result 88488 states and 105995 transitions. [2023-12-25 09:20:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:20:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:30,300 INFO L225 Difference]: With dead ends: 88488 [2023-12-25 09:20:30,300 INFO L226 Difference]: Without dead ends: 78752 [2023-12-25 09:20:30,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:20:30,331 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1083 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:30,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 936 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:20:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78752 states. [2023-12-25 09:20:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78752 to 53744. [2023-12-25 09:20:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53744 states, 53743 states have (on average 1.1999330145321252) internal successors, (64488), 53743 states have internal predecessors, (64488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53744 states to 53744 states and 64488 transitions. [2023-12-25 09:20:31,137 INFO L78 Accepts]: Start accepts. Automaton has 53744 states and 64488 transitions. Word has length 110 [2023-12-25 09:20:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:31,137 INFO L495 AbstractCegarLoop]: Abstraction has 53744 states and 64488 transitions. [2023-12-25 09:20:31,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 53744 states and 64488 transitions. [2023-12-25 09:20:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:31,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:31,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:31,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:31,350 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 09:20:31,351 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:31,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1670744667, now seen corresponding path program 1 times [2023-12-25 09:20:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85689198] [2023-12-25 09:20:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:31,352 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:20:31,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:31,353 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 09:20:31,383 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 09:20:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:31,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:31,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:31,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:31,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:31,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85689198] [2023-12-25 09:20:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85689198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:31,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:31,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:31,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360773796] [2023-12-25 09:20:31,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:31,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:31,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:31,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:31,468 INFO L87 Difference]: Start difference. First operand 53744 states and 64488 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:31,889 INFO L93 Difference]: Finished difference Result 101548 states and 121968 transitions. [2023-12-25 09:20:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:31,949 INFO L225 Difference]: With dead ends: 101548 [2023-12-25 09:20:31,950 INFO L226 Difference]: Without dead ends: 48809 [2023-12-25 09:20:31,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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:20:31,973 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 87 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 340 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:20:31,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 340 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48809 states. [2023-12-25 09:20:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48809 to 47081. [2023-12-25 09:20:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47081 states, 47080 states have (on average 1.1742778249787595) internal successors, (55285), 47080 states have internal predecessors, (55285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47081 states to 47081 states and 55285 transitions. [2023-12-25 09:20:32,464 INFO L78 Accepts]: Start accepts. Automaton has 47081 states and 55285 transitions. Word has length 110 [2023-12-25 09:20:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:32,465 INFO L495 AbstractCegarLoop]: Abstraction has 47081 states and 55285 transitions. [2023-12-25 09:20:32,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 47081 states and 55285 transitions. [2023-12-25 09:20:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:32,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:32,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:32,475 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 09:20:32,678 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 09:20:32,678 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:32,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1410006785, now seen corresponding path program 1 times [2023-12-25 09:20:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326688225] [2023-12-25 09:20:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:32,679 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:20:32,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:32,680 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 09:20:32,681 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 09:20:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:32,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:32,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:33,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:33,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326688225] [2023-12-25 09:20:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326688225] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:33,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621038086] [2023-12-25 09:20:33,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:33,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:33,807 INFO L87 Difference]: Start difference. First operand 47081 states and 55285 transitions. Second operand has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:36,963 INFO L93 Difference]: Finished difference Result 130659 states and 151902 transitions. [2023-12-25 09:20:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-25 09:20:36,963 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:37,105 INFO L225 Difference]: With dead ends: 130659 [2023-12-25 09:20:37,105 INFO L226 Difference]: Without dead ends: 124555 [2023-12-25 09:20:37,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=889, Invalid=4081, Unknown=0, NotChecked=0, Total=4970 [2023-12-25 09:20:37,120 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 3406 mSDsluCounter, 5425 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 5847 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:37,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3406 Valid, 5847 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 09:20:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124555 states. [2023-12-25 09:20:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124555 to 47178. [2023-12-25 09:20:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47178 states, 47177 states have (on average 1.1741314623651355) internal successors, (55392), 47177 states have internal predecessors, (55392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47178 states to 47178 states and 55392 transitions. [2023-12-25 09:20:37,912 INFO L78 Accepts]: Start accepts. Automaton has 47178 states and 55392 transitions. Word has length 110 [2023-12-25 09:20:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:37,912 INFO L495 AbstractCegarLoop]: Abstraction has 47178 states and 55392 transitions. [2023-12-25 09:20:37,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47178 states and 55392 transitions. [2023-12-25 09:20:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:37,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:37,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:37,921 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 09:20:38,121 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 09:20:38,122 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:38,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1455731547, now seen corresponding path program 1 times [2023-12-25 09:20:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383477437] [2023-12-25 09:20:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:38,122 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:20:38,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:38,124 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 09:20:38,126 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 09:20:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:38,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:38,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:39,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:39,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:39,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383477437] [2023-12-25 09:20:39,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383477437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:39,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:39,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:39,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142621103] [2023-12-25 09:20:39,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:39,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:39,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:39,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:39,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:39,390 INFO L87 Difference]: Start difference. First operand 47178 states and 55392 transitions. Second operand has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:43,006 INFO L93 Difference]: Finished difference Result 136509 states and 158489 transitions. [2023-12-25 09:20:43,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-25 09:20:43,007 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:43,157 INFO L225 Difference]: With dead ends: 136509 [2023-12-25 09:20:43,158 INFO L226 Difference]: Without dead ends: 130405 [2023-12-25 09:20:43,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=885, Invalid=4085, Unknown=0, NotChecked=0, Total=4970 [2023-12-25 09:20:43,197 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 2892 mSDsluCounter, 6270 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2892 SdHoareTripleChecker+Valid, 6663 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:43,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2892 Valid, 6663 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 09:20:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130405 states. [2023-12-25 09:20:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130405 to 47190. [2023-12-25 09:20:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47190 states, 47189 states have (on average 1.174087181334633) internal successors, (55404), 47189 states have internal predecessors, (55404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47190 states to 47190 states and 55404 transitions. [2023-12-25 09:20:44,131 INFO L78 Accepts]: Start accepts. Automaton has 47190 states and 55404 transitions. Word has length 110 [2023-12-25 09:20:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:44,131 INFO L495 AbstractCegarLoop]: Abstraction has 47190 states and 55404 transitions. [2023-12-25 09:20:44,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 47190 states and 55404 transitions. [2023-12-25 09:20:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:44,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:44,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:44,139 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 (39)] Ended with exit code 0 [2023-12-25 09:20:44,338 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 09:20:44,339 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:44,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1377229239, now seen corresponding path program 1 times [2023-12-25 09:20:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005403485] [2023-12-25 09:20:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:44,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:44,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:44,341 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 09:20:44,367 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 09:20:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:44,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:44,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 09:20:44,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:44,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:44,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005403485] [2023-12-25 09:20:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005403485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:44,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:44,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 09:20:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814282944] [2023-12-25 09:20:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:44,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:20:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:20:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:20:44,884 INFO L87 Difference]: Start difference. First operand 47190 states and 55404 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:46,223 INFO L93 Difference]: Finished difference Result 114202 states and 133892 transitions. [2023-12-25 09:20:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 09:20:46,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:46,323 INFO L225 Difference]: With dead ends: 114202 [2023-12-25 09:20:46,323 INFO L226 Difference]: Without dead ends: 92841 [2023-12-25 09:20:46,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2023-12-25 09:20:46,357 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1567 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:46,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 978 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 09:20:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92841 states. [2023-12-25 09:20:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92841 to 47081. [2023-12-25 09:20:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47081 states, 47080 states have (on average 1.1740866610025489) internal successors, (55276), 47080 states have internal predecessors, (55276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47081 states to 47081 states and 55276 transitions. [2023-12-25 09:20:47,098 INFO L78 Accepts]: Start accepts. Automaton has 47081 states and 55276 transitions. Word has length 110 [2023-12-25 09:20:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:47,098 INFO L495 AbstractCegarLoop]: Abstraction has 47081 states and 55276 transitions. [2023-12-25 09:20:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47081 states and 55276 transitions. [2023-12-25 09:20:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:47,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:47,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:47,106 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 (40)] Ended with exit code 0 [2023-12-25 09:20:47,305 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 09:20:47,305 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:47,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1480972988, now seen corresponding path program 1 times [2023-12-25 09:20:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:47,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547716643] [2023-12-25 09:20:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:47,306 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:20:47,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:47,307 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 09:20:47,339 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 09:20:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:47,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:47,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:48,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:48,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547716643] [2023-12-25 09:20:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547716643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:48,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-25 09:20:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806811530] [2023-12-25 09:20:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 09:20:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 09:20:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 09:20:48,102 INFO L87 Difference]: Start difference. First operand 47081 states and 55276 transitions. Second operand has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 14 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:49,571 INFO L93 Difference]: Finished difference Result 101507 states and 119410 transitions. [2023-12-25 09:20:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 09:20:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 14 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:49,665 INFO L225 Difference]: With dead ends: 101507 [2023-12-25 09:20:49,665 INFO L226 Difference]: Without dead ends: 88701 [2023-12-25 09:20:49,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2023-12-25 09:20:49,695 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 1439 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 3420 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:49,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 3420 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:20:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88701 states. [2023-12-25 09:20:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88701 to 52672. [2023-12-25 09:20:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52672 states, 52671 states have (on average 1.1716124622657629) internal successors, (61710), 52671 states have internal predecessors, (61710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52672 states to 52672 states and 61710 transitions. [2023-12-25 09:20:50,556 INFO L78 Accepts]: Start accepts. Automaton has 52672 states and 61710 transitions. Word has length 110 [2023-12-25 09:20:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:50,556 INFO L495 AbstractCegarLoop]: Abstraction has 52672 states and 61710 transitions. [2023-12-25 09:20:50,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 14 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52672 states and 61710 transitions. [2023-12-25 09:20:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:50,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:50,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:50,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:50,764 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 09:20:50,765 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:50,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1355548204, now seen corresponding path program 1 times [2023-12-25 09:20:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475191188] [2023-12-25 09:20:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:50,766 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:20:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:50,767 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 09:20:50,797 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 09:20:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:50,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:50,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:51,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:51,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475191188] [2023-12-25 09:20:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475191188] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:51,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-25 09:20:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814209613] [2023-12-25 09:20:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:51,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 09:20:51,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:51,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 09:20:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 09:20:51,342 INFO L87 Difference]: Start difference. First operand 52672 states and 61710 transitions. Second operand has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 14 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:52,645 INFO L93 Difference]: Finished difference Result 93112 states and 109580 transitions. [2023-12-25 09:20:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 09:20:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 14 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:52,738 INFO L225 Difference]: With dead ends: 93112 [2023-12-25 09:20:52,738 INFO L226 Difference]: Without dead ends: 88680 [2023-12-25 09:20:52,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2023-12-25 09:20:52,764 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 1166 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:52,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 3386 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:20:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88680 states. [2023-12-25 09:20:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88680 to 56474. [2023-12-25 09:20:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56474 states, 56473 states have (on average 1.171427053636251) internal successors, (66154), 56473 states have internal predecessors, (66154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56474 states to 56474 states and 66154 transitions. [2023-12-25 09:20:53,511 INFO L78 Accepts]: Start accepts. Automaton has 56474 states and 66154 transitions. Word has length 110 [2023-12-25 09:20:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:53,511 INFO L495 AbstractCegarLoop]: Abstraction has 56474 states and 66154 transitions. [2023-12-25 09:20:53,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.857142857142857) internal successors, (110), 14 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56474 states and 66154 transitions. [2023-12-25 09:20:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:53,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:53,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:53,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:53,718 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 09:20:53,719 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:53,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2046449002, now seen corresponding path program 1 times [2023-12-25 09:20:53,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:53,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692176723] [2023-12-25 09:20:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:53,720 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:20:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:53,727 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 09:20:53,754 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 09:20:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:53,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:20:53,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:20:54,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:54,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692176723] [2023-12-25 09:20:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692176723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 09:20:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90766875] [2023-12-25 09:20:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:54,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:20:54,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:54,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:20:54,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:20:54,324 INFO L87 Difference]: Start difference. First operand 56474 states and 66154 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:55,419 INFO L93 Difference]: Finished difference Result 94709 states and 111105 transitions. [2023-12-25 09:20:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:20:55,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:20:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:55,490 INFO L225 Difference]: With dead ends: 94709 [2023-12-25 09:20:55,490 INFO L226 Difference]: Without dead ends: 68022 [2023-12-25 09:20:55,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:20:55,518 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 968 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:55,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 923 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:20:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68022 states. [2023-12-25 09:20:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68022 to 53909. [2023-12-25 09:20:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53909 states, 53908 states have (on average 1.171143429546635) internal successors, (63134), 53908 states have internal predecessors, (63134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53909 states to 53909 states and 63134 transitions. [2023-12-25 09:20:56,230 INFO L78 Accepts]: Start accepts. Automaton has 53909 states and 63134 transitions. Word has length 110 [2023-12-25 09:20:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:56,230 INFO L495 AbstractCegarLoop]: Abstraction has 53909 states and 63134 transitions. [2023-12-25 09:20:56,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 53909 states and 63134 transitions. [2023-12-25 09:20:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:20:56,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:56,234 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:56,237 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 09:20:56,437 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 09:20:56,437 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:56,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash 216053612, now seen corresponding path program 1 times [2023-12-25 09:20:56,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:56,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131887648] [2023-12-25 09:20:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:56,438 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:20:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:56,439 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 09:20:56,441 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 09:20:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:56,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:20:56,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:57,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:57,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131887648] [2023-12-25 09:20:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131887648] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:57,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:20:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442078768] [2023-12-25 09:20:57,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:57,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:20:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:57,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:20:57,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:20:57,632 INFO L87 Difference]: Start difference. First operand 53909 states and 63134 transitions. Second operand has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:01,571 INFO L93 Difference]: Finished difference Result 173629 states and 202827 transitions. [2023-12-25 09:21:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-12-25 09:21:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:21:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:01,777 INFO L225 Difference]: With dead ends: 173629 [2023-12-25 09:21:01,777 INFO L226 Difference]: Without dead ends: 160933 [2023-12-25 09:21:01,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1434, Invalid=4572, Unknown=0, NotChecked=0, Total=6006 [2023-12-25 09:21:01,817 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 3181 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3181 SdHoareTripleChecker+Valid, 6242 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:01,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3181 Valid, 6242 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 09:21:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160933 states. [2023-12-25 09:21:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160933 to 75750. [2023-12-25 09:21:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75750 states, 75749 states have (on average 1.1643982098773582) internal successors, (88202), 75749 states have internal predecessors, (88202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75750 states to 75750 states and 88202 transitions. [2023-12-25 09:21:03,158 INFO L78 Accepts]: Start accepts. Automaton has 75750 states and 88202 transitions. Word has length 110 [2023-12-25 09:21:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:03,173 INFO L495 AbstractCegarLoop]: Abstraction has 75750 states and 88202 transitions. [2023-12-25 09:21:03,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 75750 states and 88202 transitions. [2023-12-25 09:21:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:21:03,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:03,179 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:03,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-12-25 09:21:03,392 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 09:21:03,392 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:03,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash -327728894, now seen corresponding path program 1 times [2023-12-25 09:21:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:03,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502213970] [2023-12-25 09:21:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:03,393 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:21:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:03,395 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 09:21:03,408 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 09:21:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:03,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:21:03,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:04,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:04,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502213970] [2023-12-25 09:21:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502213970] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:04,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:21:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739088869] [2023-12-25 09:21:04,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:04,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:21:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:04,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:21:04,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:21:04,591 INFO L87 Difference]: Start difference. First operand 75750 states and 88202 transitions. Second operand has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:09,091 INFO L93 Difference]: Finished difference Result 158473 states and 184434 transitions. [2023-12-25 09:21:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-25 09:21:09,092 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:21:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:09,273 INFO L225 Difference]: With dead ends: 158473 [2023-12-25 09:21:09,274 INFO L226 Difference]: Without dead ends: 138805 [2023-12-25 09:21:09,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1070, Invalid=3622, Unknown=0, NotChecked=0, Total=4692 [2023-12-25 09:21:09,318 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 2912 mSDsluCounter, 6193 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2912 SdHoareTripleChecker+Valid, 6677 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:09,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2912 Valid, 6677 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 09:21:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138805 states. [2023-12-25 09:21:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138805 to 77082. [2023-12-25 09:21:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77082 states, 77081 states have (on average 1.160740000778402) internal successors, (89471), 77081 states have internal predecessors, (89471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 89471 transitions. [2023-12-25 09:21:10,488 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 89471 transitions. Word has length 110 [2023-12-25 09:21:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:10,488 INFO L495 AbstractCegarLoop]: Abstraction has 77082 states and 89471 transitions. [2023-12-25 09:21:10,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 89471 transitions. [2023-12-25 09:21:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 09:21:10,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:10,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:10,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2023-12-25 09:21:10,697 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 09:21:10,697 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:10,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1746928973, now seen corresponding path program 1 times [2023-12-25 09:21:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827156114] [2023-12-25 09:21:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:10,698 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:21:10,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:10,699 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 09:21:10,718 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 09:21:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:10,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:21:10,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:21:11,242 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:21:11,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827156114] [2023-12-25 09:21:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827156114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:21:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:21:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 09:21:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364580257] [2023-12-25 09:21:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:21:11,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:21:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:11,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:21:11,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:21:11,243 INFO L87 Difference]: Start difference. First operand 77082 states and 89471 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:12,204 INFO L93 Difference]: Finished difference Result 83540 states and 96963 transitions. [2023-12-25 09:21:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:21:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-25 09:21:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:12,282 INFO L225 Difference]: With dead ends: 83540 [2023-12-25 09:21:12,282 INFO L226 Difference]: Without dead ends: 80335 [2023-12-25 09:21:12,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:21:12,306 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 1054 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:12,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1556 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:21:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80335 states. [2023-12-25 09:21:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80335 to 76993. [2023-12-25 09:21:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76993 states, 76992 states have (on average 1.1607829384871156) internal successors, (89371), 76992 states have internal predecessors, (89371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76993 states to 76993 states and 89371 transitions. [2023-12-25 09:21:13,236 INFO L78 Accepts]: Start accepts. Automaton has 76993 states and 89371 transitions. Word has length 111 [2023-12-25 09:21:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:13,236 INFO L495 AbstractCegarLoop]: Abstraction has 76993 states and 89371 transitions. [2023-12-25 09:21:13,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 76993 states and 89371 transitions. [2023-12-25 09:21:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 09:21:13,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:13,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:13,261 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 09:21:13,461 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 09:21:13,461 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:13,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1743082722, now seen corresponding path program 1 times [2023-12-25 09:21:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201253522] [2023-12-25 09:21:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:13,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:21:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:13,463 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 09:21:13,494 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 09:21:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:13,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:21:13,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:21:13,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:21:13,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201253522] [2023-12-25 09:21:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201253522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:21:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:21:13,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 09:21:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578131317] [2023-12-25 09:21:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:21:13,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:21:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:13,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:21:13,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:21:13,852 INFO L87 Difference]: Start difference. First operand 76993 states and 89371 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:14,739 INFO L93 Difference]: Finished difference Result 108240 states and 126232 transitions. [2023-12-25 09:21:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 09:21:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-25 09:21:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:14,870 INFO L225 Difference]: With dead ends: 108240 [2023-12-25 09:21:14,870 INFO L226 Difference]: Without dead ends: 96110 [2023-12-25 09:21:14,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:21:14,901 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 940 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:14,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1358 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:21:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96110 states. [2023-12-25 09:21:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96110 to 69053. [2023-12-25 09:21:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69053 states, 69052 states have (on average 1.1588802641487574) internal successors, (80023), 69052 states have internal predecessors, (80023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69053 states to 69053 states and 80023 transitions. [2023-12-25 09:21:15,850 INFO L78 Accepts]: Start accepts. Automaton has 69053 states and 80023 transitions. Word has length 111 [2023-12-25 09:21:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:15,850 INFO L495 AbstractCegarLoop]: Abstraction has 69053 states and 80023 transitions. [2023-12-25 09:21:15,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 69053 states and 80023 transitions. [2023-12-25 09:21:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 09:21:15,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:15,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:15,873 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 09:21:16,073 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 09:21:16,073 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:16,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:16,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1335730848, now seen corresponding path program 1 times [2023-12-25 09:21:16,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518973264] [2023-12-25 09:21:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:16,076 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:21:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:16,079 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:21:16,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-25 09:21:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:16,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:21:16,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:16,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:21:16,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518973264] [2023-12-25 09:21:16,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518973264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:21:16,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:21:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 09:21:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467868228] [2023-12-25 09:21:16,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:21:16,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 09:21:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:16,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 09:21:16,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-25 09:21:16,352 INFO L87 Difference]: Start difference. First operand 69053 states and 80023 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:16,977 INFO L93 Difference]: Finished difference Result 100677 states and 117243 transitions. [2023-12-25 09:21:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 09:21:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-25 09:21:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:17,074 INFO L225 Difference]: With dead ends: 100677 [2023-12-25 09:21:17,074 INFO L226 Difference]: Without dead ends: 91666 [2023-12-25 09:21:17,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2023-12-25 09:21:17,105 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 724 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3341 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:17,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3341 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:21:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91666 states. [2023-12-25 09:21:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91666 to 76507. [2023-12-25 09:21:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76507 states, 76506 states have (on average 1.1601965858886885) internal successors, (88762), 76506 states have internal predecessors, (88762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76507 states to 76507 states and 88762 transitions. [2023-12-25 09:21:18,011 INFO L78 Accepts]: Start accepts. Automaton has 76507 states and 88762 transitions. Word has length 111 [2023-12-25 09:21:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:18,011 INFO L495 AbstractCegarLoop]: Abstraction has 76507 states and 88762 transitions. [2023-12-25 09:21:18,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 76507 states and 88762 transitions. [2023-12-25 09:21:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 09:21:18,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:18,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:18,019 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 (48)] Forceful destruction successful, exit code 0 [2023-12-25 09:21:18,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:18,219 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:18,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1330141256, now seen corresponding path program 1 times [2023-12-25 09:21:18,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:18,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661325367] [2023-12-25 09:21:18,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:18,220 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:21:18,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:18,221 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:21:18,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2023-12-25 09:21:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:18,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:21:18,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 09:21:18,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:21:18,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661325367] [2023-12-25 09:21:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661325367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:21:18,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:21:18,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 09:21:18,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873568169] [2023-12-25 09:21:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:21:18,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:21:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:21:18,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:21:18,848 INFO L87 Difference]: Start difference. First operand 76507 states and 88762 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:19,662 INFO L93 Difference]: Finished difference Result 125222 states and 146004 transitions. [2023-12-25 09:21:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 09:21:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-25 09:21:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:19,924 INFO L225 Difference]: With dead ends: 125222 [2023-12-25 09:21:19,924 INFO L226 Difference]: Without dead ends: 85046 [2023-12-25 09:21:19,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:21:19,951 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 980 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:19,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1687 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 09:21:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85046 states. [2023-12-25 09:21:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85046 to 73287. [2023-12-25 09:21:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73287 states, 73286 states have (on average 1.1606445978768114) internal successors, (85059), 73286 states have internal predecessors, (85059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73287 states to 73287 states and 85059 transitions. [2023-12-25 09:21:20,733 INFO L78 Accepts]: Start accepts. Automaton has 73287 states and 85059 transitions. Word has length 111 [2023-12-25 09:21:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:20,733 INFO L495 AbstractCegarLoop]: Abstraction has 73287 states and 85059 transitions. [2023-12-25 09:21:20,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 73287 states and 85059 transitions. [2023-12-25 09:21:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 09:21:20,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:20,738 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:20,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2023-12-25 09:21:20,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:20,940 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:20,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1656275788, now seen corresponding path program 1 times [2023-12-25 09:21:20,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:20,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599781266] [2023-12-25 09:21:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:20,941 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:21:20,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:20,943 INFO L229 MonitoredProcess]: Starting monitored process 50 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:21:20,944 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 (50)] Waiting until timeout for monitored process [2023-12-25 09:21:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:21,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 09:21:21,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:23,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:24,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599781266] [2023-12-25 09:21:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599781266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:24,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 43 [2023-12-25 09:21:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101689602] [2023-12-25 09:21:24,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:24,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 09:21:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 09:21:24,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1598, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 09:21:24,561 INFO L87 Difference]: Start difference. First operand 73287 states and 85059 transitions. Second operand has 43 states, 43 states have (on average 5.116279069767442) internal successors, (220), 43 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:28:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:08,812 INFO L93 Difference]: Finished difference Result 396294 states and 454188 transitions. [2023-12-25 09:28:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 928 states. [2023-12-25 09:28:08,812 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.116279069767442) internal successors, (220), 43 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) Word has length 115 [2023-12-25 09:28:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:09,625 INFO L225 Difference]: With dead ends: 396294 [2023-12-25 09:28:09,626 INFO L226 Difference]: Without dead ends: 387162 [2023-12-25 09:28:09,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1153 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 964 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443054 ImplicationChecksByTransitivity, 382.8s TimeCoverageRelationStatistics Valid=60583, Invalid=871607, Unknown=0, NotChecked=0, Total=932190 [2023-12-25 09:28:09,808 INFO L413 NwaCegarLoop]: 1092 mSDtfsCounter, 17063 mSDsluCounter, 21820 mSDsCounter, 0 mSdLazyCounter, 12946 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17063 SdHoareTripleChecker+Valid, 22912 SdHoareTripleChecker+Invalid, 13232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 12946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:09,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17063 Valid, 22912 Invalid, 13232 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [286 Valid, 12946 Invalid, 0 Unknown, 0 Unchecked, 19.4s Time] [2023-12-25 09:28:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387162 states. [2023-12-25 09:28:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387162 to 81670. [2023-12-25 09:28:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81670 states, 81669 states have (on average 1.1611504977408809) internal successors, (94830), 81669 states have internal predecessors, (94830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81670 states to 81670 states and 94830 transitions. [2023-12-25 09:28:11,851 INFO L78 Accepts]: Start accepts. Automaton has 81670 states and 94830 transitions. Word has length 115 [2023-12-25 09:28:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:11,851 INFO L495 AbstractCegarLoop]: Abstraction has 81670 states and 94830 transitions. [2023-12-25 09:28:11,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.116279069767442) internal successors, (220), 43 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:28:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 81670 states and 94830 transitions. [2023-12-25 09:28:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-25 09:28:11,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:11,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:28:11,860 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 (50)] Forceful destruction successful, exit code 0 [2023-12-25 09:28:12,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:12,058 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:12,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:12,059 INFO L85 PathProgramCache]: Analyzing trace with hash 213718822, now seen corresponding path program 1 times [2023-12-25 09:28:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:12,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258597462] [2023-12-25 09:28:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:12,059 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:28:12,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:12,061 INFO L229 MonitoredProcess]: Starting monitored process 51 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:28:12,084 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 (51)] Waiting until timeout for monitored process [2023-12-25 09:28:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:12,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 09:28:12,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:28:14,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:28:14,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258597462] [2023-12-25 09:28:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258597462] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:28:14,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:28:14,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-12-25 09:28:14,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233703306] [2023-12-25 09:28:14,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:28:14,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 09:28:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:14,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 09:28:14,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:28:14,933 INFO L87 Difference]: Start difference. First operand 81670 states and 94830 transitions. Second operand has 29 states, 29 states have (on average 4.0) internal successors, (116), 29 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:23,004 INFO L93 Difference]: Finished difference Result 109130 states and 126444 transitions. [2023-12-25 09:28:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-25 09:28:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.0) internal successors, (116), 29 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2023-12-25 09:28:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:23,108 INFO L225 Difference]: With dead ends: 109130 [2023-12-25 09:28:23,109 INFO L226 Difference]: Without dead ends: 101256 [2023-12-25 09:28:23,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2023-12-25 09:28:23,139 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 1328 mSDsluCounter, 6845 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 7238 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:23,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 7238 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-25 09:28:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101256 states. [2023-12-25 09:28:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101256 to 81659. [2023-12-25 09:28:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81659 states, 81658 states have (on average 1.161123221239805) internal successors, (94815), 81658 states have internal predecessors, (94815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81659 states to 81659 states and 94815 transitions. [2023-12-25 09:28:23,964 INFO L78 Accepts]: Start accepts. Automaton has 81659 states and 94815 transitions. Word has length 116 [2023-12-25 09:28:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:23,965 INFO L495 AbstractCegarLoop]: Abstraction has 81659 states and 94815 transitions. [2023-12-25 09:28:23,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.0) internal successors, (116), 29 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 81659 states and 94815 transitions. [2023-12-25 09:28:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-25 09:28:23,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:23,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:28:23,990 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 (51)] Forceful destruction successful, exit code 0 [2023-12-25 09:28:24,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:24,172 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:24,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1975062622, now seen corresponding path program 1 times [2023-12-25 09:28:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:24,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402002922] [2023-12-25 09:28:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:24,173 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:28:24,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:24,174 INFO L229 MonitoredProcess]: Starting monitored process 52 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:28:24,180 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 (52)] Waiting until timeout for monitored process [2023-12-25 09:28:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:24,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-25 09:28:24,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:28:27,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:28:27,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402002922] [2023-12-25 09:28:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402002922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:28:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:28:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-12-25 09:28:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561401358] [2023-12-25 09:28:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:28:27,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:28:27,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:28:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:28:27,085 INFO L87 Difference]: Start difference. First operand 81659 states and 94815 transitions. Second operand has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:35,571 INFO L93 Difference]: Finished difference Result 125038 states and 145259 transitions. [2023-12-25 09:28:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 09:28:35,572 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2023-12-25 09:28:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:35,694 INFO L225 Difference]: With dead ends: 125038 [2023-12-25 09:28:35,695 INFO L226 Difference]: Without dead ends: 116282 [2023-12-25 09:28:35,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=298, Invalid=1958, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 09:28:35,729 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 1391 mSDsluCounter, 7450 mSDsCounter, 0 mSdLazyCounter, 4290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 7853 SdHoareTripleChecker+Invalid, 4296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:35,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 7853 Invalid, 4296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4290 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 09:28:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116282 states. [2023-12-25 09:28:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116282 to 81579. [2023-12-25 09:28:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81579 states, 81578 states have (on average 1.1610605800583491) internal successors, (94717), 81578 states have internal predecessors, (94717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81579 states to 81579 states and 94717 transitions. [2023-12-25 09:28:36,711 INFO L78 Accepts]: Start accepts. Automaton has 81579 states and 94717 transitions. Word has length 116 [2023-12-25 09:28:36,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:36,711 INFO L495 AbstractCegarLoop]: Abstraction has 81579 states and 94717 transitions. [2023-12-25 09:28:36,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 81579 states and 94717 transitions. [2023-12-25 09:28:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-25 09:28:36,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:36,726 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:36,728 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 (52)] Ended with exit code 0 [2023-12-25 09:28:36,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:36,929 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:36,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash 749459101, now seen corresponding path program 1 times [2023-12-25 09:28:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389833810] [2023-12-25 09:28:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:36,929 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:28:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:36,930 INFO L229 MonitoredProcess]: Starting monitored process 53 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:28:36,935 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 (53)] Waiting until timeout for monitored process [2023-12-25 09:28:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:37,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:28:37,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 09:28:37,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:28:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 09:28:38,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389833810] [2023-12-25 09:28:38,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389833810] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:28:38,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:28:38,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:28:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005697063] [2023-12-25 09:28:38,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:28:38,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:28:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:38,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:28:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:28:38,069 INFO L87 Difference]: Start difference. First operand 81579 states and 94717 transitions. Second operand has 16 states, 16 states have (on average 15.5625) internal successors, (249), 15 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:41,413 INFO L93 Difference]: Finished difference Result 210355 states and 242639 transitions. [2023-12-25 09:28:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-25 09:28:41,414 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.5625) internal successors, (249), 15 states have internal predecessors, (249), 0 states have call successors, (0), 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 140 [2023-12-25 09:28:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:41,583 INFO L225 Difference]: With dead ends: 210355 [2023-12-25 09:28:41,584 INFO L226 Difference]: Without dead ends: 148553 [2023-12-25 09:28:41,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1026, Invalid=3264, Unknown=0, NotChecked=0, Total=4290 [2023-12-25 09:28:41,641 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 2704 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2704 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:41,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2704 Valid, 2379 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 09:28:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148553 states. [2023-12-25 09:28:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148553 to 80931. [2023-12-25 09:28:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80931 states, 80930 states have (on average 1.1581860867416285) internal successors, (93732), 80930 states have internal predecessors, (93732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80931 states to 80931 states and 93732 transitions. [2023-12-25 09:28:42,893 INFO L78 Accepts]: Start accepts. Automaton has 80931 states and 93732 transitions. Word has length 140 [2023-12-25 09:28:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:42,893 INFO L495 AbstractCegarLoop]: Abstraction has 80931 states and 93732 transitions. [2023-12-25 09:28:42,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.5625) internal successors, (249), 15 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 80931 states and 93732 transitions. [2023-12-25 09:28:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-25 09:28:42,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:42,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 09:28:42,909 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 (53)] Forceful destruction successful, exit code 0 [2023-12-25 09:28:43,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:43,108 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:43,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1558025720, now seen corresponding path program 1 times [2023-12-25 09:28:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167739554] [2023-12-25 09:28:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:43,109 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:28:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:43,110 INFO L229 MonitoredProcess]: Starting monitored process 54 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:28:43,143 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 (54)] Waiting until timeout for monitored process [2023-12-25 09:28:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:43,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:28:43,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 09:28:43,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:28:43,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167739554] [2023-12-25 09:28:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167739554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:28:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:28:43,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:28:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182659970] [2023-12-25 09:28:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:28:43,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:28:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:43,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:28:43,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:28:43,245 INFO L87 Difference]: Start difference. First operand 80931 states and 93732 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:43,462 INFO L93 Difference]: Finished difference Result 114438 states and 132639 transitions. [2023-12-25 09:28:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:28:43,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 140 [2023-12-25 09:28:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:43,501 INFO L225 Difference]: With dead ends: 114438 [2023-12-25 09:28:43,501 INFO L226 Difference]: Without dead ends: 34353 [2023-12-25 09:28:43,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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:28:43,538 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 77 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 305 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:28:43,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 305 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:28:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34353 states. [2023-12-25 09:28:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34353 to 33445. [2023-12-25 09:28:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33445 states, 33444 states have (on average 1.130755890443727) internal successors, (37817), 33444 states have internal predecessors, (37817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33445 states to 33445 states and 37817 transitions. [2023-12-25 09:28:43,997 INFO L78 Accepts]: Start accepts. Automaton has 33445 states and 37817 transitions. Word has length 140 [2023-12-25 09:28:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:43,997 INFO L495 AbstractCegarLoop]: Abstraction has 33445 states and 37817 transitions. [2023-12-25 09:28:43,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33445 states and 37817 transitions. [2023-12-25 09:28:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 09:28:44,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:44,003 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:44,006 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 (54)] Ended with exit code 0 [2023-12-25 09:28:44,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:44,206 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:44,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1287593026, now seen corresponding path program 1 times [2023-12-25 09:28:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:44,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491918294] [2023-12-25 09:28:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:44,206 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:28:44,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:44,207 INFO L229 MonitoredProcess]: Starting monitored process 55 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:28:44,209 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 (55)] Waiting until timeout for monitored process [2023-12-25 09:28:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:44,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:28:44,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-25 09:28:44,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:28:44,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491918294] [2023-12-25 09:28:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491918294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:28:44,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:28:44,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 09:28:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664807729] [2023-12-25 09:28:44,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:28:44,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 09:28:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 09:28:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-25 09:28:44,979 INFO L87 Difference]: Start difference. First operand 33445 states and 37817 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:45,937 INFO L93 Difference]: Finished difference Result 50329 states and 56975 transitions. [2023-12-25 09:28:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 09:28:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-25 09:28:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:45,974 INFO L225 Difference]: With dead ends: 50329 [2023-12-25 09:28:45,974 INFO L226 Difference]: Without dead ends: 38721 [2023-12-25 09:28:46,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2023-12-25 09:28:46,054 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1588 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:46,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 1729 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:28:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38721 states. [2023-12-25 09:28:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38721 to 33445. [2023-12-25 09:28:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33445 states, 33444 states have (on average 1.1306661882549933) internal successors, (37814), 33444 states have internal predecessors, (37814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33445 states to 33445 states and 37814 transitions. [2023-12-25 09:28:46,316 INFO L78 Accepts]: Start accepts. Automaton has 33445 states and 37814 transitions. Word has length 141 [2023-12-25 09:28:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:46,316 INFO L495 AbstractCegarLoop]: Abstraction has 33445 states and 37814 transitions. [2023-12-25 09:28:46,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 33445 states and 37814 transitions. [2023-12-25 09:28:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 09:28:46,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:46,322 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:46,328 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 (55)] Forceful destruction successful, exit code 0 [2023-12-25 09:28:46,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:46,524 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:46,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -376349584, now seen corresponding path program 1 times [2023-12-25 09:28:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:46,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789408129] [2023-12-25 09:28:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:46,525 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:28:46,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:46,526 INFO L229 MonitoredProcess]: Starting monitored process 56 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:28:46,528 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 (56)] Waiting until timeout for monitored process [2023-12-25 09:28:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:46,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:28:46,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-25 09:28:47,122 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:28:47,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:47,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789408129] [2023-12-25 09:28:47,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789408129] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:28:47,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:28:47,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 09:28:47,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851890536] [2023-12-25 09:28:47,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:28:47,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 09:28:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 09:28:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-25 09:28:47,123 INFO L87 Difference]: Start difference. First operand 33445 states and 37814 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:47,924 INFO L93 Difference]: Finished difference Result 42843 states and 48629 transitions. [2023-12-25 09:28:47,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 09:28:47,924 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-25 09:28:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:47,961 INFO L225 Difference]: With dead ends: 42843 [2023-12-25 09:28:47,961 INFO L226 Difference]: Without dead ends: 39861 [2023-12-25 09:28:47,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2023-12-25 09:28:47,971 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 1749 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:47,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 1829 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:28:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39861 states. [2023-12-25 09:28:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39861 to 33425. [2023-12-25 09:28:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33425 states, 33424 states have (on average 1.1305947821924365) internal successors, (37789), 33424 states have internal predecessors, (37789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33425 states to 33425 states and 37789 transitions. [2023-12-25 09:28:48,293 INFO L78 Accepts]: Start accepts. Automaton has 33425 states and 37789 transitions. Word has length 141 [2023-12-25 09:28:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:48,293 INFO L495 AbstractCegarLoop]: Abstraction has 33425 states and 37789 transitions. [2023-12-25 09:28:48,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33425 states and 37789 transitions. [2023-12-25 09:28:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 09:28:48,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:48,299 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:48,302 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 (56)] Forceful destruction successful, exit code 0 [2023-12-25 09:28:48,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:48,502 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:48,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2090629638, now seen corresponding path program 1 times [2023-12-25 09:28:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:48,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786867275] [2023-12-25 09:28:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:48,503 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:28:48,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:48,504 INFO L229 MonitoredProcess]: Starting monitored process 57 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:28:48,505 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 (57)] Waiting until timeout for monitored process [2023-12-25 09:28:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:48,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:28:48,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-25 09:28:49,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:28:49,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786867275] [2023-12-25 09:28:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786867275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:28:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:28:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 09:28:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306406376] [2023-12-25 09:28:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:28:49,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 09:28:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:49,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 09:28:49,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 09:28:49,037 INFO L87 Difference]: Start difference. First operand 33425 states and 37789 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:28:50,064 INFO L93 Difference]: Finished difference Result 56294 states and 63694 transitions. [2023-12-25 09:28:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 09:28:50,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 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 141 [2023-12-25 09:28:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:28:50,113 INFO L225 Difference]: With dead ends: 56294 [2023-12-25 09:28:50,113 INFO L226 Difference]: Without dead ends: 49278 [2023-12-25 09:28:50,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2023-12-25 09:28:50,127 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 1443 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:28:50,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 2148 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:28:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2023-12-25 09:28:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 34378. [2023-12-25 09:28:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34378 states, 34377 states have (on average 1.1297960845914419) internal successors, (38839), 34377 states have internal predecessors, (38839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34378 states to 34378 states and 38839 transitions. [2023-12-25 09:28:50,586 INFO L78 Accepts]: Start accepts. Automaton has 34378 states and 38839 transitions. Word has length 141 [2023-12-25 09:28:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:28:50,587 INFO L495 AbstractCegarLoop]: Abstraction has 34378 states and 38839 transitions. [2023-12-25 09:28:50,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:28:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34378 states and 38839 transitions. [2023-12-25 09:28:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-25 09:28:50,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:28:50,593 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:50,596 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 (57)] Forceful destruction successful, exit code 0 [2023-12-25 09:28:50,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:28:50,796 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:28:50,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:28:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1804274270, now seen corresponding path program 1 times [2023-12-25 09:28:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:28:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558787105] [2023-12-25 09:28:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:28:50,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:28:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:28:50,797 INFO L229 MonitoredProcess]: Starting monitored process 58 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:28:50,799 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 (58)] Waiting until timeout for monitored process [2023-12-25 09:28:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:28:50,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:28:50,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:28:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 09:28:51,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:28:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 09:28:51,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:28:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558787105] [2023-12-25 09:28:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558787105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:28:51,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:28:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:28:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822914573] [2023-12-25 09:28:51,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:28:51,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:28:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:28:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:28:51,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:28:51,844 INFO L87 Difference]: Start difference. First operand 34378 states and 38839 transitions. Second operand has 26 states, 26 states have (on average 8.461538461538462) internal successors, (220), 25 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:29:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:01,955 INFO L93 Difference]: Finished difference Result 96478 states and 108409 transitions. [2023-12-25 09:29:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-12-25 09:29:01,955 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.461538461538462) internal successors, (220), 25 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) Word has length 144 [2023-12-25 09:29:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:02,042 INFO L225 Difference]: With dead ends: 96478 [2023-12-25 09:29:02,042 INFO L226 Difference]: Without dead ends: 82560 [2023-12-25 09:29:02,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6445 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3056, Invalid=16684, Unknown=0, NotChecked=0, Total=19740 [2023-12-25 09:29:02,068 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 7626 mSDsluCounter, 4363 mSDsCounter, 0 mSdLazyCounter, 4044 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7626 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 4087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:02,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7626 Valid, 4703 Invalid, 4087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4044 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-25 09:29:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82560 states. [2023-12-25 09:29:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82560 to 35467. [2023-12-25 09:29:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35467 states, 35466 states have (on average 1.125274911182541) internal successors, (39909), 35466 states have internal predecessors, (39909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35467 states to 35467 states and 39909 transitions. [2023-12-25 09:29:02,619 INFO L78 Accepts]: Start accepts. Automaton has 35467 states and 39909 transitions. Word has length 144 [2023-12-25 09:29:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:02,620 INFO L495 AbstractCegarLoop]: Abstraction has 35467 states and 39909 transitions. [2023-12-25 09:29:02,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.461538461538462) internal successors, (220), 25 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:29:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 35467 states and 39909 transitions. [2023-12-25 09:29:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-25 09:29:02,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:02,626 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:02,628 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 (58)] Ended with exit code 0 [2023-12-25 09:29:02,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:02,829 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:02,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 669072361, now seen corresponding path program 1 times [2023-12-25 09:29:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999474829] [2023-12-25 09:29:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:02,830 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:29:02,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:02,831 INFO L229 MonitoredProcess]: Starting monitored process 59 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:29:02,831 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 (59)] Waiting until timeout for monitored process [2023-12-25 09:29:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:02,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:29:02,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-25 09:29:03,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:29:03,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999474829] [2023-12-25 09:29:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999474829] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:29:03,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:29:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-25 09:29:03,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879298010] [2023-12-25 09:29:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:29:03,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 09:29:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 09:29:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 09:29:03,565 INFO L87 Difference]: Start difference. First operand 35467 states and 39909 transitions. Second operand has 14 states, 14 states have (on average 8.5) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:06,120 INFO L93 Difference]: Finished difference Result 42828 states and 48334 transitions. [2023-12-25 09:29:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 09:29:06,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.5) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2023-12-25 09:29:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:06,158 INFO L225 Difference]: With dead ends: 42828 [2023-12-25 09:29:06,159 INFO L226 Difference]: Without dead ends: 40266 [2023-12-25 09:29:06,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2023-12-25 09:29:06,171 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 1380 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:06,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1719 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 09:29:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40266 states. [2023-12-25 09:29:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40266 to 35479. [2023-12-25 09:29:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35479 states, 35478 states have (on average 1.1252043519927843) internal successors, (39920), 35478 states have internal predecessors, (39920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35479 states to 35479 states and 39920 transitions. [2023-12-25 09:29:06,481 INFO L78 Accepts]: Start accepts. Automaton has 35479 states and 39920 transitions. Word has length 144 [2023-12-25 09:29:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:06,481 INFO L495 AbstractCegarLoop]: Abstraction has 35479 states and 39920 transitions. [2023-12-25 09:29:06,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.5) internal successors, (119), 13 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35479 states and 39920 transitions. [2023-12-25 09:29:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-25 09:29:06,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:06,488 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:06,490 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 (59)] Forceful destruction successful, exit code 0 [2023-12-25 09:29:06,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:06,690 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:06,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash 545834785, now seen corresponding path program 1 times [2023-12-25 09:29:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115755783] [2023-12-25 09:29:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:06,691 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:29:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:06,692 INFO L229 MonitoredProcess]: Starting monitored process 60 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:29:06,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2023-12-25 09:29:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:06,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:29:06,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-25 09:29:07,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-25 09:29:07,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:07,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115755783] [2023-12-25 09:29:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115755783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:07,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:29:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345623374] [2023-12-25 09:29:07,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:07,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:29:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:29:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:29:07,822 INFO L87 Difference]: Start difference. First operand 35479 states and 39920 transitions. Second operand has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:12,906 INFO L93 Difference]: Finished difference Result 71906 states and 80867 transitions. [2023-12-25 09:29:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-25 09:29:12,907 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2023-12-25 09:29:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:12,966 INFO L225 Difference]: With dead ends: 71906 [2023-12-25 09:29:12,966 INFO L226 Difference]: Without dead ends: 60393 [2023-12-25 09:29:12,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=860, Invalid=3172, Unknown=0, NotChecked=0, Total=4032 [2023-12-25 09:29:12,984 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 2907 mSDsluCounter, 3637 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 3899 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:12,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2907 Valid, 3899 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-25 09:29:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60393 states. [2023-12-25 09:29:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60393 to 36622. [2023-12-25 09:29:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36622 states, 36621 states have (on average 1.1250921602359303) internal successors, (41202), 36621 states have internal predecessors, (41202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36622 states to 36622 states and 41202 transitions. [2023-12-25 09:29:13,392 INFO L78 Accepts]: Start accepts. Automaton has 36622 states and 41202 transitions. Word has length 144 [2023-12-25 09:29:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:13,392 INFO L495 AbstractCegarLoop]: Abstraction has 36622 states and 41202 transitions. [2023-12-25 09:29:13,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 36622 states and 41202 transitions. [2023-12-25 09:29:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 09:29:13,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:13,399 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:13,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Forceful destruction successful, exit code 0 [2023-12-25 09:29:13,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:13,602 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:13,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1097081433, now seen corresponding path program 1 times [2023-12-25 09:29:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579744919] [2023-12-25 09:29:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:13,611 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:29:13,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:13,612 INFO L229 MonitoredProcess]: Starting monitored process 61 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:29:13,612 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 (61)] Waiting until timeout for monitored process [2023-12-25 09:29:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:13,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 09:29:13,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:29:14,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:29:14,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579744919] [2023-12-25 09:29:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579744919] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:14,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-25 09:29:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865478341] [2023-12-25 09:29:14,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:14,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 09:29:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:14,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 09:29:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-12-25 09:29:14,251 INFO L87 Difference]: Start difference. First operand 36622 states and 41202 transitions. Second operand has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 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 09:29:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:15,369 INFO L93 Difference]: Finished difference Result 66590 states and 75223 transitions. [2023-12-25 09:29:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 09:29:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 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 145 [2023-12-25 09:29:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:15,423 INFO L225 Difference]: With dead ends: 66590 [2023-12-25 09:29:15,423 INFO L226 Difference]: Without dead ends: 52040 [2023-12-25 09:29:15,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 269 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 09:29:15,441 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 1071 mSDsluCounter, 3414 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:15,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 3698 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:29:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52040 states. [2023-12-25 09:29:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52040 to 38551. [2023-12-25 09:29:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38551 states, 38550 states have (on average 1.1254474708171207) internal successors, (43386), 38550 states have internal predecessors, (43386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38551 states to 38551 states and 43386 transitions. [2023-12-25 09:29:16,018 INFO L78 Accepts]: Start accepts. Automaton has 38551 states and 43386 transitions. Word has length 145 [2023-12-25 09:29:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:16,019 INFO L495 AbstractCegarLoop]: Abstraction has 38551 states and 43386 transitions. [2023-12-25 09:29:16,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 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 09:29:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 38551 states and 43386 transitions. [2023-12-25 09:29:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 09:29:16,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:16,025 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:16,030 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 (61)] Forceful destruction successful, exit code 0 [2023-12-25 09:29:16,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:16,228 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:16,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 818717712, now seen corresponding path program 1 times [2023-12-25 09:29:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770191543] [2023-12-25 09:29:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:16,401 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:29:16,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:16,402 INFO L229 MonitoredProcess]: Starting monitored process 62 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:29:16,403 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 (62)] Waiting until timeout for monitored process [2023-12-25 09:29:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:16,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 09:29:16,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:29:16,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:29:17,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:17,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770191543] [2023-12-25 09:29:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770191543] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:17,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-12-25 09:29:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119148234] [2023-12-25 09:29:17,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:17,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 09:29:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:17,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 09:29:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-12-25 09:29:17,064 INFO L87 Difference]: Start difference. First operand 38551 states and 43386 transitions. Second operand has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 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 09:29:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:18,132 INFO L93 Difference]: Finished difference Result 63664 states and 71855 transitions. [2023-12-25 09:29:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 09:29:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 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 145 [2023-12-25 09:29:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:18,188 INFO L225 Difference]: With dead ends: 63664 [2023-12-25 09:29:18,189 INFO L226 Difference]: Without dead ends: 56816 [2023-12-25 09:29:18,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 269 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 09:29:18,205 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1196 mSDsluCounter, 3842 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 4176 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:18,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 4176 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:29:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56816 states. [2023-12-25 09:29:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56816 to 39243. [2023-12-25 09:29:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39243 states, 39242 states have (on average 1.1238978645328985) internal successors, (44104), 39242 states have internal predecessors, (44104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39243 states to 39243 states and 44104 transitions. [2023-12-25 09:29:18,644 INFO L78 Accepts]: Start accepts. Automaton has 39243 states and 44104 transitions. Word has length 145 [2023-12-25 09:29:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:18,645 INFO L495 AbstractCegarLoop]: Abstraction has 39243 states and 44104 transitions. [2023-12-25 09:29:18,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 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 09:29:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39243 states and 44104 transitions. [2023-12-25 09:29:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 09:29:18,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:18,651 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:18,654 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 (62)] Ended with exit code 0 [2023-12-25 09:29:18,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:18,854 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:18,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash 964001188, now seen corresponding path program 1 times [2023-12-25 09:29:18,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:18,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799061652] [2023-12-25 09:29:18,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:18,855 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:29:18,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:18,856 INFO L229 MonitoredProcess]: Starting monitored process 63 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:29:18,858 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 (63)] Waiting until timeout for monitored process [2023-12-25 09:29:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:18,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 09:29:18,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:29:19,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:29:19,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799061652] [2023-12-25 09:29:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799061652] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:19,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2023-12-25 09:29:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447071156] [2023-12-25 09:29:19,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:19,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 09:29:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:19,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 09:29:19,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:29:19,454 INFO L87 Difference]: Start difference. First operand 39243 states and 44104 transitions. Second operand has 19 states, 19 states have (on average 9.157894736842104) internal successors, (174), 19 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:20,430 INFO L93 Difference]: Finished difference Result 62184 states and 69875 transitions. [2023-12-25 09:29:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 09:29:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.157894736842104) internal successors, (174), 19 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2023-12-25 09:29:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:20,488 INFO L225 Difference]: With dead ends: 62184 [2023-12-25 09:29:20,488 INFO L226 Difference]: Without dead ends: 55365 [2023-12-25 09:29:20,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 09:29:20,506 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 1931 mSDsluCounter, 3084 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:20,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1931 Valid, 3421 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:29:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55365 states. [2023-12-25 09:29:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55365 to 40416. [2023-12-25 09:29:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40416 states, 40415 states have (on average 1.1218606952864036) internal successors, (45340), 40415 states have internal predecessors, (45340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40416 states to 40416 states and 45340 transitions. [2023-12-25 09:29:21,002 INFO L78 Accepts]: Start accepts. Automaton has 40416 states and 45340 transitions. Word has length 145 [2023-12-25 09:29:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:21,002 INFO L495 AbstractCegarLoop]: Abstraction has 40416 states and 45340 transitions. [2023-12-25 09:29:21,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.157894736842104) internal successors, (174), 19 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 40416 states and 45340 transitions. [2023-12-25 09:29:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 09:29:21,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:21,010 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:21,014 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 (63)] Forceful destruction successful, exit code 0 [2023-12-25 09:29:21,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:21,212 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:21,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1598545334, now seen corresponding path program 1 times [2023-12-25 09:29:21,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:21,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68933921] [2023-12-25 09:29:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:21,213 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:29:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:21,214 INFO L229 MonitoredProcess]: Starting monitored process 64 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:29:21,219 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 (64)] Waiting until timeout for monitored process [2023-12-25 09:29:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:21,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:29:21,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:29:22,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:29:22,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68933921] [2023-12-25 09:29:22,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68933921] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:22,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:22,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:29:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423028170] [2023-12-25 09:29:22,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:22,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:29:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:29:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:29:22,330 INFO L87 Difference]: Start difference. First operand 40416 states and 45340 transitions. Second operand has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 17 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:25,154 INFO L93 Difference]: Finished difference Result 94056 states and 105599 transitions. [2023-12-25 09:29:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-25 09:29:25,154 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 17 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2023-12-25 09:29:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:25,237 INFO L225 Difference]: With dead ends: 94056 [2023-12-25 09:29:25,237 INFO L226 Difference]: Without dead ends: 74726 [2023-12-25 09:29:25,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=963, Invalid=3327, Unknown=0, NotChecked=0, Total=4290 [2023-12-25 09:29:25,274 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 3178 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3178 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:25,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3178 Valid, 1857 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 09:29:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74726 states. [2023-12-25 09:29:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74726 to 34253. [2023-12-25 09:29:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34253 states, 34252 states have (on average 1.1181828798318347) internal successors, (38300), 34252 states have internal predecessors, (38300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34253 states to 34253 states and 38300 transitions. [2023-12-25 09:29:25,768 INFO L78 Accepts]: Start accepts. Automaton has 34253 states and 38300 transitions. Word has length 148 [2023-12-25 09:29:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:25,768 INFO L495 AbstractCegarLoop]: Abstraction has 34253 states and 38300 transitions. [2023-12-25 09:29:25,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.166666666666666) internal successors, (255), 17 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 34253 states and 38300 transitions. [2023-12-25 09:29:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 09:29:25,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:25,774 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:25,778 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 (64)] Forceful destruction successful, exit code 0 [2023-12-25 09:29:25,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:25,978 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:25,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1593857134, now seen corresponding path program 1 times [2023-12-25 09:29:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310822314] [2023-12-25 09:29:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:25,980 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:29:25,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:25,981 INFO L229 MonitoredProcess]: Starting monitored process 65 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:29:25,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Waiting until timeout for monitored process [2023-12-25 09:29:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:26,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:29:26,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:29:26,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:29:27,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310822314] [2023-12-25 09:29:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310822314] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:27,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:27,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:29:27,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021661052] [2023-12-25 09:29:27,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:27,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:29:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:29:27,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:29:27,101 INFO L87 Difference]: Start difference. First operand 34253 states and 38300 transitions. Second operand has 18 states, 18 states have (on average 14.5) internal successors, (261), 17 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:29,377 INFO L93 Difference]: Finished difference Result 43984 states and 49307 transitions. [2023-12-25 09:29:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-25 09:29:29,378 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 17 states have internal predecessors, (261), 0 states have call successors, (0), 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 148 [2023-12-25 09:29:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:29,413 INFO L225 Difference]: With dead ends: 43984 [2023-12-25 09:29:29,413 INFO L226 Difference]: Without dead ends: 38267 [2023-12-25 09:29:29,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=475, Invalid=1331, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 09:29:29,427 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 1902 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1902 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:29,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1902 Valid, 2088 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 09:29:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38267 states. [2023-12-25 09:29:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38267 to 33505. [2023-12-25 09:29:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33505 states, 33504 states have (on average 1.1172098853868195) internal successors, (37431), 33504 states have internal predecessors, (37431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33505 states to 33505 states and 37431 transitions. [2023-12-25 09:29:29,736 INFO L78 Accepts]: Start accepts. Automaton has 33505 states and 37431 transitions. Word has length 148 [2023-12-25 09:29:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:29,736 INFO L495 AbstractCegarLoop]: Abstraction has 33505 states and 37431 transitions. [2023-12-25 09:29:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 17 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 33505 states and 37431 transitions. [2023-12-25 09:29:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 09:29:29,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:29,806 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:29,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 (65)] Ended with exit code 0 [2023-12-25 09:29:30,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:30,006 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:30,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1232616311, now seen corresponding path program 1 times [2023-12-25 09:29:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432509951] [2023-12-25 09:29:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:30,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 09:29:30,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:30,008 INFO L229 MonitoredProcess]: Starting monitored process 66 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:29:30,042 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 (66)] Waiting until timeout for monitored process [2023-12-25 09:29:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:30,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:29:30,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 38 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:29:31,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 38 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:29:31,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432509951] [2023-12-25 09:29:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432509951] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:31,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:31,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:29:31,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338828357] [2023-12-25 09:29:31,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:31,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:29:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:31,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:29:31,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:29:31,381 INFO L87 Difference]: Start difference. First operand 33505 states and 37431 transitions. Second operand has 26 states, 26 states have (on average 10.653846153846153) internal successors, (277), 25 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:38,265 INFO L93 Difference]: Finished difference Result 46049 states and 51497 transitions. [2023-12-25 09:29:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-12-25 09:29:38,266 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.653846153846153) internal successors, (277), 25 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2023-12-25 09:29:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:38,304 INFO L225 Difference]: With dead ends: 46049 [2023-12-25 09:29:38,304 INFO L226 Difference]: Without dead ends: 41738 [2023-12-25 09:29:38,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1900, Invalid=8200, Unknown=0, NotChecked=0, Total=10100 [2023-12-25 09:29:38,317 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 3586 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 3812 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3586 SdHoareTripleChecker+Valid, 4261 SdHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:38,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3586 Valid, 4261 Invalid, 3840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3812 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 09:29:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41738 states. [2023-12-25 09:29:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41738 to 33504. [2023-12-25 09:29:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33504 states, 33503 states have (on average 1.1166164224099335) internal successors, (37410), 33503 states have internal predecessors, (37410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33504 states to 33504 states and 37410 transitions. [2023-12-25 09:29:38,607 INFO L78 Accepts]: Start accepts. Automaton has 33504 states and 37410 transitions. Word has length 148 [2023-12-25 09:29:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:38,608 INFO L495 AbstractCegarLoop]: Abstraction has 33504 states and 37410 transitions. [2023-12-25 09:29:38,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.653846153846153) internal successors, (277), 25 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 33504 states and 37410 transitions. [2023-12-25 09:29:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 09:29:38,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:38,614 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:38,616 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 (66)] Ended with exit code 0 [2023-12-25 09:29:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:38,816 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:38,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1126411724, now seen corresponding path program 1 times [2023-12-25 09:29:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596154597] [2023-12-25 09:29:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:38,817 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:29:38,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:38,818 INFO L229 MonitoredProcess]: Starting monitored process 67 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:29:38,820 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 (67)] Waiting until timeout for monitored process [2023-12-25 09:29:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:38,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:29:38,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:29:39,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 61 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:29:39,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596154597] [2023-12-25 09:29:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596154597] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:39,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:29:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554468907] [2023-12-25 09:29:39,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:39,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:29:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:29:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:29:39,800 INFO L87 Difference]: Start difference. First operand 33504 states and 37410 transitions. Second operand has 18 states, 18 states have (on average 13.61111111111111) internal successors, (245), 17 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:41,448 INFO L93 Difference]: Finished difference Result 58029 states and 64581 transitions. [2023-12-25 09:29:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 09:29:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.61111111111111) internal successors, (245), 17 states have internal predecessors, (245), 0 states have call successors, (0), 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 148 [2023-12-25 09:29:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:41,481 INFO L225 Difference]: With dead ends: 58029 [2023-12-25 09:29:41,481 INFO L226 Difference]: Without dead ends: 33635 [2023-12-25 09:29:41,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1056, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:29:41,497 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 1670 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:41,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 1709 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 09:29:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33635 states. [2023-12-25 09:29:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33635 to 21142. [2023-12-25 09:29:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21142 states, 21141 states have (on average 1.100515585828485) internal successors, (23266), 21141 states have internal predecessors, (23266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21142 states to 21142 states and 23266 transitions. [2023-12-25 09:29:41,774 INFO L78 Accepts]: Start accepts. Automaton has 21142 states and 23266 transitions. Word has length 148 [2023-12-25 09:29:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:41,774 INFO L495 AbstractCegarLoop]: Abstraction has 21142 states and 23266 transitions. [2023-12-25 09:29:41,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.61111111111111) internal successors, (245), 17 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 21142 states and 23266 transitions. [2023-12-25 09:29:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 09:29:41,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:41,779 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:41,781 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 (67)] Ended with exit code 0 [2023-12-25 09:29:41,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:41,982 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:41,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash 212916743, now seen corresponding path program 1 times [2023-12-25 09:29:41,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247948415] [2023-12-25 09:29:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:41,983 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:29:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:41,984 INFO L229 MonitoredProcess]: Starting monitored process 68 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:29:42,017 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 (68)] Waiting until timeout for monitored process [2023-12-25 09:29:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:42,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:29:42,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:29:42,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:29:43,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247948415] [2023-12-25 09:29:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247948415] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:43,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:43,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 09:29:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598283229] [2023-12-25 09:29:43,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:43,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 09:29:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 09:29:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-12-25 09:29:43,211 INFO L87 Difference]: Start difference. First operand 21142 states and 23266 transitions. Second operand has 26 states, 26 states have (on average 10.884615384615385) internal successors, (283), 25 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 09:29:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:52,810 INFO L93 Difference]: Finished difference Result 46789 states and 51536 transitions. [2023-12-25 09:29:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2023-12-25 09:29:52,810 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.884615384615385) internal successors, (283), 25 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 148 [2023-12-25 09:29:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:52,847 INFO L225 Difference]: With dead ends: 46789 [2023-12-25 09:29:52,847 INFO L226 Difference]: Without dead ends: 39883 [2023-12-25 09:29:52,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6128 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3259, Invalid=15647, Unknown=0, NotChecked=0, Total=18906 [2023-12-25 09:29:52,861 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 3589 mSDsluCounter, 3830 mSDsCounter, 0 mSdLazyCounter, 3823 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3589 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 3862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:52,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3589 Valid, 4171 Invalid, 3862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3823 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 09:29:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39883 states. [2023-12-25 09:29:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39883 to 20803. [2023-12-25 09:29:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20803 states, 20802 states have (on average 1.097250264397654) internal successors, (22825), 20802 states have internal predecessors, (22825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20803 states to 20803 states and 22825 transitions. [2023-12-25 09:29:53,091 INFO L78 Accepts]: Start accepts. Automaton has 20803 states and 22825 transitions. Word has length 148 [2023-12-25 09:29:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:29:53,091 INFO L495 AbstractCegarLoop]: Abstraction has 20803 states and 22825 transitions. [2023-12-25 09:29:53,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.884615384615385) internal successors, (283), 25 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 09:29:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 20803 states and 22825 transitions. [2023-12-25 09:29:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 09:29:53,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:29:53,097 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:53,099 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 (68)] Ended with exit code 0 [2023-12-25 09:29:53,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:29:53,299 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:29:53,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:29:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1625154032, now seen corresponding path program 1 times [2023-12-25 09:29:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:29:53,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630584679] [2023-12-25 09:29:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:29:53,300 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:29:53,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:29:53,301 INFO L229 MonitoredProcess]: Starting monitored process 69 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:29:53,304 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 (69)] Waiting until timeout for monitored process [2023-12-25 09:29:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:29:53,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:29:53,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:29:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:29:54,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:29:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:29:54,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:29:54,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630584679] [2023-12-25 09:29:54,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630584679] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:29:54,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:29:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-25 09:29:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283790223] [2023-12-25 09:29:54,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:29:54,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 09:29:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:29:54,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 09:29:54,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:29:54,938 INFO L87 Difference]: Start difference. First operand 20803 states and 22825 transitions. Second operand has 29 states, 29 states have (on average 9.0) internal successors, (261), 29 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:29:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:29:59,940 INFO L93 Difference]: Finished difference Result 36234 states and 39716 transitions. [2023-12-25 09:29:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-25 09:29:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.0) internal successors, (261), 29 states have internal predecessors, (261), 0 states have call successors, (0), 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 149 [2023-12-25 09:29:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:29:59,970 INFO L225 Difference]: With dead ends: 36234 [2023-12-25 09:29:59,970 INFO L226 Difference]: Without dead ends: 32923 [2023-12-25 09:29:59,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=830, Invalid=4426, Unknown=0, NotChecked=0, Total=5256 [2023-12-25 09:29:59,981 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 3660 mSDsluCounter, 7449 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3660 SdHoareTripleChecker+Valid, 7935 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:29:59,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3660 Valid, 7935 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 09:29:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32923 states. [2023-12-25 09:30:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32923 to 20918. [2023-12-25 09:30:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20918 states, 20917 states have (on average 1.0970502462112157) internal successors, (22947), 20917 states have internal predecessors, (22947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20918 states to 20918 states and 22947 transitions. [2023-12-25 09:30:00,190 INFO L78 Accepts]: Start accepts. Automaton has 20918 states and 22947 transitions. Word has length 149 [2023-12-25 09:30:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:00,190 INFO L495 AbstractCegarLoop]: Abstraction has 20918 states and 22947 transitions. [2023-12-25 09:30:00,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.0) internal successors, (261), 29 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20918 states and 22947 transitions. [2023-12-25 09:30:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 09:30:00,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:00,194 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:30:00,197 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 (69)] Ended with exit code 0 [2023-12-25 09:30:00,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:00,397 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:00,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1609004848, now seen corresponding path program 1 times [2023-12-25 09:30:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367135246] [2023-12-25 09:30:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:00,398 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:30:00,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:00,399 INFO L229 MonitoredProcess]: Starting monitored process 70 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:30:00,432 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 (70)] Waiting until timeout for monitored process [2023-12-25 09:30:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:00,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:30:00,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:30:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:30:01,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:30:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:30:01,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:30:01,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367135246] [2023-12-25 09:30:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367135246] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:30:01,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:30:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:30:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437828131] [2023-12-25 09:30:01,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:30:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:30:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:30:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:30:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:30:01,793 INFO L87 Difference]: Start difference. First operand 20918 states and 22947 transitions. Second operand has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:30:08,309 INFO L93 Difference]: Finished difference Result 41217 states and 45590 transitions. [2023-12-25 09:30:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-25 09:30:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 0 states have call successors, (0), 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 149 [2023-12-25 09:30:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:30:08,345 INFO L225 Difference]: With dead ends: 41217 [2023-12-25 09:30:08,345 INFO L226 Difference]: Without dead ends: 40263 [2023-12-25 09:30:08,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1197, Invalid=5775, Unknown=0, NotChecked=0, Total=6972 [2023-12-25 09:30:08,357 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 4496 mSDsluCounter, 6543 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4496 SdHoareTripleChecker+Valid, 7074 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:30:08,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4496 Valid, 7074 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 09:30:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40263 states. [2023-12-25 09:30:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40263 to 20859. [2023-12-25 09:30:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20859 states, 20858 states have (on average 1.0971809377696806) internal successors, (22885), 20858 states have internal predecessors, (22885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20859 states to 20859 states and 22885 transitions. [2023-12-25 09:30:08,575 INFO L78 Accepts]: Start accepts. Automaton has 20859 states and 22885 transitions. Word has length 149 [2023-12-25 09:30:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:08,575 INFO L495 AbstractCegarLoop]: Abstraction has 20859 states and 22885 transitions. [2023-12-25 09:30:08,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.642857142857142) internal successors, (242), 28 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20859 states and 22885 transitions. [2023-12-25 09:30:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 09:30:08,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:08,579 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:08,582 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 (70)] Forceful destruction successful, exit code 0 [2023-12-25 09:30:08,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:08,781 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:08,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1834649112, now seen corresponding path program 1 times [2023-12-25 09:30:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290956548] [2023-12-25 09:30:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:08,782 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:30:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:08,783 INFO L229 MonitoredProcess]: Starting monitored process 71 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:30:08,784 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 (71)] Waiting until timeout for monitored process [2023-12-25 09:30:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:08,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:30:08,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:30:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:30:09,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:30:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:30:10,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:30:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290956548] [2023-12-25 09:30:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290956548] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:30:10,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:30:10,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:30:10,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065771452] [2023-12-25 09:30:10,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:30:10,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:30:10,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:30:10,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:30:10,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:30:10,135 INFO L87 Difference]: Start difference. First operand 20859 states and 22885 transitions. Second operand has 28 states, 28 states have (on average 8.892857142857142) internal successors, (249), 28 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:30:20,428 INFO L93 Difference]: Finished difference Result 48039 states and 53007 transitions. [2023-12-25 09:30:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-12-25 09:30:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.892857142857142) internal successors, (249), 28 states have internal predecessors, (249), 0 states have call successors, (0), 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 149 [2023-12-25 09:30:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:30:20,469 INFO L225 Difference]: With dead ends: 48039 [2023-12-25 09:30:20,470 INFO L226 Difference]: Without dead ends: 44115 [2023-12-25 09:30:20,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1872, Invalid=8430, Unknown=0, NotChecked=0, Total=10302 [2023-12-25 09:30:20,483 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 4407 mSDsluCounter, 8457 mSDsCounter, 0 mSdLazyCounter, 2752 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4407 SdHoareTripleChecker+Valid, 9026 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:30:20,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4407 Valid, 9026 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2752 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-25 09:30:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44115 states. [2023-12-25 09:30:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44115 to 21028. [2023-12-25 09:30:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21028 states, 21027 states have (on average 1.0967803300518382) internal successors, (23062), 21027 states have internal predecessors, (23062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21028 states to 21028 states and 23062 transitions. [2023-12-25 09:30:20,727 INFO L78 Accepts]: Start accepts. Automaton has 21028 states and 23062 transitions. Word has length 149 [2023-12-25 09:30:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:20,727 INFO L495 AbstractCegarLoop]: Abstraction has 21028 states and 23062 transitions. [2023-12-25 09:30:20,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.892857142857142) internal successors, (249), 28 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 21028 states and 23062 transitions. [2023-12-25 09:30:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 09:30:20,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:20,732 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:20,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (71)] Forceful destruction successful, exit code 0 [2023-12-25 09:30:20,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:20,934 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:20,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 375340621, now seen corresponding path program 1 times [2023-12-25 09:30:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:20,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129620502] [2023-12-25 09:30:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:30:20,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:20,937 INFO L229 MonitoredProcess]: Starting monitored process 72 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:30:20,938 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 (72)] Waiting until timeout for monitored process [2023-12-25 09:30:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:21,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:30:21,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:30:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 39 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:21,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:30:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 39 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:22,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:30:22,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129620502] [2023-12-25 09:30:22,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129620502] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:30:22,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:30:22,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:30:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066634946] [2023-12-25 09:30:22,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:30:22,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:30:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:30:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:30:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:30:22,243 INFO L87 Difference]: Start difference. First operand 21028 states and 23062 transitions. Second operand has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 33 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:30:27,988 INFO L93 Difference]: Finished difference Result 43930 states and 48446 transitions. [2023-12-25 09:30:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-25 09:30:27,988 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 33 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-12-25 09:30:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:30:28,030 INFO L225 Difference]: With dead ends: 43930 [2023-12-25 09:30:28,030 INFO L226 Difference]: Without dead ends: 43121 [2023-12-25 09:30:28,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1336, Invalid=8764, Unknown=0, NotChecked=0, Total=10100 [2023-12-25 09:30:28,044 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 3101 mSDsluCounter, 12499 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3101 SdHoareTripleChecker+Valid, 13098 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:30:28,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3101 Valid, 13098 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 09:30:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43121 states. [2023-12-25 09:30:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43121 to 21068. [2023-12-25 09:30:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21068 states, 21067 states have (on average 1.0965965728390374) internal successors, (23102), 21067 states have internal predecessors, (23102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21068 states to 21068 states and 23102 transitions. [2023-12-25 09:30:28,273 INFO L78 Accepts]: Start accepts. Automaton has 21068 states and 23102 transitions. Word has length 154 [2023-12-25 09:30:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:28,273 INFO L495 AbstractCegarLoop]: Abstraction has 21068 states and 23102 transitions. [2023-12-25 09:30:28,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.636363636363637) internal successors, (285), 33 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21068 states and 23102 transitions. [2023-12-25 09:30:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 09:30:28,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:28,278 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,285 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 (72)] Forceful destruction successful, exit code 0 [2023-12-25 09:30:28,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:28,481 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:28,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1041116500, now seen corresponding path program 1 times [2023-12-25 09:30:28,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723010173] [2023-12-25 09:30:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:28,482 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:30:28,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:28,483 INFO L229 MonitoredProcess]: Starting monitored process 73 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:30:28,516 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 (73)] Waiting until timeout for monitored process [2023-12-25 09:30:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:28,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:30:28,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:30:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:29,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:30:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:29,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:30:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723010173] [2023-12-25 09:30:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723010173] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:30:29,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:30:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:30:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819929697] [2023-12-25 09:30:29,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:30:29,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:30:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:30:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:30:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:30:29,857 INFO L87 Difference]: Start difference. First operand 21068 states and 23102 transitions. Second operand has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 33 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:30:34,428 INFO L93 Difference]: Finished difference Result 35610 states and 39428 transitions. [2023-12-25 09:30:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-25 09:30:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 33 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-12-25 09:30:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:30:34,460 INFO L225 Difference]: With dead ends: 35610 [2023-12-25 09:30:34,460 INFO L226 Difference]: Without dead ends: 35102 [2023-12-25 09:30:34,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1223, Invalid=7149, Unknown=0, NotChecked=0, Total=8372 [2023-12-25 09:30:34,475 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 3157 mSDsluCounter, 8120 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3157 SdHoareTripleChecker+Valid, 8641 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:30:34,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3157 Valid, 8641 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 09:30:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35102 states. [2023-12-25 09:30:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35102 to 21029. [2023-12-25 09:30:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21029 states, 21028 states have (on average 1.0967281719611945) internal successors, (23062), 21028 states have internal predecessors, (23062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21029 states to 21029 states and 23062 transitions. [2023-12-25 09:30:34,690 INFO L78 Accepts]: Start accepts. Automaton has 21029 states and 23062 transitions. Word has length 154 [2023-12-25 09:30:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:34,690 INFO L495 AbstractCegarLoop]: Abstraction has 21029 states and 23062 transitions. [2023-12-25 09:30:34,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 33 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21029 states and 23062 transitions. [2023-12-25 09:30:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 09:30:34,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:34,695 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:34,700 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 (73)] Forceful destruction successful, exit code 0 [2023-12-25 09:30:34,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:34,898 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:34,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1275907366, now seen corresponding path program 1 times [2023-12-25 09:30:34,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:34,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553993849] [2023-12-25 09:30:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:34,899 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:30:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:34,900 INFO L229 MonitoredProcess]: Starting monitored process 74 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:30:34,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (74)] Waiting until timeout for monitored process [2023-12-25 09:30:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:35,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:30:35,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:30:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:35,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:30:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:36,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:30:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553993849] [2023-12-25 09:30:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553993849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:30:36,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:30:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:30:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937368226] [2023-12-25 09:30:36,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:30:36,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:30:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:30:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:30:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:30:36,071 INFO L87 Difference]: Start difference. First operand 21029 states and 23062 transitions. Second operand has 33 states, 33 states have (on average 8.727272727272727) internal successors, (288), 33 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:30:42,880 INFO L93 Difference]: Finished difference Result 44419 states and 48703 transitions. [2023-12-25 09:30:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-25 09:30:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.727272727272727) internal successors, (288), 33 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-12-25 09:30:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:30:42,922 INFO L225 Difference]: With dead ends: 44419 [2023-12-25 09:30:42,922 INFO L226 Difference]: Without dead ends: 42630 [2023-12-25 09:30:42,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1662, Invalid=8438, Unknown=0, NotChecked=0, Total=10100 [2023-12-25 09:30:42,933 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 3639 mSDsluCounter, 11830 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3639 SdHoareTripleChecker+Valid, 12487 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:30:42,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3639 Valid, 12487 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:30:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42630 states. [2023-12-25 09:30:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42630 to 19393. [2023-12-25 09:30:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19393 states, 19392 states have (on average 1.0985973597359735) internal successors, (21304), 19392 states have internal predecessors, (21304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19393 states to 19393 states and 21304 transitions. [2023-12-25 09:30:43,187 INFO L78 Accepts]: Start accepts. Automaton has 19393 states and 21304 transitions. Word has length 154 [2023-12-25 09:30:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:43,188 INFO L495 AbstractCegarLoop]: Abstraction has 19393 states and 21304 transitions. [2023-12-25 09:30:43,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.727272727272727) internal successors, (288), 33 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 19393 states and 21304 transitions. [2023-12-25 09:30:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 09:30:43,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:43,193 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:43,198 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 (74)] Forceful destruction successful, exit code 0 [2023-12-25 09:30:43,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:43,396 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:43,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -278983963, now seen corresponding path program 1 times [2023-12-25 09:30:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:43,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301523689] [2023-12-25 09:30:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:43,397 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:30:43,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:43,411 INFO L229 MonitoredProcess]: Starting monitored process 75 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:30:43,444 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 (75)] Waiting until timeout for monitored process [2023-12-25 09:30:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:43,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:30:43,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:30:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 52 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:30:44,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:30:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 52 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:30:45,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:30:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301523689] [2023-12-25 09:30:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301523689] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:30:45,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:30:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-25 09:30:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098126321] [2023-12-25 09:30:45,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:30:45,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 09:30:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:30:45,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 09:30:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:30:45,207 INFO L87 Difference]: Start difference. First operand 19393 states and 21304 transitions. Second operand has 29 states, 29 states have (on average 9.586206896551724) internal successors, (278), 29 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:30:50,560 INFO L93 Difference]: Finished difference Result 30991 states and 34146 transitions. [2023-12-25 09:30:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-25 09:30:50,561 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.586206896551724) internal successors, (278), 29 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2023-12-25 09:30:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:30:50,588 INFO L225 Difference]: With dead ends: 30991 [2023-12-25 09:30:50,588 INFO L226 Difference]: Without dead ends: 28614 [2023-12-25 09:30:50,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1055, Invalid=5265, Unknown=0, NotChecked=0, Total=6320 [2023-12-25 09:30:50,595 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 3275 mSDsluCounter, 6149 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3275 SdHoareTripleChecker+Valid, 6614 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:30:50,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3275 Valid, 6614 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 09:30:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28614 states. [2023-12-25 09:30:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28614 to 21110. [2023-12-25 09:30:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21110 states, 21109 states have (on average 1.0997678715239945) internal successors, (23215), 21109 states have internal predecessors, (23215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21110 states to 21110 states and 23215 transitions. [2023-12-25 09:30:50,793 INFO L78 Accepts]: Start accepts. Automaton has 21110 states and 23215 transitions. Word has length 158 [2023-12-25 09:30:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:50,793 INFO L495 AbstractCegarLoop]: Abstraction has 21110 states and 23215 transitions. [2023-12-25 09:30:50,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.586206896551724) internal successors, (278), 29 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 21110 states and 23215 transitions. [2023-12-25 09:30:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 09:30:50,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:50,798 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,804 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 (75)] Forceful destruction successful, exit code 0 [2023-12-25 09:30:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:51,002 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:51,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1206563979, now seen corresponding path program 1 times [2023-12-25 09:30:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571610050] [2023-12-25 09:30:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:51,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:30:51,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:51,004 INFO L229 MonitoredProcess]: Starting monitored process 76 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:30:51,036 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 (76)] Waiting until timeout for monitored process [2023-12-25 09:30:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:51,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:30:51,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:30:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:51,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:30:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:30:52,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:30:52,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571610050] [2023-12-25 09:30:52,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571610050] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:30:52,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:30:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:30:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389586604] [2023-12-25 09:30:52,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:30:52,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:30:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:30:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:30:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:30:52,400 INFO L87 Difference]: Start difference. First operand 21110 states and 23215 transitions. Second operand has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:58,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:30:58,426 INFO L93 Difference]: Finished difference Result 41748 states and 46000 transitions. [2023-12-25 09:30:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-12-25 09:30:58,426 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2023-12-25 09:30:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:30:58,464 INFO L225 Difference]: With dead ends: 41748 [2023-12-25 09:30:58,464 INFO L226 Difference]: Without dead ends: 39961 [2023-12-25 09:30:58,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3047 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1503, Invalid=10269, Unknown=0, NotChecked=0, Total=11772 [2023-12-25 09:30:58,476 INFO L413 NwaCegarLoop]: 594 mSDtfsCounter, 3185 mSDsluCounter, 11444 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3185 SdHoareTripleChecker+Valid, 12038 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:30:58,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3185 Valid, 12038 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 09:30:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39961 states. [2023-12-25 09:30:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39961 to 23065. [2023-12-25 09:30:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23065 states, 23064 states have (on average 1.0990721470690252) internal successors, (25349), 23064 states have internal predecessors, (25349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23065 states to 23065 states and 25349 transitions. [2023-12-25 09:30:58,714 INFO L78 Accepts]: Start accepts. Automaton has 23065 states and 25349 transitions. Word has length 158 [2023-12-25 09:30:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:30:58,714 INFO L495 AbstractCegarLoop]: Abstraction has 23065 states and 25349 transitions. [2023-12-25 09:30:58,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:30:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23065 states and 25349 transitions. [2023-12-25 09:30:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-25 09:30:58,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:30:58,719 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:58,724 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 (76)] Forceful destruction successful, exit code 0 [2023-12-25 09:30:58,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:30:58,922 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:30:58,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:30:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash -476717359, now seen corresponding path program 1 times [2023-12-25 09:30:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:30:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079048318] [2023-12-25 09:30:58,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:30:58,923 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:30:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:30:58,924 INFO L229 MonitoredProcess]: Starting monitored process 77 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:30:58,927 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 (77)] Waiting until timeout for monitored process [2023-12-25 09:30:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:30:59,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:30:59,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:31:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:31:00,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:31:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 65 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 09:31:00,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:31:00,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079048318] [2023-12-25 09:31:00,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079048318] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:31:00,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:31:00,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:31:00,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646897737] [2023-12-25 09:31:00,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:31:00,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:31:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:31:00,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:31:00,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:31:00,351 INFO L87 Difference]: Start difference. First operand 23065 states and 25349 transitions. Second operand has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:31:09,092 INFO L93 Difference]: Finished difference Result 50670 states and 55941 transitions. [2023-12-25 09:31:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-25 09:31:09,092 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2023-12-25 09:31:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:31:09,137 INFO L225 Difference]: With dead ends: 50670 [2023-12-25 09:31:09,137 INFO L226 Difference]: Without dead ends: 47589 [2023-12-25 09:31:09,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1608, Invalid=6948, Unknown=0, NotChecked=0, Total=8556 [2023-12-25 09:31:09,154 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 4060 mSDsluCounter, 7334 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4060 SdHoareTripleChecker+Valid, 7886 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:31:09,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4060 Valid, 7886 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:31:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47589 states. [2023-12-25 09:31:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47589 to 23085. [2023-12-25 09:31:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23085 states, 23084 states have (on average 1.0989863108646682) internal successors, (25369), 23084 states have internal predecessors, (25369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23085 states to 23085 states and 25369 transitions. [2023-12-25 09:31:09,433 INFO L78 Accepts]: Start accepts. Automaton has 23085 states and 25369 transitions. Word has length 158 [2023-12-25 09:31:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:31:09,433 INFO L495 AbstractCegarLoop]: Abstraction has 23085 states and 25369 transitions. [2023-12-25 09:31:09,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23085 states and 25369 transitions. [2023-12-25 09:31:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 09:31:09,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:31:09,439 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:09,444 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 (77)] Forceful destruction successful, exit code 0 [2023-12-25 09:31:09,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:31:09,642 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:31:09,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:31:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 779340363, now seen corresponding path program 1 times [2023-12-25 09:31:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:31:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594426384] [2023-12-25 09:31:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:31:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:31:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:31:09,644 INFO L229 MonitoredProcess]: Starting monitored process 78 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:31:09,644 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 (78)] Waiting until timeout for monitored process [2023-12-25 09:31:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:31:09,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 09:31:09,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:31:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:31:10,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:31:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:31:10,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:31:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594426384] [2023-12-25 09:31:10,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594426384] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:31:10,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:31:10,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-25 09:31:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456736748] [2023-12-25 09:31:10,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:31:10,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 09:31:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:31:10,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 09:31:10,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:31:10,853 INFO L87 Difference]: Start difference. First operand 23085 states and 25369 transitions. Second operand has 28 states, 28 states have (on average 9.571428571428571) internal successors, (268), 28 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:31:21,933 INFO L93 Difference]: Finished difference Result 65508 states and 72418 transitions. [2023-12-25 09:31:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-25 09:31:21,933 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.571428571428571) internal successors, (268), 28 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-12-25 09:31:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:31:21,990 INFO L225 Difference]: With dead ends: 65508 [2023-12-25 09:31:21,991 INFO L226 Difference]: Without dead ends: 55154 [2023-12-25 09:31:22,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2165, Invalid=9607, Unknown=0, NotChecked=0, Total=11772 [2023-12-25 09:31:22,010 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 3656 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3656 SdHoareTripleChecker+Valid, 8843 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:31:22,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3656 Valid, 8843 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-25 09:31:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55154 states. [2023-12-25 09:31:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55154 to 23338. [2023-12-25 09:31:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23338 states, 23337 states have (on average 1.0985987916184599) internal successors, (25638), 23337 states have internal predecessors, (25638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23338 states to 23338 states and 25638 transitions. [2023-12-25 09:31:22,303 INFO L78 Accepts]: Start accepts. Automaton has 23338 states and 25638 transitions. Word has length 159 [2023-12-25 09:31:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:31:22,303 INFO L495 AbstractCegarLoop]: Abstraction has 23338 states and 25638 transitions. [2023-12-25 09:31:22,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.571428571428571) internal successors, (268), 28 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 23338 states and 25638 transitions. [2023-12-25 09:31:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 09:31:22,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:31:22,307 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-25 09:31:22,312 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 (78)] Forceful destruction successful, exit code 0 [2023-12-25 09:31:22,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:31:22,510 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:31:22,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:31:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash -410110658, now seen corresponding path program 1 times [2023-12-25 09:31:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:31:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118253804] [2023-12-25 09:31:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:31:22,511 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:31:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:31:22,512 INFO L229 MonitoredProcess]: Starting monitored process 79 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:31:22,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (79)] Waiting until timeout for monitored process [2023-12-25 09:31:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:31:22,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:31:22,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:31:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 40 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:31:23,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:31:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 40 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:31:23,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:31:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118253804] [2023-12-25 09:31:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118253804] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:31:23,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:31:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:31:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937556396] [2023-12-25 09:31:23,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:31:23,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:31:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:31:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:31:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:31:23,857 INFO L87 Difference]: Start difference. First operand 23338 states and 25638 transitions. Second operand has 33 states, 33 states have (on average 9.151515151515152) internal successors, (302), 33 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:31:33,014 INFO L93 Difference]: Finished difference Result 44483 states and 49135 transitions. [2023-12-25 09:31:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2023-12-25 09:31:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 9.151515151515152) internal successors, (302), 33 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2023-12-25 09:31:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:31:33,054 INFO L225 Difference]: With dead ends: 44483 [2023-12-25 09:31:33,054 INFO L226 Difference]: Without dead ends: 43575 [2023-12-25 09:31:33,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5319 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2360, Invalid=16272, Unknown=0, NotChecked=0, Total=18632 [2023-12-25 09:31:33,067 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 2574 mSDsluCounter, 12431 mSDsCounter, 0 mSdLazyCounter, 3204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 13171 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-25 09:31:33,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 13171 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3204 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-25 09:31:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43575 states. [2023-12-25 09:31:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43575 to 23432. [2023-12-25 09:31:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23432 states, 23431 states have (on average 1.0983312705390296) internal successors, (25735), 23431 states have internal predecessors, (25735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23432 states to 23432 states and 25735 transitions. [2023-12-25 09:31:33,323 INFO L78 Accepts]: Start accepts. Automaton has 23432 states and 25735 transitions. Word has length 163 [2023-12-25 09:31:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:31:33,323 INFO L495 AbstractCegarLoop]: Abstraction has 23432 states and 25735 transitions. [2023-12-25 09:31:33,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.151515151515152) internal successors, (302), 33 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 23432 states and 25735 transitions. [2023-12-25 09:31:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 09:31:33,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:31:33,328 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:31:33,333 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 (79)] Forceful destruction successful, exit code 0 [2023-12-25 09:31:33,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:31:33,531 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:31:33,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:31:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash -375075548, now seen corresponding path program 1 times [2023-12-25 09:31:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:31:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620539295] [2023-12-25 09:31:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:31:33,532 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:31:33,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:31:33,533 INFO L229 MonitoredProcess]: Starting monitored process 80 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:31:33,533 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 (80)] Waiting until timeout for monitored process [2023-12-25 09:31:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:31:33,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:31:33,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:31:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-25 09:31:34,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:31:34,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:31:34,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620539295] [2023-12-25 09:31:34,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620539295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:31:34,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:31:34,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-25 09:31:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304750383] [2023-12-25 09:31:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:31:34,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 09:31:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:31:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 09:31:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:31:34,612 INFO L87 Difference]: Start difference. First operand 23432 states and 25735 transitions. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:31:37,520 INFO L93 Difference]: Finished difference Result 36112 states and 39965 transitions. [2023-12-25 09:31:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 09:31:37,520 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2023-12-25 09:31:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:31:37,551 INFO L225 Difference]: With dead ends: 36112 [2023-12-25 09:31:37,552 INFO L226 Difference]: Without dead ends: 35176 [2023-12-25 09:31:37,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 09:31:37,562 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 1271 mSDsluCounter, 4996 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:31:37,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 5390 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 09:31:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35176 states. [2023-12-25 09:31:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35176 to 23432. [2023-12-25 09:31:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23432 states, 23431 states have (on average 1.0982885920361913) internal successors, (25734), 23431 states have internal predecessors, (25734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23432 states to 23432 states and 25734 transitions. [2023-12-25 09:31:37,781 INFO L78 Accepts]: Start accepts. Automaton has 23432 states and 25734 transitions. Word has length 163 [2023-12-25 09:31:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:31:37,781 INFO L495 AbstractCegarLoop]: Abstraction has 23432 states and 25734 transitions. [2023-12-25 09:31:37,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23432 states and 25734 transitions. [2023-12-25 09:31:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 09:31:37,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:31:37,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:31:37,791 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 (80)] Forceful destruction successful, exit code 0 [2023-12-25 09:31:37,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:31:37,989 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:31:37,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:31:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1693204463, now seen corresponding path program 1 times [2023-12-25 09:31:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:31:37,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161321205] [2023-12-25 09:31:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:31:37,990 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:31:37,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:31:37,991 INFO L229 MonitoredProcess]: Starting monitored process 81 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:31:37,992 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 (81)] Waiting until timeout for monitored process [2023-12-25 09:31:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:31:38,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:31:38,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:31:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 09:31:39,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:31:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 37 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:31:40,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:31:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161321205] [2023-12-25 09:31:40,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161321205] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:31:40,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:31:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2023-12-25 09:31:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071034241] [2023-12-25 09:31:40,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:31:40,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:31:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:31:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:31:40,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:31:40,330 INFO L87 Difference]: Start difference. First operand 23432 states and 25734 transitions. Second operand has 38 states, 38 states have (on average 7.605263157894737) internal successors, (289), 38 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:31:57,363 INFO L93 Difference]: Finished difference Result 52360 states and 57230 transitions. [2023-12-25 09:31:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2023-12-25 09:31:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.605263157894737) internal successors, (289), 38 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2023-12-25 09:31:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:31:57,406 INFO L225 Difference]: With dead ends: 52360 [2023-12-25 09:31:57,407 INFO L226 Difference]: Without dead ends: 46193 [2023-12-25 09:31:57,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11842 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=5482, Invalid=27460, Unknown=0, NotChecked=0, Total=32942 [2023-12-25 09:31:57,427 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 5371 mSDsluCounter, 11202 mSDsCounter, 0 mSdLazyCounter, 3908 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5371 SdHoareTripleChecker+Valid, 11654 SdHoareTripleChecker+Invalid, 3994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:31:57,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5371 Valid, 11654 Invalid, 3994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 3908 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-25 09:31:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46193 states. [2023-12-25 09:31:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46193 to 25363. [2023-12-25 09:31:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25363 states, 25362 states have (on average 1.0988881003075468) internal successors, (27870), 25362 states have internal predecessors, (27870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25363 states to 25363 states and 27870 transitions. [2023-12-25 09:31:57,721 INFO L78 Accepts]: Start accepts. Automaton has 25363 states and 27870 transitions. Word has length 163 [2023-12-25 09:31:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:31:57,721 INFO L495 AbstractCegarLoop]: Abstraction has 25363 states and 27870 transitions. [2023-12-25 09:31:57,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.605263157894737) internal successors, (289), 38 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:31:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 25363 states and 27870 transitions. [2023-12-25 09:31:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 09:31:57,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:31:57,726 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:31:57,732 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 (81)] Forceful destruction successful, exit code 0 [2023-12-25 09:31:57,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:31:57,930 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:31:57,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:31:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1112798049, now seen corresponding path program 1 times [2023-12-25 09:31:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:31:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880619607] [2023-12-25 09:31:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:31:57,931 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:31:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:31:57,932 INFO L229 MonitoredProcess]: Starting monitored process 82 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:31:57,933 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 (82)] Waiting until timeout for monitored process [2023-12-25 09:31:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:31:58,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:31:58,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:31:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-25 09:31:59,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:32:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:32:00,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:32:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880619607] [2023-12-25 09:32:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880619607] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:32:00,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:32:00,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2023-12-25 09:32:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59922762] [2023-12-25 09:32:00,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:32:00,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-25 09:32:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:32:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-25 09:32:00,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 09:32:00,370 INFO L87 Difference]: Start difference. First operand 25363 states and 27870 transitions. Second operand has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:33:47,893 INFO L93 Difference]: Finished difference Result 132227 states and 147030 transitions. [2023-12-25 09:33:47,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 589 states. [2023-12-25 09:33:47,893 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2023-12-25 09:33:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:33:48,028 INFO L225 Difference]: With dead ends: 132227 [2023-12-25 09:33:48,029 INFO L226 Difference]: Without dead ends: 127266 [2023-12-25 09:33:48,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 622 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180824 ImplicationChecksByTransitivity, 97.9s TimeCoverageRelationStatistics Valid=38541, Invalid=350211, Unknown=0, NotChecked=0, Total=388752 [2023-12-25 09:33:48,063 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 10405 mSDsluCounter, 17352 mSDsCounter, 0 mSdLazyCounter, 7593 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10405 SdHoareTripleChecker+Valid, 18035 SdHoareTripleChecker+Invalid, 7680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 7593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:33:48,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10405 Valid, 18035 Invalid, 7680 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 7593 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-12-25 09:33:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127266 states. [2023-12-25 09:33:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127266 to 29060. [2023-12-25 09:33:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29060 states, 29059 states have (on average 1.0990742971196532) internal successors, (31938), 29059 states have internal predecessors, (31938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29060 states to 29060 states and 31938 transitions. [2023-12-25 09:33:48,810 INFO L78 Accepts]: Start accepts. Automaton has 29060 states and 31938 transitions. Word has length 163 [2023-12-25 09:33:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:33:48,810 INFO L495 AbstractCegarLoop]: Abstraction has 29060 states and 31938 transitions. [2023-12-25 09:33:48,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:33:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 29060 states and 31938 transitions. [2023-12-25 09:33:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-25 09:33:48,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:33:48,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:33:48,819 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 (82)] Forceful destruction successful, exit code 0 [2023-12-25 09:33:49,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:33:49,019 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:33:49,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:33:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2135831776, now seen corresponding path program 1 times [2023-12-25 09:33:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:33:49,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479399466] [2023-12-25 09:33:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:33:49,020 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:33:49,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:33:49,021 INFO L229 MonitoredProcess]: Starting monitored process 83 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:33:49,044 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 (83)] Waiting until timeout for monitored process [2023-12-25 09:33:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:33:49,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 09:33:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:33:49,349 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 09:33:49,349 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 09:33:49,350 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 09:33:49,354 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 (83)] Ended with exit code 0 [2023-12-25 09:33:49,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_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:33:49,558 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,562 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 09:33:49,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 09:33:49 BoogieIcfgContainer [2023-12-25 09:33:49,709 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 09:33:49,711 INFO L158 Benchmark]: Toolchain (without parser) took 849020.33ms. Allocated memory was 179.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 122.8MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-12-25 09:33:49,711 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 09:33:49,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.43ms. Allocated memory is still 179.3MB. Free memory was 122.6MB in the beginning and 148.8MB in the end (delta: -26.3MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2023-12-25 09:33:49,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.96ms. Allocated memory is still 179.3MB. Free memory was 148.4MB in the beginning and 145.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 09:33:49,711 INFO L158 Benchmark]: Boogie Preprocessor took 67.88ms. Allocated memory is still 179.3MB. Free memory was 145.2MB in the beginning and 141.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-25 09:33:49,711 INFO L158 Benchmark]: RCFGBuilder took 659.21ms. Allocated memory is still 179.3MB. Free memory was 141.0MB in the beginning and 97.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2023-12-25 09:33:49,711 INFO L158 Benchmark]: TraceAbstraction took 847831.38ms. Allocated memory was 179.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 95.9MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-12-25 09:33:49,712 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 179.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.43ms. Allocated memory is still 179.3MB. Free memory was 122.6MB in the beginning and 148.8MB in the end (delta: -26.3MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.96ms. Allocated memory is still 179.3MB. Free memory was 148.4MB in the beginning and 145.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.88ms. Allocated memory is still 179.3MB. Free memory was 145.2MB in the beginning and 141.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 659.21ms. Allocated memory is still 179.3MB. Free memory was 141.0MB in the beginning and 97.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 847831.38ms. Allocated memory was 179.3MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 95.9MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. 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: 397]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 = '\x0'; [L27] port_t p1 = 0; [L28] char p1_old = '\x0'; [L29] char p1_new = '\x0'; [L30] char id1 = '\x0'; [L31] char st1 = '\x0'; [L32] msg_t send1 = '\x0'; [L33] _Bool mode1 = 0; [L34] _Bool alive1 = 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] _Bool alive2 = 0; [L43] port_t p3 = 0; [L44] char p3_old = '\x0'; [L45] char p3_new = '\x0'; [L46] char id3 = '\x0'; [L47] char st3 = '\x0'; [L48] msg_t send3 = '\x0'; [L49] _Bool mode3 = 0; [L50] _Bool alive3 = 0; [L54] void (*nodes[3])() = { &node1, &node2, &node3 }; [L58] int __return_6343; [L59] int __return_6421; [L60] int __return_6484; [L61] int __tmp_6512_0; [L62] int __return_6554; [L63] int __tmp_6555_0; [L64] int __return_6568; [L65] int __return_6743; [L68] int main__c1; [L69] int main__i2; [L70] main__c1 = 0 [L71] r1 = __VERIFIER_nondet_char() [L72] id1 = __VERIFIER_nondet_char() [L73] st1 = __VERIFIER_nondet_char() [L74] send1 = __VERIFIER_nondet_char() [L75] mode1 = __VERIFIER_nondet_bool() [L76] alive1 = __VERIFIER_nondet_bool() [L77] id2 = __VERIFIER_nondet_char() [L78] st2 = __VERIFIER_nondet_char() [L79] send2 = __VERIFIER_nondet_char() [L80] mode2 = __VERIFIER_nondet_bool() [L81] alive2 = __VERIFIER_nondet_bool() [L82] id3 = __VERIFIER_nondet_char() [L83] st3 = __VERIFIER_nondet_char() [L84] send3 = __VERIFIER_nondet_char() [L85] mode3 = __VERIFIER_nondet_bool() [L86] alive3 = __VERIFIER_nondet_bool() [L88] int init__tmp; VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L89] COND TRUE ((int)r1) == 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L91] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=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] [L93] COND TRUE ((int)id1) >= 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=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] [L95] COND TRUE ((int)st1) == 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=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] [L97] COND TRUE ((int)send1) == ((int)id1) VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=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] [L99] COND TRUE ((int)mode1) == 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=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] [L101] COND TRUE ((int)id2) >= 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, 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] [L103] COND TRUE ((int)st2) == 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, 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] [L105] COND TRUE ((int)send2) == ((int)id2) VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, 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=0, st1=0, st2=0] [L107] COND TRUE ((int)mode2) == 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=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=0, st1=0, st2=0] [L109] COND TRUE ((int)id3) >= 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=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=0, st1=0, st2=0] [L111] COND TRUE ((int)st3) == 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=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=0, st1=0, st2=0, st3=0] [L113] COND TRUE ((int)send3) == ((int)id3) VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=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=0, send3=32, st1=0, st2=0, st3=0] [L115] COND TRUE ((int)mode3) == 0 VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L117] COND TRUE ((int)id1) != ((int)id2) VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L119] COND TRUE ((int)id1) != ((int)id3) VAL [__return_6343=0, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L121] COND TRUE ((int)id2) != ((int)id3) [L123] init__tmp = 1 [L124] __return_6343 = init__tmp [L125] main__i2 = __return_6343 VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L126] COND TRUE main__i2 != 0 [L128] p1_old = nomsg [L129] p1_new = nomsg [L130] p2_old = nomsg [L131] p2_new = nomsg [L132] p3_old = nomsg [L133] p3_new = nomsg [L134] main__i2 = 0 VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=0, main__i2=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L135] COND TRUE main__i2 < 6 [L138] msg_t node1__m1; [L139] node1__m1 = nomsg VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L140] COND FALSE !(!(mode1 == 0)) VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L146] COND TRUE !(alive1 == 0) [L148] int node1____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L149] COND TRUE send1 != nomsg VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L151] COND TRUE p1_new == nomsg [L153] node1____CPAchecker_TMP_0 = send1 VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L155] p1_new = node1____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=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=0, send3=32, st1=0, st2=0, st3=0] [L157] mode1 = 1 [L159] msg_t node2__m2; [L160] node2__m2 = nomsg VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L161] COND FALSE !(!(mode2 == 0)) VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L167] COND TRUE !(alive2 == 0) [L169] int node2____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L170] COND TRUE send2 != nomsg VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, send3=32, st1=0, st2=0, st3=0] [L172] COND TRUE p2_new == nomsg [L174] node2____CPAchecker_TMP_0 = send2 VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, 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=0, send3=32, st1=0, st2=0, st3=0] [L176] p2_new = node2____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L178] mode2 = 1 [L180] msg_t node3__m3; [L181] node3__m3 = nomsg VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L182] COND FALSE !(!(mode3 == 0)) VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L188] COND FALSE !(!(alive3 == 0)) VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L947] COND FALSE !(((int)send3) != ((int)id3)) VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L199] mode3 = 1 [L200] p1_old = p1_new [L201] p1_new = nomsg [L202] p2_old = p2_new [L203] p2_new = nomsg [L204] p3_old = p3_new [L205] p3_new = nomsg [L207] int check__tmp; VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L208] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6421=0, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L210] COND TRUE ((int)r1) < 3 [L212] check__tmp = 1 [L213] __return_6421 = check__tmp [L214] main__c1 = __return_6421 [L216] _Bool __tmp_1; [L217] __tmp_1 = main__c1 [L218] _Bool assert__arg; [L219] assert__arg = __tmp_1 VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, 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=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L220] COND FALSE !(assert__arg == 0) [L226] int main____CPAchecker_TMP_0 = main__i2; [L227] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L228] COND TRUE main__i2 < 6 [L231] msg_t node1__m1; [L232] node1__m1 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L233] COND TRUE !(mode1 == 0) [L235] r1 = (char)(((int)r1) + 1) [L236] node1__m1 = p3_old [L237] p3_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L238] COND FALSE !(((int)node1__m1) != ((int)nomsg)) VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L247] mode1 = 0 [L249] msg_t node2__m2; [L250] node2__m2 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L251] COND TRUE !(mode2 == 0) [L253] node2__m2 = p1_old [L254] p1_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L255] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L257] COND TRUE !(alive2 == 0) VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L259] COND TRUE ((int)node2__m2) > ((int)id2) [L261] send2 = node2__m2 VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L264] mode2 = 0 [L266] msg_t node3__m3; [L267] node3__m3 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L268] COND TRUE !(mode3 == 0) [L270] node3__m3 = p2_old [L271] p2_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L272] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=32, st1=0, st2=0, st3=0] [L274] COND FALSE !(!(alive3 == 0)) [L840] send3 = node3__m3 VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L281] mode3 = 0 [L282] p1_old = p1_new [L283] p1_new = nomsg [L284] p2_old = p2_new [L285] p2_new = nomsg [L286] p3_old = p3_new [L287] p3_new = nomsg [L289] int check__tmp; VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L290] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6421=1, __return_6484=0, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L292] COND TRUE ((int)r1) < 3 [L294] check__tmp = 1 [L295] __return_6484 = check__tmp [L296] main__c1 = __return_6484 [L298] _Bool __tmp_2; [L299] __tmp_2 = main__c1 [L300] _Bool assert__arg; [L301] assert__arg = __tmp_2 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L302] COND FALSE !(assert__arg == 0) [L308] int main____CPAchecker_TMP_0 = main__i2; [L309] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L310] COND TRUE main__i2 < 6 [L313] msg_t node1__m1; [L314] node1__m1 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L315] COND FALSE !(!(mode1 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L743] COND TRUE !(alive1 == 0) [L745] int node1____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L746] COND TRUE send1 != nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L748] COND TRUE p1_new == nomsg [L750] node1____CPAchecker_TMP_0 = send1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L752] p1_new = node1____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L754] mode1 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=0, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L331] __tmp_6512_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L333] main____CPAchecker_TMP_0 = __tmp_6512_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L337] COND FALSE !(!(mode2 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L656] COND TRUE !(alive2 == 0) [L658] int node2____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L659] COND TRUE send2 != nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L661] COND TRUE p2_new == nomsg [L663] node2____CPAchecker_TMP_0 = send2 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, 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=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L665] p2_new = node2____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L667] mode2 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L355] COND FALSE !(!(mode3 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L570] COND FALSE !(!(alive3 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L598] COND TRUE ((int)send3) != ((int)id3) [L600] int node3____CPAchecker_TMP_1; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L601] COND TRUE send3 != nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L603] COND TRUE p3_new == nomsg [L605] node3____CPAchecker_TMP_1 = send3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L607] p3_new = node3____CPAchecker_TMP_1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L581] mode3 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L378] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L380] COND TRUE ((int)r1) < 3 [L382] check__tmp = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=0, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L385] __return_6554 = check__tmp [L386] main__c1 = __return_6554 [L387] __tmp_6555_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L389] main____CPAchecker_TMP_0 = __tmp_6555_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L395] COND FALSE !(assert__arg == 0) [L402] int main____CPAchecker_TMP_0 = main__i2; [L403] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L404] COND TRUE main__i2 < 6 [L407] msg_t node1__m1; [L408] node1__m1 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=0, r1=1, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L409] COND TRUE !(mode1 == 0) [L411] r1 = (char)(((int)r1) + 1) [L412] node1__m1 = p3_old [L413] p3_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L414] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L416] COND TRUE !(alive1 == 0) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L418] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=64, send2=64, send3=0, st1=0, st2=0, st3=0] [L430] COND FALSE !(((int)node1__m1) == ((int)id1)) [L437] send1 = node1__m1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L423] mode1 = 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=1, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L425] __tmp_6512_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L333] main____CPAchecker_TMP_0 = __tmp_6512_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L337] COND TRUE !(mode2 == 0) [L339] node2__m2 = p1_old [L340] p1_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L341] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L343] COND TRUE !(alive2 == 0) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L345] COND TRUE ((int)node2__m2) > ((int)id2) [L347] send2 = node2__m2 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L350] mode2 = 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L355] COND TRUE !(mode3 == 0) [L357] node3__m3 = p2_old [L358] p2_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L359] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L361] COND FALSE !(!(alive3 == 0)) [L559] send3 = node3__m3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L368] mode3 = 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L378] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L380] COND TRUE ((int)r1) < 3 [L382] check__tmp = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=1, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L385] __return_6554 = check__tmp [L386] main__c1 = __return_6554 [L387] __tmp_6555_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L389] main____CPAchecker_TMP_0 = __tmp_6555_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L395] COND FALSE !(assert__arg == 0) [L402] int main____CPAchecker_TMP_0 = main__i2; [L403] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=0, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L404] COND TRUE main__i2 < 6 [L407] msg_t node1__m1; [L408] node1__m1 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L409] COND FALSE !(!(mode1 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L455] COND TRUE !(alive1 == 0) [L457] int node1____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L458] COND TRUE send1 != nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L460] COND TRUE p1_new == nomsg [L462] node1____CPAchecker_TMP_0 = send1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L464] p1_new = node1____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L466] mode1 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=2, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L425] __tmp_6512_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=2, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=64, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L333] main____CPAchecker_TMP_0 = __tmp_6512_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L337] COND FALSE !(!(mode2 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L656] COND TRUE !(alive2 == 0) [L658] int node2____CPAchecker_TMP_0; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L659] COND TRUE send2 != nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L661] COND TRUE p2_new == nomsg [L663] node2____CPAchecker_TMP_0 = send2 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L665] p2_new = node2____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L667] mode2 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=0, node3__m3=64, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L355] COND FALSE !(!(mode3 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L570] COND FALSE !(!(alive3 == 0)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=0, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L598] COND TRUE ((int)send3) != ((int)id3) [L600] int node3____CPAchecker_TMP_1; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L601] COND TRUE send3 != nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L603] COND TRUE p3_new == nomsg [L605] node3____CPAchecker_TMP_1 = send3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L607] p3_new = node3____CPAchecker_TMP_1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L581] mode3 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L378] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L380] COND TRUE ((int)r1) < 3 [L382] check__tmp = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=2, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L385] __return_6554 = check__tmp [L386] main__c1 = __return_6554 [L387] __tmp_6555_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L389] main____CPAchecker_TMP_0 = __tmp_6555_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L395] COND FALSE !(assert__arg == 0) [L402] int main____CPAchecker_TMP_0 = main__i2; [L403] main__i2 = main__i2 + 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L404] COND TRUE main__i2 < 6 [L407] msg_t node1__m1; [L408] node1__m1 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=64, r1=2, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L409] COND TRUE !(mode1 == 0) [L411] r1 = (char)(((int)r1) + 1) [L412] node1__m1 = p3_old [L413] p3_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L414] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L416] COND TRUE !(alive1 == 0) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L418] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=0, st2=0, st3=0] [L430] COND TRUE ((int)node1__m1) == ((int)id1) [L432] st1 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L423] mode1 = 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=3, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L425] __tmp_6512_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=3, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L333] main____CPAchecker_TMP_0 = __tmp_6512_0 [L335] msg_t node2__m2; [L336] node2__m2 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=-1, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=3, send1=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L337] COND TRUE !(mode2 == 0) [L339] node2__m2 = p1_old [L340] p1_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L341] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L343] COND TRUE !(alive2 == 0) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L345] COND FALSE !(((int)node2__m2) > ((int)id2)) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=0, st3=0] [L632] COND TRUE ((int)node2__m2) == ((int)id2) [L634] st2 = 1 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L350] mode2 = 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L353] msg_t node3__m3; [L354] node3__m3 = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L355] COND TRUE !(mode3 == 0) [L357] node3__m3 = p2_old [L358] p2_old = nomsg VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L359] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L361] COND FALSE !(!(alive3 == 0)) [L559] send3 = node3__m3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L368] mode3 = 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L370] p1_old = p1_new [L371] p1_new = nomsg [L372] p2_old = p2_new [L373] p2_new = nomsg [L374] p3_old = p3_new [L375] p3_new = nomsg [L377] int check__tmp; VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L378] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L539] check__tmp = 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=1, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=3, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L385] __return_6554 = check__tmp [L386] main__c1 = __return_6554 [L387] __tmp_6555_0 = main____CPAchecker_TMP_0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=1, __tmp_6512_0=4, __tmp_6555_0=4, alive1=1, alive2=1, alive3=0, assert__arg=1, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L389] main____CPAchecker_TMP_0 = __tmp_6555_0 [L391] _Bool __tmp_3; [L392] __tmp_3 = main__c1 [L393] _Bool assert__arg; [L394] assert__arg = __tmp_3 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, __tmp_6512_0=4, __tmp_6555_0=4, alive1=1, alive2=1, alive3=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L395] COND TRUE assert__arg == 0 VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, __tmp_6512_0=4, __tmp_6555_0=4, alive1=1, alive2=1, alive3=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] [L397] reach_error() VAL [__return_6343=1, __return_6421=1, __return_6484=1, __return_6554=0, __return_6568=0, __return_6743=0, __return_main=0, __tmp_1=1, __tmp_2=1, __tmp_3=0, __tmp_6512_0=4, __tmp_6555_0=4, alive1=1, alive2=1, alive3=0, assert__arg=0, assert__arg=1, assert__arg=1, check__tmp=0, check__tmp=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=0, main____CPAchecker_TMP_0=4, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=0, node1____CPAchecker_TMP_0=64, node1____CPAchecker_TMP_0=64, node1__m1=-1, node1__m1=-1, node1__m1=-1, node1__m1=64, node2____CPAchecker_TMP_0=0, node2____CPAchecker_TMP_0=64, node2__m2=-1, node2__m2=0, node2__m2=64, node3____CPAchecker_TMP_1=64, node3__m3=-1, node3__m3=0, 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=0, send2=64, send3=64, st1=1, st2=1, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 847.6s, OverallIterations: 82, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 730.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160154 SdHoareTripleChecker+Valid, 114.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160154 mSDsluCounter, 297821 SdHoareTripleChecker+Invalid, 104.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271077 mSDsCounter, 1494 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109634 IncrementalHoareTripleChecker+Invalid, 111128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1494 mSolverCounterUnsat, 26744 mSDtfsCounter, 109634 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16763 GetRequests, 12194 SyntacticMatches, 8 SemanticMatches, 4561 ConstructedPredicates, 0 IntricatePredicates, 14 DeprecatedPredicates, 690409 ImplicationChecksByTransitivity, 607.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81670occurred in iteration=49, InterpolantAutomatonStates: 3846, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.4s AutomataMinimizationTime, 81 MinimizatonAttempts, 1705957 StatesRemovedByMinimization, 81 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 58.7s InterpolantComputationTime, 8850 NumberOfCodeBlocks, 8850 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 13263 ConstructedInterpolants, 4102 QuantifiedInterpolants, 145320 SizeOfPredicates, 483 NumberOfNonLiveVariables, 19273 ConjunctsInSsa, 849 ConjunctsInUnsatCore, 115 InterpolantComputations, 47 PerfectInterpolantSequences, 3407/4933 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 09:33:49,919 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 09:33:49,962 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...