/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:53:20,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:53:20,191 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:53:20,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:53:20,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:53:20,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:53:20,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:53:20,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:53:20,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:53:20,232 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:53:20,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:53:20,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:53:20,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:53:20,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:53:20,233 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:53:20,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:53:20,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:53:20,234 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:53:20,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:53:20,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:53:20,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:53:20,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:53:20,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:53:20,235 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:53:20,235 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:53:20,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:53:20,236 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:53:20,236 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:53:20,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:53:20,236 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:53:20,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:53:20,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:53:20,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:53:20,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:53:20,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:53:20,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:53:20,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:53:20,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:53:20,238 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:53:20,238 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:53:20,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:53:20,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:53:20,239 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:53:20,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:53:20,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:53:20,240 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:53:20,240 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:53:20,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:53:20,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:53:20,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:53:20,405 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:53:20,405 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:53:20,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:53:21,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:53:21,805 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:53:21,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:53:21,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b4aa103/5085904c3237476dba16944d39f11b81/FLAG1df5b30b9 [2023-12-25 09:53:21,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b4aa103/5085904c3237476dba16944d39f11b81 [2023-12-25 09:53:21,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:53:21,833 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:53:21,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:53:21,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:53:21,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:53:21,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:53:21" (1/1) ... [2023-12-25 09:53:21,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f55f737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:21, skipping insertion in model container [2023-12-25 09:53:21,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:53:21" (1/1) ... [2023-12-25 09:53:21,881 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:53:22,061 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2023-12-25 09:53:22,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:53:22,097 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:53:22,134 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2023-12-25 09:53:22,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:53:22,154 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:53:22,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22 WrapperNode [2023-12-25 09:53:22,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:53:22,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:53:22,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:53:22,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:53:22,160 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:53:22" (1/1) ... [2023-12-25 09:53:22,167 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:53:22" (1/1) ... [2023-12-25 09:53:22,189 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 283 [2023-12-25 09:53:22,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:53:22,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:53:22,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:53:22,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:53:22,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,212 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:53:22,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:53:22,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:53:22,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:53:22,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:53:22,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (1/1) ... [2023-12-25 09:53:22,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:53:22,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:53:22,299 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:53:22,301 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:53:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:53:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:53:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:53:22,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:53:22,429 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:53:22,431 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:53:22,758 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:53:22,779 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:53:22,780 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:53:22,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:53:22 BoogieIcfgContainer [2023-12-25 09:53:22,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:53:22,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:53:22,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:53:22,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:53:22,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:53:21" (1/3) ... [2023-12-25 09:53:22,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192509e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:53:22, skipping insertion in model container [2023-12-25 09:53:22,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:53:22" (2/3) ... [2023-12-25 09:53:22,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192509e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:53:22, skipping insertion in model container [2023-12-25 09:53:22,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:53:22" (3/3) ... [2023-12-25 09:53:22,787 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:53:22,799 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:53:22,799 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 09:53:22,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:53:22,844 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;@4547bea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:53:22,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 09:53:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 59 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:53:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 09:53:22,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:22,865 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] [2023-12-25 09:53:22,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:22,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1846233322, now seen corresponding path program 1 times [2023-12-25 09:53:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:22,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256746715] [2023-12-25 09:53:22,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:53:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:22,890 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:53:22,923 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:53:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:22,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:53:23,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:23,077 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:53:23,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:23,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256746715] [2023-12-25 09:53:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256746715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:23,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:53:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750562691] [2023-12-25 09:53:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:23,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:53:23,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:53:23,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:53:23,115 INFO L87 Difference]: Start difference. First operand has 60 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 59 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) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:23,168 INFO L93 Difference]: Finished difference Result 136 states and 220 transitions. [2023-12-25 09:53:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:53:23,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-12-25 09:53:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:23,177 INFO L225 Difference]: With dead ends: 136 [2023-12-25 09:53:23,177 INFO L226 Difference]: Without dead ends: 90 [2023-12-25 09:53:23,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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:53:23,182 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 67 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:23,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 207 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-25 09:53:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2023-12-25 09:53:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 87 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 129 transitions. [2023-12-25 09:53:23,217 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 129 transitions. Word has length 35 [2023-12-25 09:53:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:23,217 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 129 transitions. [2023-12-25 09:53:23,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 129 transitions. [2023-12-25 09:53:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 09:53:23,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:23,219 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] [2023-12-25 09:53:23,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 09:53:23,421 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:53:23,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:23,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash 955971599, now seen corresponding path program 1 times [2023-12-25 09:53:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:23,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126367004] [2023-12-25 09:53:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:23,424 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:53:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:23,425 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:53:23,429 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:53:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:23,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:53:23,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:23,556 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:53:23,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:23,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:23,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126367004] [2023-12-25 09:53:23,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126367004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:23,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:53:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496748414] [2023-12-25 09:53:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:23,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:53:23,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:53:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:53:23,563 INFO L87 Difference]: Start difference. First operand 88 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:23,590 INFO L93 Difference]: Finished difference Result 212 states and 325 transitions. [2023-12-25 09:53:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:53:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-12-25 09:53:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:23,592 INFO L225 Difference]: With dead ends: 212 [2023-12-25 09:53:23,592 INFO L226 Difference]: Without dead ends: 142 [2023-12-25 09:53:23,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:53:23,593 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:23,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-25 09:53:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2023-12-25 09:53:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.5179856115107915) internal successors, (211), 139 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 211 transitions. [2023-12-25 09:53:23,603 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 211 transitions. Word has length 36 [2023-12-25 09:53:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:23,604 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 211 transitions. [2023-12-25 09:53:23,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 211 transitions. [2023-12-25 09:53:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 09:53:23,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:23,605 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] [2023-12-25 09:53:23,612 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:53:23,807 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:53:23,807 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:23,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1789838468, now seen corresponding path program 1 times [2023-12-25 09:53:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918239648] [2023-12-25 09:53:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:23,809 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:53:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:23,818 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:53:23,819 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:53:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:23,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:53:23,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:24,194 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:53:24,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:24,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918239648] [2023-12-25 09:53:24,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918239648] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:24,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:24,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:53:24,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014306344] [2023-12-25 09:53:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:24,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:53:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:53:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:53:24,206 INFO L87 Difference]: Start difference. First operand 140 states and 211 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:24,269 INFO L93 Difference]: Finished difference Result 262 states and 404 transitions. [2023-12-25 09:53:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:53:24,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-25 09:53:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:24,271 INFO L225 Difference]: With dead ends: 262 [2023-12-25 09:53:24,271 INFO L226 Difference]: Without dead ends: 140 [2023-12-25 09:53:24,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:53:24,272 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:24,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 59 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-25 09:53:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-12-25 09:53:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.5035971223021583) internal successors, (209), 139 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 209 transitions. [2023-12-25 09:53:24,278 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 209 transitions. Word has length 37 [2023-12-25 09:53:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:24,279 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 209 transitions. [2023-12-25 09:53:24,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 209 transitions. [2023-12-25 09:53:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 09:53:24,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:24,280 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] [2023-12-25 09:53:24,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 09:53:24,482 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:53:24,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:24,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1017974815, now seen corresponding path program 1 times [2023-12-25 09:53:24,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:24,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767190632] [2023-12-25 09:53:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:24,483 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:53:24,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:24,488 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:53:24,489 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:53:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:24,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:53:24,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:24,581 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:53:24,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:24,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:24,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767190632] [2023-12-25 09:53:24,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767190632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:24,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:53:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840725986] [2023-12-25 09:53:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:24,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:53:24,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:24,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:53:24,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:53:24,584 INFO L87 Difference]: Start difference. First operand 140 states and 209 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:24,595 INFO L93 Difference]: Finished difference Result 352 states and 539 transitions. [2023-12-25 09:53:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:53:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-25 09:53:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:24,598 INFO L225 Difference]: With dead ends: 352 [2023-12-25 09:53:24,598 INFO L226 Difference]: Without dead ends: 230 [2023-12-25 09:53:24,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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:53:24,603 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:24,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-25 09:53:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2023-12-25 09:53:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.5110132158590308) internal successors, (343), 227 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 343 transitions. [2023-12-25 09:53:24,620 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 343 transitions. Word has length 37 [2023-12-25 09:53:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:24,620 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 343 transitions. [2023-12-25 09:53:24,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 343 transitions. [2023-12-25 09:53:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 09:53:24,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:24,621 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] [2023-12-25 09:53:24,633 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:53:24,823 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:53:24,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:24,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1606641402, now seen corresponding path program 1 times [2023-12-25 09:53:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:24,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344574227] [2023-12-25 09:53:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:24,825 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:53:24,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:24,827 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:53:24,849 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:53:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:24,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:53:24,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:25,051 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:53:25,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:25,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:25,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344574227] [2023-12-25 09:53:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344574227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:53:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428980151] [2023-12-25 09:53:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:25,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:53:25,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:25,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:53:25,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:53:25,053 INFO L87 Difference]: Start difference. First operand 228 states and 343 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:25,112 INFO L93 Difference]: Finished difference Result 1068 states and 1643 transitions. [2023-12-25 09:53:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:53:25,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-25 09:53:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:25,116 INFO L225 Difference]: With dead ends: 1068 [2023-12-25 09:53:25,116 INFO L226 Difference]: Without dead ends: 858 [2023-12-25 09:53:25,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:53:25,117 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 207 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:25,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 277 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-12-25 09:53:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 644. [2023-12-25 09:53:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5038880248833593) internal successors, (967), 643 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 967 transitions. [2023-12-25 09:53:25,129 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 967 transitions. Word has length 38 [2023-12-25 09:53:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:25,129 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 967 transitions. [2023-12-25 09:53:25,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 967 transitions. [2023-12-25 09:53:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 09:53:25,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:25,140 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] [2023-12-25 09:53:25,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-25 09:53:25,343 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:53:25,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:25,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1284016034, now seen corresponding path program 1 times [2023-12-25 09:53:25,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:25,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138653736] [2023-12-25 09:53:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:25,344 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:53:25,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:25,345 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:53:25,349 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:53:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:25,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:53:25,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:25,447 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:53:25,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:25,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138653736] [2023-12-25 09:53:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138653736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:25,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:25,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:53:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142124389] [2023-12-25 09:53:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:25,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:53:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:53:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:53:25,449 INFO L87 Difference]: Start difference. First operand 644 states and 967 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:25,462 INFO L93 Difference]: Finished difference Result 1570 states and 2365 transitions. [2023-12-25 09:53:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:53:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2023-12-25 09:53:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:25,466 INFO L225 Difference]: With dead ends: 1570 [2023-12-25 09:53:25,466 INFO L226 Difference]: Without dead ends: 944 [2023-12-25 09:53:25,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:53:25,467 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:25,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 151 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2023-12-25 09:53:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2023-12-25 09:53:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.4824654622741764) internal successors, (1395), 941 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1395 transitions. [2023-12-25 09:53:25,478 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1395 transitions. Word has length 40 [2023-12-25 09:53:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:25,479 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 1395 transitions. [2023-12-25 09:53:25,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1395 transitions. [2023-12-25 09:53:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 09:53:25,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:25,479 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] [2023-12-25 09:53:25,498 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:53:25,701 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:53:25,701 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:25,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1798964269, now seen corresponding path program 1 times [2023-12-25 09:53:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193867269] [2023-12-25 09:53:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:25,702 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:53:25,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:25,703 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:53:25,712 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:53:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:25,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:53:25,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:25,783 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:53:25,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:25,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193867269] [2023-12-25 09:53:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193867269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:25,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:53:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042363448] [2023-12-25 09:53:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:25,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:53:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:53:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:53:25,785 INFO L87 Difference]: Start difference. First operand 942 states and 1395 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:25,823 INFO L93 Difference]: Finished difference Result 1764 states and 2595 transitions. [2023-12-25 09:53:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:53:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2023-12-25 09:53:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:25,828 INFO L225 Difference]: With dead ends: 1764 [2023-12-25 09:53:25,828 INFO L226 Difference]: Without dead ends: 1762 [2023-12-25 09:53:25,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:53:25,829 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 108 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:25,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 257 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2023-12-25 09:53:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 998. [2023-12-25 09:53:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.4513540621865597) internal successors, (1447), 997 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1447 transitions. [2023-12-25 09:53:25,844 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1447 transitions. Word has length 41 [2023-12-25 09:53:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:25,844 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1447 transitions. [2023-12-25 09:53:25,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1447 transitions. [2023-12-25 09:53:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 09:53:25,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:25,846 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] [2023-12-25 09:53:25,848 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 (8)] Ended with exit code 0 [2023-12-25 09:53:26,048 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:53:26,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:26,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1444990746, now seen corresponding path program 1 times [2023-12-25 09:53:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993668512] [2023-12-25 09:53:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:26,049 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:53:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:26,050 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:53:26,075 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:53:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:26,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:53:26,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:26,498 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:53:26,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:53:26,716 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:53:26,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993668512] [2023-12-25 09:53:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993668512] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:53:26,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:53:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:53:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062203832] [2023-12-25 09:53:26,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:53:26,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:53:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:53:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:53:26,718 INFO L87 Difference]: Start difference. First operand 998 states and 1447 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:28,292 INFO L93 Difference]: Finished difference Result 3528 states and 5056 transitions. [2023-12-25 09:53:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-25 09:53:28,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-25 09:53:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:28,299 INFO L225 Difference]: With dead ends: 3528 [2023-12-25 09:53:28,299 INFO L226 Difference]: Without dead ends: 2550 [2023-12-25 09:53:28,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 09:53:28,301 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1572 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:28,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 542 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 09:53:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2023-12-25 09:53:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 998. [2023-12-25 09:53:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.4272818455366099) internal successors, (1423), 997 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1423 transitions. [2023-12-25 09:53:28,320 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1423 transitions. Word has length 59 [2023-12-25 09:53:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:28,320 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1423 transitions. [2023-12-25 09:53:28,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1423 transitions. [2023-12-25 09:53:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 09:53:28,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:28,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] [2023-12-25 09:53:28,327 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 (9)] Ended with exit code 0 [2023-12-25 09:53:28,523 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:53:28,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:28,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:28,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1148945318, now seen corresponding path program 1 times [2023-12-25 09:53:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:28,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899359175] [2023-12-25 09:53:28,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:28,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:53:28,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:28,526 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:53:28,546 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:53:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:28,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:53:28,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:29,041 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:53:29,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:53:29,181 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:53:29,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:29,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899359175] [2023-12-25 09:53:29,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899359175] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:53:29,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:53:29,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:53:29,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90736227] [2023-12-25 09:53:29,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:53:29,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:53:29,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:53:29,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:53:29,183 INFO L87 Difference]: Start difference. First operand 998 states and 1423 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:33,073 INFO L93 Difference]: Finished difference Result 7877 states and 11061 transitions. [2023-12-25 09:53:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-12-25 09:53:33,073 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 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 59 [2023-12-25 09:53:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:33,093 INFO L225 Difference]: With dead ends: 7877 [2023-12-25 09:53:33,094 INFO L226 Difference]: Without dead ends: 6899 [2023-12-25 09:53:33,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3686 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2242, Invalid=7858, Unknown=0, NotChecked=0, Total=10100 [2023-12-25 09:53:33,101 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 2622 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:33,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 803 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 09:53:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6899 states. [2023-12-25 09:53:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6899 to 1748. [2023-12-25 09:53:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.40870062965083) internal successors, (2461), 1747 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2461 transitions. [2023-12-25 09:53:33,175 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2461 transitions. Word has length 59 [2023-12-25 09:53:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:33,176 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2461 transitions. [2023-12-25 09:53:33,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2461 transitions. [2023-12-25 09:53:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:53:33,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:33,178 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] [2023-12-25 09:53:33,181 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:53:33,380 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:53:33,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:33,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1884008615, now seen corresponding path program 1 times [2023-12-25 09:53:33,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025844251] [2023-12-25 09:53:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:33,383 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:53:33,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:33,384 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:53:33,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 09:53:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:33,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:53:33,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:53:33,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:33,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025844251] [2023-12-25 09:53:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025844251] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:33,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:53:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780851782] [2023-12-25 09:53:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:33,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:53:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:53:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:53:33,472 INFO L87 Difference]: Start difference. First operand 1748 states and 2461 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:33,486 INFO L93 Difference]: Finished difference Result 3157 states and 4472 transitions. [2023-12-25 09:53:33,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:53:33,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2023-12-25 09:53:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:33,489 INFO L225 Difference]: With dead ends: 3157 [2023-12-25 09:53:33,490 INFO L226 Difference]: Without dead ends: 1429 [2023-12-25 09:53:33,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:53:33,491 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:33,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2023-12-25 09:53:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1423. [2023-12-25 09:53:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1422 states have (on average 1.4071729957805907) internal successors, (2001), 1422 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2001 transitions. [2023-12-25 09:53:33,514 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2001 transitions. Word has length 60 [2023-12-25 09:53:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:33,514 INFO L495 AbstractCegarLoop]: Abstraction has 1423 states and 2001 transitions. [2023-12-25 09:53:33,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2001 transitions. [2023-12-25 09:53:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:53:33,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:33,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] [2023-12-25 09:53:33,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 09:53:33,718 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:53:33,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:33,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1104441433, now seen corresponding path program 1 times [2023-12-25 09:53:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:33,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42808234] [2023-12-25 09:53:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:33,719 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:53:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:33,720 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:53:33,722 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:53:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:33,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:53:33,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:53:34,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:53:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:53:34,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42808234] [2023-12-25 09:53:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42808234] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:53:34,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:53:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:53:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180892973] [2023-12-25 09:53:34,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:53:34,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:53:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:53:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:53:34,397 INFO L87 Difference]: Start difference. First operand 1423 states and 2001 transitions. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 15 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:37,000 INFO L93 Difference]: Finished difference Result 6567 states and 9116 transitions. [2023-12-25 09:53:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-25 09:53:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 15 states have internal predecessors, (114), 0 states have call successors, (0), 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 60 [2023-12-25 09:53:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:37,044 INFO L225 Difference]: With dead ends: 6567 [2023-12-25 09:53:37,044 INFO L226 Difference]: Without dead ends: 5185 [2023-12-25 09:53:37,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1207, Invalid=3485, Unknown=0, NotChecked=0, Total=4692 [2023-12-25 09:53:37,048 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1228 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:37,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 513 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 09:53:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2023-12-25 09:53:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 1507. [2023-12-25 09:53:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 1.3924302788844622) internal successors, (2097), 1506 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2097 transitions. [2023-12-25 09:53:37,095 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2097 transitions. Word has length 60 [2023-12-25 09:53:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:37,095 INFO L495 AbstractCegarLoop]: Abstraction has 1507 states and 2097 transitions. [2023-12-25 09:53:37,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 15 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2097 transitions. [2023-12-25 09:53:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:53:37,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:37,096 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] [2023-12-25 09:53:37,116 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:53:37,316 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:53:37,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:37,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -521987599, now seen corresponding path program 1 times [2023-12-25 09:53:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:37,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027172319] [2023-12-25 09:53:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:37,318 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:53:37,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:37,319 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:53:37,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 09:53:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:37,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:53:37,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:53:37,423 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:37,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027172319] [2023-12-25 09:53:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027172319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:37,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:37,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:53:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096345178] [2023-12-25 09:53:37,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:37,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:53:37,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:37,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:53:37,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:53:37,424 INFO L87 Difference]: Start difference. First operand 1507 states and 2097 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:37,435 INFO L93 Difference]: Finished difference Result 2225 states and 3101 transitions. [2023-12-25 09:53:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:53:37,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2023-12-25 09:53:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:37,440 INFO L225 Difference]: With dead ends: 2225 [2023-12-25 09:53:37,440 INFO L226 Difference]: Without dead ends: 759 [2023-12-25 09:53:37,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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:53:37,443 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:37,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-12-25 09:53:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2023-12-25 09:53:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 756 states have (on average 1.3531746031746033) internal successors, (1023), 756 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1023 transitions. [2023-12-25 09:53:37,453 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1023 transitions. Word has length 61 [2023-12-25 09:53:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:37,453 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 1023 transitions. [2023-12-25 09:53:37,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1023 transitions. [2023-12-25 09:53:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:53:37,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:37,454 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] [2023-12-25 09:53:37,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 09:53:37,656 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:53:37,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:37,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash -674974322, now seen corresponding path program 1 times [2023-12-25 09:53:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619237735] [2023-12-25 09:53:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:37,659 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:53:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:37,660 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:53:37,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 (14)] Waiting until timeout for monitored process [2023-12-25 09:53:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:37,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:53:37,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:53:37,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:37,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619237735] [2023-12-25 09:53:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619237735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:37,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:37,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:53:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943622617] [2023-12-25 09:53:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:53:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:53:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:53:37,898 INFO L87 Difference]: Start difference. First operand 757 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:37,938 INFO L93 Difference]: Finished difference Result 1717 states and 2339 transitions. [2023-12-25 09:53:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:53:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 61 [2023-12-25 09:53:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:37,942 INFO L225 Difference]: With dead ends: 1717 [2023-12-25 09:53:37,942 INFO L226 Difference]: Without dead ends: 1477 [2023-12-25 09:53:37,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:53:37,943 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 162 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:37,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 306 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2023-12-25 09:53:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1233. [2023-12-25 09:53:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 1.333603896103896) internal successors, (1643), 1232 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1643 transitions. [2023-12-25 09:53:37,955 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1643 transitions. Word has length 61 [2023-12-25 09:53:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:37,955 INFO L495 AbstractCegarLoop]: Abstraction has 1233 states and 1643 transitions. [2023-12-25 09:53:37,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1643 transitions. [2023-12-25 09:53:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:53:37,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:37,956 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] [2023-12-25 09:53:37,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-25 09:53:38,158 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:53:38,158 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:38,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1953828495, now seen corresponding path program 1 times [2023-12-25 09:53:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954312126] [2023-12-25 09:53:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:38,159 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:53:38,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:38,160 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:53:38,187 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:53:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:38,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:53:38,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:53:38,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:38,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:38,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954312126] [2023-12-25 09:53:38,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954312126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:38,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:38,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:53:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494078885] [2023-12-25 09:53:38,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:38,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:53:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:53:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:53:38,368 INFO L87 Difference]: Start difference. First operand 1233 states and 1643 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:38,419 INFO L93 Difference]: Finished difference Result 1955 states and 2649 transitions. [2023-12-25 09:53:38,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:53:38,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 61 [2023-12-25 09:53:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:38,422 INFO L225 Difference]: With dead ends: 1955 [2023-12-25 09:53:38,422 INFO L226 Difference]: Without dead ends: 1239 [2023-12-25 09:53:38,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:53:38,424 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 140 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:38,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 340 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2023-12-25 09:53:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 995. [2023-12-25 09:53:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.3169014084507042) internal successors, (1309), 994 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1309 transitions. [2023-12-25 09:53:38,437 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1309 transitions. Word has length 61 [2023-12-25 09:53:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:38,437 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1309 transitions. [2023-12-25 09:53:38,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1309 transitions. [2023-12-25 09:53:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:53:38,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:38,438 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] [2023-12-25 09:53:38,454 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:53:38,640 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:53:38,640 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:38,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:38,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1987117807, now seen corresponding path program 1 times [2023-12-25 09:53:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:38,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565694625] [2023-12-25 09:53:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:38,641 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:53:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:38,642 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:53:38,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 (16)] Waiting until timeout for monitored process [2023-12-25 09:53:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:38,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:53:38,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 09:53:38,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:53:38,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565694625] [2023-12-25 09:53:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565694625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:53:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:53:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:53:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419610630] [2023-12-25 09:53:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:53:38,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:53:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:53:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:53:38,931 INFO L87 Difference]: Start difference. First operand 995 states and 1309 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:53:38,973 INFO L93 Difference]: Finished difference Result 1717 states and 2315 transitions. [2023-12-25 09:53:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:53:38,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 61 [2023-12-25 09:53:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:53:38,977 INFO L225 Difference]: With dead ends: 1717 [2023-12-25 09:53:38,977 INFO L226 Difference]: Without dead ends: 1477 [2023-12-25 09:53:38,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:53:38,978 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:53:38,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 370 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:53:38,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2023-12-25 09:53:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1233. [2023-12-25 09:53:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 1.3141233766233766) internal successors, (1619), 1232 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1619 transitions. [2023-12-25 09:53:39,009 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1619 transitions. Word has length 61 [2023-12-25 09:53:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:53:39,010 INFO L495 AbstractCegarLoop]: Abstraction has 1233 states and 1619 transitions. [2023-12-25 09:53:39,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:53:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1619 transitions. [2023-12-25 09:53:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:53:39,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:53:39,011 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] [2023-12-25 09:53:39,022 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:53:39,213 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:53:39,213 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:53:39,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:53:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1817929289, now seen corresponding path program 1 times [2023-12-25 09:53:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:53:39,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35281974] [2023-12-25 09:53:39,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:53:39,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:53:39,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:53:39,215 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:53:39,217 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:53:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:53:39,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:53:39,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:53:40,638 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:53:40,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:53:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:53:41,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:53:41,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35281974] [2023-12-25 09:53:41,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35281974] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:53:41,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:53:41,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2023-12-25 09:53:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157171995] [2023-12-25 09:53:41,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:53:41,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 09:53:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:53:41,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 09:53:41,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 09:53:41,556 INFO L87 Difference]: Start difference. First operand 1233 states and 1619 transitions. Second operand has 39 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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:54:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:54:20,795 INFO L93 Difference]: Finished difference Result 17887 states and 23328 transitions. [2023-12-25 09:54:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 341 states. [2023-12-25 09:54:20,802 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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 62 [2023-12-25 09:54:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:54:20,834 INFO L225 Difference]: With dead ends: 17887 [2023-12-25 09:54:20,835 INFO L226 Difference]: Without dead ends: 16933 [2023-12-25 09:54:20,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59964 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=17862, Invalid=117930, Unknown=0, NotChecked=0, Total=135792 [2023-12-25 09:54:20,850 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 5659 mSDsluCounter, 4902 mSDsCounter, 0 mSdLazyCounter, 3993 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5659 SdHoareTripleChecker+Valid, 5145 SdHoareTripleChecker+Invalid, 4141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 3993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:54:20,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5659 Valid, 5145 Invalid, 4141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 3993 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-25 09:54:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16933 states. [2023-12-25 09:54:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16933 to 3873. [2023-12-25 09:54:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3873 states, 3872 states have (on average 1.3153409090909092) internal successors, (5093), 3872 states have internal predecessors, (5093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 5093 transitions. [2023-12-25 09:54:21,047 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 5093 transitions. Word has length 62 [2023-12-25 09:54:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:54:21,047 INFO L495 AbstractCegarLoop]: Abstraction has 3873 states and 5093 transitions. [2023-12-25 09:54:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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:54:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 5093 transitions. [2023-12-25 09:54:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:54:21,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:54:21,049 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] [2023-12-25 09:54:21,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 09:54:21,253 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:54:21,253 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:54:21,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:54:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1906053642, now seen corresponding path program 1 times [2023-12-25 09:54:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:54:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023276443] [2023-12-25 09:54:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:54:21,254 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:54:21,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:54:21,274 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:54:21,317 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:54:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:54:21,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:54:21,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:54:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:54:21,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:54:21,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:54:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023276443] [2023-12-25 09:54:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023276443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:54:21,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:54:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:54:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060076581] [2023-12-25 09:54:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:54:21,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:54:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:54:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:54:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:54:21,365 INFO L87 Difference]: Start difference. First operand 3873 states and 5093 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:54:21,404 INFO L93 Difference]: Finished difference Result 7320 states and 9658 transitions. [2023-12-25 09:54:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:54:21,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:54:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:54:21,410 INFO L225 Difference]: With dead ends: 7320 [2023-12-25 09:54:21,410 INFO L226 Difference]: Without dead ends: 3589 [2023-12-25 09:54:21,414 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:54:21,415 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 48 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:54:21,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 87 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:54:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2023-12-25 09:54:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3589. [2023-12-25 09:54:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 1.3007246376811594) internal successors, (4667), 3588 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 4667 transitions. [2023-12-25 09:54:21,459 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 4667 transitions. Word has length 63 [2023-12-25 09:54:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:54:21,459 INFO L495 AbstractCegarLoop]: Abstraction has 3589 states and 4667 transitions. [2023-12-25 09:54:21,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 4667 transitions. [2023-12-25 09:54:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:54:21,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:54:21,460 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] [2023-12-25 09:54:21,482 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 (18)] Ended with exit code 0 [2023-12-25 09:54:21,663 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:54:21,664 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:54:21,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:54:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1626121975, now seen corresponding path program 1 times [2023-12-25 09:54:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:54:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989771607] [2023-12-25 09:54:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:54:21,665 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:54:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:54:21,666 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:54:21,680 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:54:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:54:21,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:54:21,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:54:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 09:54:21,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:54:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 09:54:21,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:54:21,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989771607] [2023-12-25 09:54:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989771607] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:54:21,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:54:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 09:54:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004906140] [2023-12-25 09:54:21,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:54:21,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:54:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:54:21,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:54:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:54:21,870 INFO L87 Difference]: Start difference. First operand 3589 states and 4667 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:54:21,910 INFO L93 Difference]: Finished difference Result 10513 states and 13625 transitions. [2023-12-25 09:54:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:54:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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:54:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:54:21,919 INFO L225 Difference]: With dead ends: 10513 [2023-12-25 09:54:21,919 INFO L226 Difference]: Without dead ends: 7226 [2023-12-25 09:54:21,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:54:21,924 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 136 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:54:21,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 297 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:54:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7226 states. [2023-12-25 09:54:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7226 to 6972. [2023-12-25 09:54:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6972 states, 6971 states have (on average 1.2613685267536938) internal successors, (8793), 6971 states have internal predecessors, (8793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6972 states to 6972 states and 8793 transitions. [2023-12-25 09:54:22,024 INFO L78 Accepts]: Start accepts. Automaton has 6972 states and 8793 transitions. Word has length 63 [2023-12-25 09:54:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:54:22,024 INFO L495 AbstractCegarLoop]: Abstraction has 6972 states and 8793 transitions. [2023-12-25 09:54:22,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6972 states and 8793 transitions. [2023-12-25 09:54:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:54:22,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:54:22,026 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] [2023-12-25 09:54:22,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 09:54:22,229 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:54:22,229 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:54:22,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:54:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 582668533, now seen corresponding path program 1 times [2023-12-25 09:54:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:54:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050004937] [2023-12-25 09:54:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:54:22,230 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:54:22,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:54:22,234 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:54:22,235 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:54:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:54:22,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:54:22,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:54:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:54:22,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:54:22,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:54:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050004937] [2023-12-25 09:54:22,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050004937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:54:22,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:54:22,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:54:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748855180] [2023-12-25 09:54:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:54:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:54:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:54:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:54:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:54:22,310 INFO L87 Difference]: Start difference. First operand 6972 states and 8793 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:54:22,357 INFO L93 Difference]: Finished difference Result 13400 states and 16937 transitions. [2023-12-25 09:54:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:54:22,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:54:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:54:22,367 INFO L225 Difference]: With dead ends: 13400 [2023-12-25 09:54:22,367 INFO L226 Difference]: Without dead ends: 6520 [2023-12-25 09:54:22,373 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:54:22,374 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:54:22,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 70 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:54:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6520 states. [2023-12-25 09:54:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6520 to 6520. [2023-12-25 09:54:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 6519 states have (on average 1.2414480748581072) internal successors, (8093), 6519 states have internal predecessors, (8093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 8093 transitions. [2023-12-25 09:54:22,448 INFO L78 Accepts]: Start accepts. Automaton has 6520 states and 8093 transitions. Word has length 63 [2023-12-25 09:54:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:54:22,448 INFO L495 AbstractCegarLoop]: Abstraction has 6520 states and 8093 transitions. [2023-12-25 09:54:22,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 6520 states and 8093 transitions. [2023-12-25 09:54:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:54:22,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:54:22,449 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] [2023-12-25 09:54:22,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 09:54:22,652 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:54:22,653 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:54:22,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:54:22,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1853768585, now seen corresponding path program 1 times [2023-12-25 09:54:22,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:54:22,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466699551] [2023-12-25 09:54:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:54:22,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:54:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:54:22,655 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:54:22,656 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:54:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:54:22,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:54:22,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:54:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:54:22,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:54:22,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:54:22,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466699551] [2023-12-25 09:54:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466699551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:54:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:54:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:54:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609333780] [2023-12-25 09:54:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:54:22,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:54:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:54:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:54:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:54:22,714 INFO L87 Difference]: Start difference. First operand 6520 states and 8093 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:54:22,754 INFO L93 Difference]: Finished difference Result 10327 states and 12897 transitions. [2023-12-25 09:54:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:54:22,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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:54:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:54:22,759 INFO L225 Difference]: With dead ends: 10327 [2023-12-25 09:54:22,759 INFO L226 Difference]: Without dead ends: 4039 [2023-12-25 09:54:22,764 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:54:22,765 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 46 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:54:22,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 88 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:54:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2023-12-25 09:54:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 4011. [2023-12-25 09:54:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 4010 states have (on average 1.2458852867830423) internal successors, (4996), 4010 states have internal predecessors, (4996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 4996 transitions. [2023-12-25 09:54:22,802 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 4996 transitions. Word has length 63 [2023-12-25 09:54:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:54:22,803 INFO L495 AbstractCegarLoop]: Abstraction has 4011 states and 4996 transitions. [2023-12-25 09:54:22,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 4996 transitions. [2023-12-25 09:54:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:54:22,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:54:22,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:54:22,825 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:54:23,006 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:54:23,006 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:54:23,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:54:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 603868412, now seen corresponding path program 1 times [2023-12-25 09:54:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:54:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823772573] [2023-12-25 09:54:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:54:23,007 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:54:23,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:54:23,008 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:54:23,010 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:54:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:54:23,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:54:23,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:54:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:54:23,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:54:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:54:23,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:54:23,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823772573] [2023-12-25 09:54:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823772573] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:54:23,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:54:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-12-25 09:54:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583686250] [2023-12-25 09:54:23,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:54:23,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:54:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:54:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:54:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:54:23,760 INFO L87 Difference]: Start difference. First operand 4011 states and 4996 transitions. Second operand has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:54:24,215 INFO L93 Difference]: Finished difference Result 6471 states and 8044 transitions. [2023-12-25 09:54:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 09:54:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 0 states have call successors, (0), 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:54:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:54:24,219 INFO L225 Difference]: With dead ends: 6471 [2023-12-25 09:54:24,220 INFO L226 Difference]: Without dead ends: 4855 [2023-12-25 09:54:24,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2023-12-25 09:54:24,223 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 286 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:54:24,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 789 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:54:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2023-12-25 09:54:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 3725. [2023-12-25 09:54:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3725 states, 3724 states have (on average 1.2435553168635876) internal successors, (4631), 3724 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 4631 transitions. [2023-12-25 09:54:24,263 INFO L78 Accepts]: Start accepts. Automaton has 3725 states and 4631 transitions. Word has length 64 [2023-12-25 09:54:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:54:24,263 INFO L495 AbstractCegarLoop]: Abstraction has 3725 states and 4631 transitions. [2023-12-25 09:54:24,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 17 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3725 states and 4631 transitions. [2023-12-25 09:54:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-25 09:54:24,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:54:24,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:54:24,270 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:54:24,468 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:54:24,468 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:54:24,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:54:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1327407628, now seen corresponding path program 1 times [2023-12-25 09:54:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:54:24,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491436134] [2023-12-25 09:54:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:54:24,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:54:24,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:54:24,470 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:54:24,472 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:54:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:54:24,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:54:24,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:54:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 09:54:24,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:54:24,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:54:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491436134] [2023-12-25 09:54:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491436134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:54:24,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:54:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:54:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787979385] [2023-12-25 09:54:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:54:24,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:54:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:54:24,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:54:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:54:24,561 INFO L87 Difference]: Start difference. First operand 3725 states and 4631 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:54:24,575 INFO L93 Difference]: Finished difference Result 5073 states and 6292 transitions. [2023-12-25 09:54:24,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:54:24,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 85 [2023-12-25 09:54:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:54:24,578 INFO L225 Difference]: With dead ends: 5073 [2023-12-25 09:54:24,578 INFO L226 Difference]: Without dead ends: 1542 [2023-12-25 09:54:24,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 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:54:24,582 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:54:24,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:54:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2023-12-25 09:54:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2023-12-25 09:54:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.1936322287199481) internal successors, (1837), 1539 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1837 transitions. [2023-12-25 09:54:24,627 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1837 transitions. Word has length 85 [2023-12-25 09:54:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:54:24,627 INFO L495 AbstractCegarLoop]: Abstraction has 1540 states and 1837 transitions. [2023-12-25 09:54:24,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:54:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1837 transitions. [2023-12-25 09:54:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 09:54:24,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:54:24,628 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, 1, 1, 1, 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:54:24,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-25 09:54:24,831 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:54:24,831 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:54:24,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:54:24,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1673506935, now seen corresponding path program 1 times [2023-12-25 09:54:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:54:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242478941] [2023-12-25 09:54:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:54:24,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:54:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:54:24,833 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:54:24,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 (24)] Waiting until timeout for monitored process [2023-12-25 09:54:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:54:24,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 09:54:24,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:54:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 22 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:54:27,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:54:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 13 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:54:28,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:54:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242478941] [2023-12-25 09:54:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242478941] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:54:28,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:54:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 43 [2023-12-25 09:54:28,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783018496] [2023-12-25 09:54:28,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:54:28,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 09:54:28,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:54:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 09:54:28,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 09:54:28,544 INFO L87 Difference]: Start difference. First operand 1540 states and 1837 transitions. Second operand has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 43 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:55:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:14,905 INFO L93 Difference]: Finished difference Result 8193 states and 9832 transitions. [2023-12-25 09:55:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2023-12-25 09:55:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 43 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 106 [2023-12-25 09:55:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:14,912 INFO L225 Difference]: With dead ends: 8193 [2023-12-25 09:55:14,912 INFO L226 Difference]: Without dead ends: 7142 [2023-12-25 09:55:14,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32864 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=8959, Invalid=72551, Unknown=0, NotChecked=0, Total=81510 [2023-12-25 09:55:14,925 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 3434 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3434 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:14,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3434 Valid, 2569 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-25 09:55:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7142 states. [2023-12-25 09:55:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7142 to 2928. [2023-12-25 09:55:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2927 states have (on average 1.1844892381277758) internal successors, (3467), 2927 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3467 transitions. [2023-12-25 09:55:14,970 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3467 transitions. Word has length 106 [2023-12-25 09:55:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:14,970 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 3467 transitions. [2023-12-25 09:55:14,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 43 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:55:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3467 transitions. [2023-12-25 09:55:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-25 09:55:14,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:14,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:55:14,994 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:55:15,174 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:55:15,174 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:15,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash 654632066, now seen corresponding path program 1 times [2023-12-25 09:55:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914013306] [2023-12-25 09:55:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:15,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:15,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:15,176 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:55:15,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 (25)] Waiting until timeout for monitored process [2023-12-25 09:55:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:15,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:55:15,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:55:15,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:55:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:55:16,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:16,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914013306] [2023-12-25 09:55:16,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914013306] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:55:16,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:55:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:55:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698023519] [2023-12-25 09:55:16,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:55:16,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:55:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:16,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:55:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:55:16,107 INFO L87 Difference]: Start difference. First operand 2928 states and 3467 transitions. Second operand has 18 states, 18 states have (on average 9.333333333333334) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:16,750 INFO L93 Difference]: Finished difference Result 4796 states and 5698 transitions. [2023-12-25 09:55:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 09:55:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.333333333333334) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-25 09:55:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:16,752 INFO L225 Difference]: With dead ends: 4796 [2023-12-25 09:55:16,752 INFO L226 Difference]: Without dead ends: 2141 [2023-12-25 09:55:16,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2023-12-25 09:55:16,754 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 428 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:16,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 363 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:55:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2023-12-25 09:55:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1764. [2023-12-25 09:55:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 1.1673284174702212) internal successors, (2058), 1763 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2058 transitions. [2023-12-25 09:55:16,767 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2058 transitions. Word has length 106 [2023-12-25 09:55:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:16,767 INFO L495 AbstractCegarLoop]: Abstraction has 1764 states and 2058 transitions. [2023-12-25 09:55:16,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.333333333333334) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2058 transitions. [2023-12-25 09:55:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:55:16,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:16,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:55:16,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:16,973 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:55:16,974 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:16,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1678669033, now seen corresponding path program 1 times [2023-12-25 09:55:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127747211] [2023-12-25 09:55:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:16,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:16,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:16,976 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:55:16,984 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:55:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:17,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 09:55:17,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 32 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:19,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:55:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:21,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127747211] [2023-12-25 09:55:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127747211] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:55:21,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:55:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2023-12-25 09:55:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962893200] [2023-12-25 09:55:21,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:55:21,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-25 09:55:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-25 09:55:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2635, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 09:55:21,717 INFO L87 Difference]: Start difference. First operand 1764 states and 2058 transitions. Second operand has 55 states, 55 states have (on average 3.6545454545454548) internal successors, (201), 55 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:22,967 INFO L93 Difference]: Finished difference Result 8699 states and 10276 transitions. [2023-12-25 09:56:22,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2023-12-25 09:56:22,967 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.6545454545454548) internal successors, (201), 55 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-25 09:56:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:22,972 INFO L225 Difference]: With dead ends: 8699 [2023-12-25 09:56:22,972 INFO L226 Difference]: Without dead ends: 7128 [2023-12-25 09:56:22,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30569 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=9486, Invalid=72024, Unknown=0, NotChecked=0, Total=81510 [2023-12-25 09:56:22,978 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 3129 mSDsluCounter, 4520 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3129 SdHoareTripleChecker+Valid, 4667 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:22,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3129 Valid, 4667 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-25 09:56:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2023-12-25 09:56:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 3374. [2023-12-25 09:56:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3374 states, 3373 states have (on average 1.1710643344203973) internal successors, (3950), 3373 states have internal predecessors, (3950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 3950 transitions. [2023-12-25 09:56:23,023 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 3950 transitions. Word has length 107 [2023-12-25 09:56:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:23,024 INFO L495 AbstractCegarLoop]: Abstraction has 3374 states and 3950 transitions. [2023-12-25 09:56:23,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.6545454545454548) internal successors, (201), 55 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 3950 transitions. [2023-12-25 09:56:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-25 09:56:23,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:23,025 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:23,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-12-25 09:56:23,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:23,229 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:23,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash -120926900, now seen corresponding path program 1 times [2023-12-25 09:56:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853171874] [2023-12-25 09:56:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:23,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:23,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:23,230 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:23,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 09:56:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:23,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 09:56:23,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:24,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 37 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:25,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853171874] [2023-12-25 09:56:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853171874] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:25,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:25,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2023-12-25 09:56:25,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840332649] [2023-12-25 09:56:25,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:25,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 09:56:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 09:56:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 09:56:25,447 INFO L87 Difference]: Start difference. First operand 3374 states and 3950 transitions. Second operand has 35 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:33,633 INFO L93 Difference]: Finished difference Result 8780 states and 10282 transitions. [2023-12-25 09:56:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-25 09:56:33,634 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 0 states have call successors, (0), 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:56:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:33,638 INFO L225 Difference]: With dead ends: 8780 [2023-12-25 09:56:33,638 INFO L226 Difference]: Without dead ends: 6224 [2023-12-25 09:56:33,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1216, Invalid=10340, Unknown=0, NotChecked=0, Total=11556 [2023-12-25 09:56:33,642 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 1519 mSDsluCounter, 4426 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 4693 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:33,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 4693 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-25 09:56:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2023-12-25 09:56:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 4771. [2023-12-25 09:56:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4771 states, 4770 states have (on average 1.1649895178197065) internal successors, (5557), 4770 states have internal predecessors, (5557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 5557 transitions. [2023-12-25 09:56:33,684 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 5557 transitions. Word has length 107 [2023-12-25 09:56:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:33,685 INFO L495 AbstractCegarLoop]: Abstraction has 4771 states and 5557 transitions. [2023-12-25 09:56:33,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.542857142857143) internal successors, (194), 35 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 5557 transitions. [2023-12-25 09:56:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 09:56:33,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:33,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:33,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:33,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:33,889 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:33,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 41427085, now seen corresponding path program 1 times [2023-12-25 09:56:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:33,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547862878] [2023-12-25 09:56:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:33,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:33,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:33,891 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:33,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 09:56:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:33,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:56:33,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:34,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:34,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:34,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547862878] [2023-12-25 09:56:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547862878] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:34,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:34,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2023-12-25 09:56:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438028608] [2023-12-25 09:56:34,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:34,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:56:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:34,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:56:34,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:56:34,321 INFO L87 Difference]: Start difference. First operand 4771 states and 5557 transitions. Second operand has 16 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:34,770 INFO L93 Difference]: Finished difference Result 10337 states and 12172 transitions. [2023-12-25 09:56:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 09:56:34,770 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-12-25 09:56:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:34,777 INFO L225 Difference]: With dead ends: 10337 [2023-12-25 09:56:34,777 INFO L226 Difference]: Without dead ends: 8499 [2023-12-25 09:56:34,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:56:34,780 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 407 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:34,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1316 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2023-12-25 09:56:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 6216. [2023-12-25 09:56:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6216 states, 6215 states have (on average 1.1663716814159293) internal successors, (7249), 6215 states have internal predecessors, (7249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 7249 transitions. [2023-12-25 09:56:34,882 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 7249 transitions. Word has length 108 [2023-12-25 09:56:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:34,883 INFO L495 AbstractCegarLoop]: Abstraction has 6216 states and 7249 transitions. [2023-12-25 09:56:34,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 7249 transitions. [2023-12-25 09:56:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-25 09:56:34,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:34,884 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:34,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:35,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:35,087 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:35,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1414696161, now seen corresponding path program 1 times [2023-12-25 09:56:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130200606] [2023-12-25 09:56:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:35,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:35,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:35,089 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:35,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 09:56:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:35,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:56:35,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:56:35,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 68 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:56:35,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:35,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130200606] [2023-12-25 09:56:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130200606] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:35,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:56:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497721555] [2023-12-25 09:56:35,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:35,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:56:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:56:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:56:35,942 INFO L87 Difference]: Start difference. First operand 6216 states and 7249 transitions. Second operand has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 23 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:37,169 INFO L93 Difference]: Finished difference Result 12335 states and 14362 transitions. [2023-12-25 09:56:37,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 09:56:37,169 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 23 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2023-12-25 09:56:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:37,174 INFO L225 Difference]: With dead ends: 12335 [2023-12-25 09:56:37,174 INFO L226 Difference]: Without dead ends: 7377 [2023-12-25 09:56:37,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=365, Invalid=1357, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 09:56:37,179 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 879 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:37,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1365 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:56:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7377 states. [2023-12-25 09:56:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7377 to 5068. [2023-12-25 09:56:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5068 states, 5067 states have (on average 1.1531478192224196) internal successors, (5843), 5067 states have internal predecessors, (5843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 5843 transitions. [2023-12-25 09:56:37,221 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 5843 transitions. Word has length 108 [2023-12-25 09:56:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:37,221 INFO L495 AbstractCegarLoop]: Abstraction has 5068 states and 5843 transitions. [2023-12-25 09:56:37,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 23 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 5843 transitions. [2023-12-25 09:56:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 09:56:37,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:37,223 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:37,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:37,426 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:56:37,426 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:37,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1998571710, now seen corresponding path program 1 times [2023-12-25 09:56:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544696429] [2023-12-25 09:56:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:37,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:37,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:37,428 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:56:37,429 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:56:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:37,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:56:37,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:38,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:39,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544696429] [2023-12-25 09:56:39,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544696429] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:39,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:39,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2023-12-25 09:56:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197988875] [2023-12-25 09:56:39,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-25 09:56:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:39,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-25 09:56:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 09:56:39,768 INFO L87 Difference]: Start difference. First operand 5068 states and 5843 transitions. Second operand has 40 states, 40 states have (on average 5.1) internal successors, (204), 40 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:56:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:52,941 INFO L93 Difference]: Finished difference Result 11542 states and 13403 transitions. [2023-12-25 09:56:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2023-12-25 09:56:52,942 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.1) internal successors, (204), 40 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 109 [2023-12-25 09:56:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:52,949 INFO L225 Difference]: With dead ends: 11542 [2023-12-25 09:56:52,950 INFO L226 Difference]: Without dead ends: 7958 [2023-12-25 09:56:52,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8303 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=3706, Invalid=20474, Unknown=0, NotChecked=0, Total=24180 [2023-12-25 09:56:52,956 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 1689 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 3822 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:52,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 3822 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:56:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2023-12-25 09:56:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 5148. [2023-12-25 09:56:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5147 states have (on average 1.1529046046240528) internal successors, (5934), 5147 states have internal predecessors, (5934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 5934 transitions. [2023-12-25 09:56:53,006 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 5934 transitions. Word has length 109 [2023-12-25 09:56:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:53,006 INFO L495 AbstractCegarLoop]: Abstraction has 5148 states and 5934 transitions. [2023-12-25 09:56:53,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.1) internal successors, (204), 40 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:56:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 5934 transitions. [2023-12-25 09:56:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 09:56:53,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:53,008 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:53,011 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:56:53,209 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:56:53,209 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:53,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash 375944492, now seen corresponding path program 1 times [2023-12-25 09:56:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022944474] [2023-12-25 09:56:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:53,211 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:56:53,236 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:56:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:53,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:56:53,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 38 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:54,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 45 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:55,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022944474] [2023-12-25 09:56:55,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022944474] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:55,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2023-12-25 09:56:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407604767] [2023-12-25 09:56:55,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:55,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:56:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:56:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:56:55,209 INFO L87 Difference]: Start difference. First operand 5148 states and 5934 transitions. Second operand has 38 states, 38 states have (on average 5.473684210526316) internal successors, (208), 38 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:06,251 INFO L93 Difference]: Finished difference Result 11667 states and 13502 transitions. [2023-12-25 09:57:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2023-12-25 09:57:06,252 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.473684210526316) internal successors, (208), 38 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-25 09:57:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:06,259 INFO L225 Difference]: With dead ends: 11667 [2023-12-25 09:57:06,259 INFO L226 Difference]: Without dead ends: 8091 [2023-12-25 09:57:06,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8759 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=3718, Invalid=22364, Unknown=0, NotChecked=0, Total=26082 [2023-12-25 09:57:06,264 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 1460 mSDsluCounter, 4309 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:06,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 4539 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-25 09:57:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2023-12-25 09:57:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 5451. [2023-12-25 09:57:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5451 states, 5450 states have (on average 1.1543119266055046) internal successors, (6291), 5450 states have internal predecessors, (6291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5451 states to 5451 states and 6291 transitions. [2023-12-25 09:57:06,315 INFO L78 Accepts]: Start accepts. Automaton has 5451 states and 6291 transitions. Word has length 109 [2023-12-25 09:57:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:06,315 INFO L495 AbstractCegarLoop]: Abstraction has 5451 states and 6291 transitions. [2023-12-25 09:57:06,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.473684210526316) internal successors, (208), 38 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5451 states and 6291 transitions. [2023-12-25 09:57:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 09:57:06,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:06,317 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:57:06,326 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 (31)] Ended with exit code 0 [2023-12-25 09:57:06,520 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:57:06,520 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:06,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -432501783, now seen corresponding path program 1 times [2023-12-25 09:57:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612968120] [2023-12-25 09:57:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:57:06,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:06,522 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:57:06,545 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:57:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:06,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 09:57:06,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:08,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:08,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:08,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612968120] [2023-12-25 09:57:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612968120] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:08,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:08,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2023-12-25 09:57:08,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75496175] [2023-12-25 09:57:08,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:08,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 09:57:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:08,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 09:57:08,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 09:57:08,904 INFO L87 Difference]: Start difference. First operand 5451 states and 6291 transitions. Second operand has 35 states, 35 states have (on average 5.685714285714286) internal successors, (199), 35 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:24,702 INFO L93 Difference]: Finished difference Result 18455 states and 21599 transitions. [2023-12-25 09:57:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-12-25 09:57:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.685714285714286) internal successors, (199), 35 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-25 09:57:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:24,713 INFO L225 Difference]: With dead ends: 18455 [2023-12-25 09:57:24,713 INFO L226 Difference]: Without dead ends: 13771 [2023-12-25 09:57:24,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6515 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2337, Invalid=17685, Unknown=0, NotChecked=0, Total=20022 [2023-12-25 09:57:24,726 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 1828 mSDsluCounter, 6033 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1828 SdHoareTripleChecker+Valid, 6366 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:24,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1828 Valid, 6366 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-25 09:57:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13771 states. [2023-12-25 09:57:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13771 to 7076. [2023-12-25 09:57:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7076 states, 7075 states have (on average 1.1591519434628976) internal successors, (8201), 7075 states have internal predecessors, (8201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7076 states to 7076 states and 8201 transitions. [2023-12-25 09:57:24,790 INFO L78 Accepts]: Start accepts. Automaton has 7076 states and 8201 transitions. Word has length 109 [2023-12-25 09:57:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:24,790 INFO L495 AbstractCegarLoop]: Abstraction has 7076 states and 8201 transitions. [2023-12-25 09:57:24,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.685714285714286) internal successors, (199), 35 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7076 states and 8201 transitions. [2023-12-25 09:57:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:57:24,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:24,807 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:57:24,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-12-25 09:57:25,010 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:57:25,010 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:25,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1848767014, now seen corresponding path program 1 times [2023-12-25 09:57:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530101497] [2023-12-25 09:57:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:25,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:57:25,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:25,012 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:57:25,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 (33)] Waiting until timeout for monitored process [2023-12-25 09:57:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:25,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 09:57:25,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:25,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:26,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:26,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530101497] [2023-12-25 09:57:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530101497] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:26,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:26,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2023-12-25 09:57:26,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881662761] [2023-12-25 09:57:26,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:26,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 09:57:26,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:26,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 09:57:26,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2023-12-25 09:57:26,385 INFO L87 Difference]: Start difference. First operand 7076 states and 8201 transitions. Second operand has 27 states, 27 states have (on average 7.777777777777778) internal successors, (210), 27 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:28,071 INFO L93 Difference]: Finished difference Result 11753 states and 13635 transitions. [2023-12-25 09:57:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 09:57:28,071 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.777777777777778) internal successors, (210), 27 states have internal predecessors, (210), 0 states have call successors, (0), 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:57:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:28,079 INFO L225 Difference]: With dead ends: 11753 [2023-12-25 09:57:28,079 INFO L226 Difference]: Without dead ends: 9962 [2023-12-25 09:57:28,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=378, Invalid=2484, Unknown=0, NotChecked=0, Total=2862 [2023-12-25 09:57:28,083 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 742 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:28,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 2209 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:57:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9962 states. [2023-12-25 09:57:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9962 to 7072. [2023-12-25 09:57:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7072 states, 7071 states have (on average 1.1591005515485786) internal successors, (8196), 7071 states have internal predecessors, (8196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7072 states to 7072 states and 8196 transitions. [2023-12-25 09:57:28,148 INFO L78 Accepts]: Start accepts. Automaton has 7072 states and 8196 transitions. Word has length 110 [2023-12-25 09:57:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:28,149 INFO L495 AbstractCegarLoop]: Abstraction has 7072 states and 8196 transitions. [2023-12-25 09:57:28,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.777777777777778) internal successors, (210), 27 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7072 states and 8196 transitions. [2023-12-25 09:57:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-25 09:57:28,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:28,155 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:57:28,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-12-25 09:57:28,358 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:57:28,358 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:28,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash 595465715, now seen corresponding path program 1 times [2023-12-25 09:57:28,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:28,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705541939] [2023-12-25 09:57:28,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:28,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:57:28,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:28,360 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:57:28,364 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:57:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:28,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:57:28,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 139 proven. 74 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 09:57:29,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 55 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:30,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705541939] [2023-12-25 09:57:30,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705541939] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:30,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:30,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2023-12-25 09:57:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083154787] [2023-12-25 09:57:30,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:30,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:57:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:30,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:57:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:57:30,357 INFO L87 Difference]: Start difference. First operand 7072 states and 8196 transitions. Second operand has 38 states, 38 states have (on average 7.105263157894737) internal successors, (270), 38 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:23,305 INFO L93 Difference]: Finished difference Result 26113 states and 30427 transitions. [2023-12-25 09:58:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2023-12-25 09:58:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.105263157894737) internal successors, (270), 38 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2023-12-25 09:58:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:23,318 INFO L225 Difference]: With dead ends: 26113 [2023-12-25 09:58:23,318 INFO L226 Difference]: Without dead ends: 21899 [2023-12-25 09:58:23,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38930 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=11430, Invalid=81900, Unknown=0, NotChecked=0, Total=93330 [2023-12-25 09:58:23,324 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 2552 mSDsluCounter, 4534 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2552 SdHoareTripleChecker+Valid, 4694 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:23,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2552 Valid, 4694 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 09:58:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2023-12-25 09:58:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 11974. [2023-12-25 09:58:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11974 states, 11973 states have (on average 1.1591915142403741) internal successors, (13879), 11973 states have internal predecessors, (13879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11974 states to 11974 states and 13879 transitions. [2023-12-25 09:58:23,454 INFO L78 Accepts]: Start accepts. Automaton has 11974 states and 13879 transitions. Word has length 151 [2023-12-25 09:58:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:23,454 INFO L495 AbstractCegarLoop]: Abstraction has 11974 states and 13879 transitions. [2023-12-25 09:58:23,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.105263157894737) internal successors, (270), 38 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11974 states and 13879 transitions. [2023-12-25 09:58:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 09:58:23,457 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:23,457 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:58:23,466 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:58:23,660 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:58:23,660 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:23,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:23,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1557356041, now seen corresponding path program 1 times [2023-12-25 09:58:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:23,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423023647] [2023-12-25 09:58:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:23,662 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:58:23,683 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:58:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:23,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:58:23,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 15 proven. 204 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 09:58:23,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 15 proven. 204 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 09:58:24,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423023647] [2023-12-25 09:58:24,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423023647] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:24,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:24,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 09:58:24,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036431781] [2023-12-25 09:58:24,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:24,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 09:58:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:24,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 09:58:24,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 09:58:24,115 INFO L87 Difference]: Start difference. First operand 11974 states and 13879 transitions. Second operand has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:24,287 INFO L93 Difference]: Finished difference Result 49083 states and 58233 transitions. [2023-12-25 09:58:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:58:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-12-25 09:58:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:24,377 INFO L225 Difference]: With dead ends: 49083 [2023-12-25 09:58:24,377 INFO L226 Difference]: Without dead ends: 37919 [2023-12-25 09:58:24,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:58:24,384 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 350 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:24,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 841 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:58:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37919 states. [2023-12-25 09:58:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37919 to 37487. [2023-12-25 09:58:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37487 states, 37486 states have (on average 1.1306621138558395) internal successors, (42384), 37486 states have internal predecessors, (42384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37487 states to 37487 states and 42384 transitions. [2023-12-25 09:58:24,643 INFO L78 Accepts]: Start accepts. Automaton has 37487 states and 42384 transitions. Word has length 153 [2023-12-25 09:58:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:24,643 INFO L495 AbstractCegarLoop]: Abstraction has 37487 states and 42384 transitions. [2023-12-25 09:58:24,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 37487 states and 42384 transitions. [2023-12-25 09:58:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 09:58:24,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:24,645 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:58:24,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-12-25 09:58:24,848 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:58:24,848 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:24,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 942316361, now seen corresponding path program 1 times [2023-12-25 09:58:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701516642] [2023-12-25 09:58:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:24,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:24,850 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:58:24,852 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:58:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:24,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:58:24,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 48 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:25,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 48 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:26,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:26,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701516642] [2023-12-25 09:58:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701516642] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:26,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:58:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078382091] [2023-12-25 09:58:26,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:58:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:58:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:58:26,387 INFO L87 Difference]: Start difference. First operand 37487 states and 42384 transitions. Second operand has 33 states, 33 states have (on average 8.666666666666666) internal successors, (286), 33 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:31,753 INFO L93 Difference]: Finished difference Result 64193 states and 72871 transitions. [2023-12-25 09:58:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-12-25 09:58:31,754 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.666666666666666) internal successors, (286), 33 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-12-25 09:58:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:31,790 INFO L225 Difference]: With dead ends: 64193 [2023-12-25 09:58:31,790 INFO L226 Difference]: Without dead ends: 40646 [2023-12-25 09:58:31,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1518, Invalid=9194, Unknown=0, NotChecked=0, Total=10712 [2023-12-25 09:58:31,821 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 1225 mSDsluCounter, 3743 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:31,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 3911 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 09:58:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40646 states. [2023-12-25 09:58:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40646 to 36012. [2023-12-25 09:58:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36012 states, 36011 states have (on average 1.1266002054927662) internal successors, (40570), 36011 states have internal predecessors, (40570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36012 states to 36012 states and 40570 transitions. [2023-12-25 09:58:32,176 INFO L78 Accepts]: Start accepts. Automaton has 36012 states and 40570 transitions. Word has length 153 [2023-12-25 09:58:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:32,177 INFO L495 AbstractCegarLoop]: Abstraction has 36012 states and 40570 transitions. [2023-12-25 09:58:32,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.666666666666666) internal successors, (286), 33 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36012 states and 40570 transitions. [2023-12-25 09:58:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 09:58:32,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:32,179 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:58:32,186 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:58:32,386 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:58:32,387 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:32,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash 723266537, now seen corresponding path program 1 times [2023-12-25 09:58:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:32,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22394618] [2023-12-25 09:58:32,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:32,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:32,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:32,389 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:58:32,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-25 09:58:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:32,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 09:58:32,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 32 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:33,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 32 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:33,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22394618] [2023-12-25 09:58:33,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22394618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:33,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:33,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 09:58:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558368573] [2023-12-25 09:58:33,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:33,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 09:58:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 09:58:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 09:58:33,674 INFO L87 Difference]: Start difference. First operand 36012 states and 40570 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:58:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:41,441 INFO L93 Difference]: Finished difference Result 68620 states and 77866 transitions. [2023-12-25 09:58:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2023-12-25 09:58:41,441 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 153 [2023-12-25 09:58:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:41,475 INFO L225 Difference]: With dead ends: 68620 [2023-12-25 09:58:41,475 INFO L226 Difference]: Without dead ends: 37600 [2023-12-25 09:58:41,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5917 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2650, Invalid=17090, Unknown=0, NotChecked=0, Total=19740 [2023-12-25 09:58:41,493 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 1377 mSDsluCounter, 4185 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 4413 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:41,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 4413 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 09:58:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37600 states. [2023-12-25 09:58:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37600 to 29370. [2023-12-25 09:58:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29370 states, 29369 states have (on average 1.1193435254860566) internal successors, (32874), 29369 states have internal predecessors, (32874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:58:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29370 states to 29370 states and 32874 transitions. [2023-12-25 09:58:41,928 INFO L78 Accepts]: Start accepts. Automaton has 29370 states and 32874 transitions. Word has length 153 [2023-12-25 09:58:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:41,928 INFO L495 AbstractCegarLoop]: Abstraction has 29370 states and 32874 transitions. [2023-12-25 09:58:41,928 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:58:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 29370 states and 32874 transitions. [2023-12-25 09:58:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-25 09:58:41,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:41,930 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 09:58:41,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-25 09:58:42,133 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:58:42,133 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:42,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1485852563, now seen corresponding path program 1 times [2023-12-25 09:58:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:42,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077083803] [2023-12-25 09:58:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:42,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:42,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:42,136 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:58:42,142 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:58:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:58:42,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 09:58:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:58:42,371 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 09:58:42,371 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 09:58:42,372 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 09:58:42,379 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:58:42,579 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:58:42,582 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] [2023-12-25 09:58:42,585 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 09:58:42,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 09:58:42 BoogieIcfgContainer [2023-12-25 09:58:42,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 09:58:42,741 INFO L158 Benchmark]: Toolchain (without parser) took 320908.17ms. Allocated memory was 186.6MB in the beginning and 869.3MB in the end (delta: 682.6MB). Free memory was 122.3MB in the beginning and 430.2MB in the end (delta: -307.9MB). Peak memory consumption was 375.5MB. Max. memory is 8.0GB. [2023-12-25 09:58:42,742 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 09:58:42,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.65ms. Allocated memory is still 186.6MB. Free memory was 122.3MB in the beginning and 107.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 09:58:42,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.47ms. Allocated memory is still 186.6MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 09:58:42,746 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 186.6MB. Free memory was 104.8MB in the beginning and 102.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 09:58:42,746 INFO L158 Benchmark]: RCFGBuilder took 544.44ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 102.1MB in the beginning and 186.8MB in the end (delta: -84.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2023-12-25 09:58:42,746 INFO L158 Benchmark]: TraceAbstraction took 319959.07ms. Allocated memory was 240.1MB in the beginning and 869.3MB in the end (delta: 629.1MB). Free memory was 186.3MB in the beginning and 430.2MB in the end (delta: -243.9MB). Peak memory consumption was 385.7MB. Max. memory is 8.0GB. [2023-12-25 09:58:42,747 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.13ms. Allocated memory is still 186.6MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.65ms. Allocated memory is still 186.6MB. Free memory was 122.3MB in the beginning and 107.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.47ms. Allocated memory is still 186.6MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 186.6MB. Free memory was 104.8MB in the beginning and 102.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 544.44ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 102.1MB in the beginning and 186.8MB in the end (delta: -84.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * TraceAbstraction took 319959.07ms. Allocated memory was 240.1MB in the beginning and 869.3MB in the end (delta: 629.1MB). Free memory was 186.3MB in the beginning and 430.2MB in the end (delta: -243.9MB). Peak memory consumption was 385.7MB. 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: 199]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 = '\x0'; [L27] port_t p1 = 0; [L28] char p1_old = '\x0'; [L29] char p1_new = '\x0'; [L30] char id1 = '\x0'; [L31] char st1 = '\x0'; [L32] msg_t send1 = '\x0'; [L33] _Bool mode1 = 0; [L34] port_t p2 = 0; [L35] char p2_old = '\x0'; [L36] char p2_new = '\x0'; [L37] char id2 = '\x0'; [L38] char st2 = '\x0'; [L39] msg_t send2 = '\x0'; [L40] _Bool mode2 = 0; [L41] port_t p3 = 0; [L42] char p3_old = '\x0'; [L43] char p3_new = '\x0'; [L44] char id3 = '\x0'; [L45] char st3 = '\x0'; [L46] msg_t send3 = '\x0'; [L47] _Bool mode3 = 0; [L51] void (*nodes[3])() = { &node1, &node2, &node3 }; [L55] int __return_1411; [L56] int __return_1487; [L57] int __return_1543; [L60] int main__c1; [L61] int main__i2; [L62] main__c1 = 0 [L63] r1 = __VERIFIER_nondet_char() [L64] id1 = __VERIFIER_nondet_char() [L65] st1 = __VERIFIER_nondet_char() [L66] send1 = __VERIFIER_nondet_char() [L67] mode1 = __VERIFIER_nondet_bool() [L68] id2 = __VERIFIER_nondet_char() [L69] st2 = __VERIFIER_nondet_char() [L70] send2 = __VERIFIER_nondet_char() [L71] mode2 = __VERIFIER_nondet_bool() [L72] id3 = __VERIFIER_nondet_char() [L73] st3 = __VERIFIER_nondet_char() [L74] send3 = __VERIFIER_nondet_char() [L75] mode3 = __VERIFIER_nondet_bool() [L77] int init__tmp; VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L78] COND TRUE ((int)r1) == 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=0, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L80] COND TRUE ((int)id1) >= 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L82] COND TRUE ((int)st1) == 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L84] COND TRUE ((int)send1) == ((int)id1) VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=0, id1=64, main__c1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L86] COND TRUE ((int)mode1) == 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=0, id1=64, main__c1=0, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L88] COND TRUE ((int)id2) >= 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L90] COND TRUE ((int)st2) == 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L92] COND TRUE ((int)send2) == ((int)id2) VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L94] COND TRUE ((int)mode2) == 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L96] COND TRUE ((int)id3) >= 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L98] COND TRUE ((int)st3) == 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L100] COND TRUE ((int)send3) == ((int)id3) VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L102] COND TRUE ((int)mode3) == 0 VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L104] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L106] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1411=0, __return_1487=0, __return_1543=0, __return_main=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] [L108] COND TRUE ((int)id2) != ((int)id3) [L110] init__tmp = 1 [L111] __return_1411 = init__tmp [L112] main__i2 = __return_1411 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L113] COND TRUE main__i2 != 0 [L115] p1_old = nomsg [L116] p1_new = nomsg [L117] p2_old = nomsg [L118] p2_new = nomsg [L119] p3_old = nomsg [L120] p3_new = nomsg [L121] main__i2 = 0 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L123] COND TRUE main__i2 < 6 [L126] msg_t node1__m1; [L127] node1__m1 = nomsg VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L128] COND FALSE !(!(mode1 == 0)) [L355] int node1____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L356] COND TRUE send1 != nomsg VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L358] COND TRUE p1_new == nomsg [L360] node1____CPAchecker_TMP_0 = send1 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L362] p1_new = node1____CPAchecker_TMP_0 [L363] mode1 = 1 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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, 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] [L142] msg_t node2__m2; [L143] node2__m2 = nomsg VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L144] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L310] COND TRUE send2 != nomsg VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L312] COND TRUE p2_new == nomsg [L314] node2____CPAchecker_TMP_0 = send2 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L316] p2_new = node2____CPAchecker_TMP_0 [L317] mode2 = 1 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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, 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] [L157] msg_t node3__m3; [L158] node3__m3 = nomsg VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L159] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L265] COND TRUE send3 != nomsg VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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] [L267] COND TRUE p3_new == nomsg [L269] node3____CPAchecker_TMP_0 = send3 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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____CPAchecker_TMP_0=32, 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] [L271] p3_new = node3____CPAchecker_TMP_0 [L272] mode3 = 1 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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____CPAchecker_TMP_0=32, 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=32, p3_old=-1, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L171] p1_old = p1_new [L172] p1_new = nomsg [L173] p2_old = p2_new [L174] p2_new = nomsg [L175] p3_old = p3_new [L176] p3_new = nomsg [L178] int check__tmp; VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L179] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L181] COND FALSE !(((int)r1) >= 3) VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)r1) < 3 [L186] check__tmp = 1 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=0, check__tmp=1, 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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L190] __return_1487 = check__tmp [L191] main__c1 = __return_1487 [L193] _Bool __tmp_1; [L194] __tmp_1 = main__c1 [L195] _Bool assert__arg; [L196] assert__arg = __tmp_1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L197] COND FALSE !(assert__arg == 0) [L204] int main____CPAchecker_TMP_0 = main__i2; [L205] main__i2 = main__i2 + 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L123] COND TRUE main__i2 < 6 [L126] msg_t node1__m1; [L127] node1__m1 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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____CPAchecker_TMP_0=32, 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=32, r1=0, send1=64, send2=0, send3=32, st1=0, st2=0, st3=0] [L128] COND TRUE !(mode1 == 0) [L130] r1 = (char)(((int)r1) + 1) [L131] node1__m1 = p3_old [L132] p3_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3____CPAchecker_TMP_0=32, 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] [L133] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3____CPAchecker_TMP_0=32, 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] [L135] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3____CPAchecker_TMP_0=32, 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] [L336] COND FALSE !(((int)node1__m1) == ((int)id1)) [L343] send1 = node1__m1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3____CPAchecker_TMP_0=32, 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=32, send2=0, send3=32, st1=0, st2=0, st3=0] [L139] mode1 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3____CPAchecker_TMP_0=32, 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=32, send2=0, send3=32, st1=0, st2=0, st3=0] [L142] msg_t node2__m2; [L143] node2__m2 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3____CPAchecker_TMP_0=32, 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=32, send2=0, send3=32, st1=0, st2=0, st3=0] [L144] COND TRUE !(mode2 == 0) [L146] node2__m2 = p1_old [L147] p1_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=0, send3=32, st1=0, st2=0, st3=0] [L148] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=0, send3=32, st1=0, st2=0, st3=0] [L150] COND TRUE ((int)node2__m2) > ((int)id2) [L152] send2 = node2__m2 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L154] mode2 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L157] msg_t node3__m3; [L158] node3__m3 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L159] COND TRUE !(mode3 == 0) [L161] node3__m3 = p2_old [L162] p2_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L165] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L246] COND FALSE !(((int)node3__m3) == ((int)id3)) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L169] mode3 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L171] p1_old = p1_new [L172] p1_new = nomsg [L173] p2_old = p2_new [L174] p2_new = nomsg [L175] p3_old = p3_new [L176] p3_new = nomsg [L178] int check__tmp; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L179] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L181] COND FALSE !(((int)r1) >= 3) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)r1) < 3 [L186] check__tmp = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L190] __return_1487 = check__tmp [L191] main__c1 = __return_1487 [L193] _Bool __tmp_1; [L194] __tmp_1 = main__c1 [L195] _Bool assert__arg; [L196] assert__arg = __tmp_1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, 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=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L197] COND FALSE !(assert__arg == 0) [L204] int main____CPAchecker_TMP_0 = main__i2; [L205] main__i2 = main__i2 + 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=64, node1__m1=32, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L123] COND TRUE main__i2 < 6 [L126] msg_t node1__m1; [L127] node1__m1 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, 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, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L128] COND FALSE !(!(mode1 == 0)) [L355] int node1____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L356] COND TRUE send1 != nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L358] COND TRUE p1_new == nomsg [L360] node1____CPAchecker_TMP_0 = send1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, 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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L362] p1_new = node1____CPAchecker_TMP_0 [L363] mode1 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=64, node3____CPAchecker_TMP_0=32, node3__m3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L142] msg_t node2__m2; [L143] node2__m2 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=0, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L144] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L310] COND TRUE send2 != nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L312] COND TRUE p2_new == nomsg [L314] node2____CPAchecker_TMP_0 = send2 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L316] p2_new = node2____CPAchecker_TMP_0 [L317] mode2 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L157] msg_t node3__m3; [L158] node3__m3 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L159] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L265] COND TRUE send3 != nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L267] COND TRUE p3_new == nomsg [L269] node3____CPAchecker_TMP_0 = send3 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L271] p3_new = node3____CPAchecker_TMP_0 [L272] mode3 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=32, p3_old=-1, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L171] p1_old = p1_new [L172] p1_new = nomsg [L173] p2_old = p2_new [L174] p2_new = nomsg [L175] p3_old = p3_new [L176] p3_new = nomsg [L178] int check__tmp; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L179] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L181] COND FALSE !(((int)r1) >= 3) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)r1) < 3 [L186] check__tmp = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L190] __return_1487 = check__tmp [L191] main__c1 = __return_1487 [L193] _Bool __tmp_1; [L194] __tmp_1 = main__c1 [L195] _Bool assert__arg; [L196] assert__arg = __tmp_1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L197] COND FALSE !(assert__arg == 0) [L204] int main____CPAchecker_TMP_0 = main__i2; [L205] main__i2 = main__i2 + 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L123] COND TRUE main__i2 < 6 [L126] msg_t node1__m1; [L127] node1__m1 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L128] COND TRUE !(mode1 == 0) [L130] r1 = (char)(((int)r1) + 1) [L131] node1__m1 = p3_old [L132] p3_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L133] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L135] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L336] COND FALSE !(((int)node1__m1) == ((int)id1)) [L343] send1 = node1__m1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L139] mode1 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L142] msg_t node2__m2; [L143] node2__m2 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L144] COND TRUE !(mode2 == 0) [L146] node2__m2 = p1_old [L147] p1_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L148] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L150] COND TRUE ((int)node2__m2) > ((int)id2) [L152] send2 = node2__m2 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=32, st1=0, st2=0, st3=0] [L154] mode2 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=32, st1=0, st2=0, st3=0] [L157] msg_t node3__m3; [L158] node3__m3 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=32, st1=0, st2=0, st3=0] [L159] COND TRUE !(mode3 == 0) [L161] node3__m3 = p2_old [L162] p2_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=32, st1=0, st2=0, st3=0] [L163] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=32, st1=0, st2=0, st3=0] [L165] COND TRUE ((int)node3__m3) > ((int)id3) [L167] send3 = node3__m3 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L169] mode3 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L171] p1_old = p1_new [L172] p1_new = nomsg [L173] p2_old = p2_new [L174] p2_new = nomsg [L175] p3_old = p3_new [L176] p3_new = nomsg [L178] int check__tmp; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L179] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L181] COND FALSE !(((int)r1) >= 3) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)r1) < 3 [L186] check__tmp = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L190] __return_1487 = check__tmp [L191] main__c1 = __return_1487 [L193] _Bool __tmp_1; [L194] __tmp_1 = main__c1 [L195] _Bool assert__arg; [L196] assert__arg = __tmp_1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L197] COND FALSE !(assert__arg == 0) [L204] int main____CPAchecker_TMP_0 = main__i2; [L205] main__i2 = main__i2 + 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=32, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L123] COND TRUE main__i2 < 6 [L126] msg_t node1__m1; [L127] node1__m1 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L128] COND FALSE !(!(mode1 == 0)) [L355] int node1____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L356] COND TRUE send1 != nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L358] COND TRUE p1_new == nomsg [L360] node1____CPAchecker_TMP_0 = send1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L362] p1_new = node1____CPAchecker_TMP_0 [L363] mode1 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=32, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L142] msg_t node2__m2; [L143] node2__m2 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=64, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L144] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L310] COND TRUE send2 != nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L312] COND TRUE p2_new == nomsg [L314] node2____CPAchecker_TMP_0 = send2 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L316] p2_new = node2____CPAchecker_TMP_0 [L317] mode2 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=64, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L157] msg_t node3__m3; [L158] node3__m3 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=32, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L159] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L265] COND TRUE send3 != nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L267] COND TRUE p3_new == nomsg [L269] node3____CPAchecker_TMP_0 = send3 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L271] p3_new = node3____CPAchecker_TMP_0 [L272] mode3 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L171] p1_old = p1_new [L172] p1_new = nomsg [L173] p2_old = p2_new [L174] p2_new = nomsg [L175] p3_old = p3_new [L176] p3_new = nomsg [L178] int check__tmp; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L179] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L181] COND FALSE !(((int)r1) >= 3) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L226] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L184] COND TRUE ((int)r1) < 3 [L186] check__tmp = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L190] __return_1487 = check__tmp [L191] main__c1 = __return_1487 [L193] _Bool __tmp_1; [L194] __tmp_1 = main__c1 [L195] _Bool assert__arg; [L196] assert__arg = __tmp_1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L197] COND FALSE !(assert__arg == 0) [L204] int main____CPAchecker_TMP_0 = main__i2; [L205] main__i2 = main__i2 + 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L123] COND TRUE main__i2 < 6 [L126] msg_t node1__m1; [L127] node1__m1 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=-1, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L128] COND TRUE !(mode1 == 0) [L130] r1 = (char)(((int)r1) + 1) [L131] node1__m1 = p3_old [L132] p3_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L133] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L135] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=0, st2=0, st3=0] [L336] COND TRUE ((int)node1__m1) == ((int)id1) [L338] st1 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L139] mode1 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L142] msg_t node2__m2; [L143] node2__m2 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=-1, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L144] COND TRUE !(mode2 == 0) [L146] node2__m2 = p1_old [L147] p1_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L148] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L150] COND TRUE ((int)node2__m2) > ((int)id2) [L152] send2 = node2__m2 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L154] mode2 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L157] msg_t node3__m3; [L158] node3__m3 = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L159] COND TRUE !(mode3 == 0) [L161] node3__m3 = p2_old [L162] p2_old = nomsg VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L163] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L165] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=0] [L246] COND TRUE ((int)node3__m3) == ((int)id3) [L248] st3 = 1 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=1] [L169] mode3 = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=1] [L171] p1_old = p1_new [L172] p1_new = nomsg [L173] p2_old = p2_new [L174] p2_new = nomsg [L175] p3_old = p3_new [L176] p3_new = nomsg [L178] int check__tmp; VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=1] [L179] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L239] check__tmp = 0 VAL [__return_1411=1, __return_1487=1, __return_1543=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=1] [L190] __return_1487 = check__tmp [L191] main__c1 = __return_1487 [L193] _Bool __tmp_1; [L194] __tmp_1 = main__c1 [L195] _Bool assert__arg; [L196] assert__arg = __tmp_1 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=0, __tmp_1=0, assert__arg=0, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=1] [L197] COND TRUE assert__arg == 0 VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=0, __tmp_1=0, assert__arg=0, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=1] [L199] reach_error() VAL [__return_1411=1, __return_1487=0, __return_1543=0, __return_main=0, __tmp_1=0, assert__arg=0, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1____CPAchecker_TMP_0=32, node1__m1=64, node2____CPAchecker_TMP_0=32, node2__m2=32, node3____CPAchecker_TMP_0=64, node3__m3=32, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=32, send3=64, st1=1, st2=0, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 319.8s, OverallIterations: 37, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 275.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33812 SdHoareTripleChecker+Valid, 34.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33812 mSDsluCounter, 56870 SdHoareTripleChecker+Invalid, 31.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52159 mSDsCounter, 637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27502 IncrementalHoareTripleChecker+Invalid, 28139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 637 mSolverCounterUnsat, 4711 mSDtfsCounter, 27502 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6926 GetRequests, 4451 SyntacticMatches, 4 SemanticMatches, 2471 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 204295 ImplicationChecksByTransitivity, 250.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37487occurred in iteration=34, InterpolantAutomatonStates: 2087, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 79227 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 3051 NumberOfCodeBlocks, 3051 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4898 ConstructedInterpolants, 1210 QuantifiedInterpolants, 62694 SizeOfPredicates, 213 NumberOfNonLiveVariables, 6405 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 56 InterpolantComputations, 16 PerfectInterpolantSequences, 1399/4026 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:58:42,936 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 0 Received shutdown request...