/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:55:54,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:55:54,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 09:55:54,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:55:54,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:55:54,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:55:54,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:55:54,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:55:54,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:55:54,204 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:55:54,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:55:54,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:55:54,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:55:54,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:55:54,205 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:55:54,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:55:54,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:55:54,206 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:55:54,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:55:54,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:55:54,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:55:54,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:55:54,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:55:54,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:55:54,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:55:54,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:55:54,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:55:54,208 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:55:54,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:55:54,208 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:55:54,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:55:54,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:55:54,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:55:54,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:55:54,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:55:54,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:55:54,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:55:54,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:55:54,210 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:55:54,210 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 09:55:54,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:55:54,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:55:54,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:55:54,394 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:55:54,396 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:55:54,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-12-25 09:55:55,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:55:55,661 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:55:55,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-12-25 09:55:55,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fea84446/2fe09e15147f4d2cbff0ce0616f13d11/FLAG849103cf2 [2023-12-25 09:55:55,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fea84446/2fe09e15147f4d2cbff0ce0616f13d11 [2023-12-25 09:55:55,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:55:55,697 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:55:55,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:55:55,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:55:55,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:55:55,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:55,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535be48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55, skipping insertion in model container [2023-12-25 09:55:55,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:55,745 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:55:55,910 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2023-12-25 09:55:55,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:55:55,944 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:55:55,968 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2023-12-25 09:55:55,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:55:55,992 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:55:55,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55 WrapperNode [2023-12-25 09:55:55,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:55:55,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:55:55,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:55:55,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:55:55,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,034 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 279 [2023-12-25 09:55:56,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:55:56,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:55:56,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:55:56,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:55:56,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 09:55:56,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:55:56,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:55:56,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:55:56,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:55:56,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (1/1) ... [2023-12-25 09:55:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:55:56,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:55:56,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 09:55:56,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 09:55:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:55:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:55:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:55:56,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:55:56,263 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:55:56,265 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:55:56,605 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:55:56,641 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:55:56,641 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:55:56,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:55:56 BoogieIcfgContainer [2023-12-25 09:55:56,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:55:56,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:55:56,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:55:56,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:55:56,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:55:55" (1/3) ... [2023-12-25 09:55:56,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562380cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:55:56, skipping insertion in model container [2023-12-25 09:55:56,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:55:55" (2/3) ... [2023-12-25 09:55:56,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562380cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:55:56, skipping insertion in model container [2023-12-25 09:55:56,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:55:56" (3/3) ... [2023-12-25 09:55:56,648 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-12-25 09:55:56,660 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:55:56,661 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 09:55:56,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:55:56,695 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;@651a76df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:55:56,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 09:55:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 09:55:56,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:56,717 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:55:56,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:56,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash 358399884, now seen corresponding path program 1 times [2023-12-25 09:55:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931470361] [2023-12-25 09:55:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:56,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:56,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 09:55:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:56,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:55:56,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:57,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:57,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931470361] [2023-12-25 09:55:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931470361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:57,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:55:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337076423] [2023-12-25 09:55:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:57,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:55:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:55:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:55:57,211 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 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:55:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:57,358 INFO L93 Difference]: Finished difference Result 152 states and 240 transitions. [2023-12-25 09:55:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:55:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 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:55:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:57,382 INFO L225 Difference]: With dead ends: 152 [2023-12-25 09:55:57,382 INFO L226 Difference]: Without dead ends: 102 [2023-12-25 09:55:57,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:55:57,387 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 239 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:57,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 109 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:55:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-25 09:55:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-25 09:55:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.494949494949495) internal successors, (148), 99 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call 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:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2023-12-25 09:55:57,422 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 36 [2023-12-25 09:55:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:57,423 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2023-12-25 09:55:57,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 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:55:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2023-12-25 09:55:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 09:55:57,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:57,424 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:55:57,427 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:55:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:57,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:57,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1223932273, now seen corresponding path program 1 times [2023-12-25 09:55:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:57,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082768103] [2023-12-25 09:55:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:57,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:57,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:57,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:57,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 09:55:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:57,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:55:57,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:57,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:57,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082768103] [2023-12-25 09:55:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082768103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:57,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:55:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759551419] [2023-12-25 09:55:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:57,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:55:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:55:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:55:57,767 INFO L87 Difference]: Start difference. First operand 100 states and 148 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:55:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:57,792 INFO L93 Difference]: Finished difference Result 248 states and 382 transitions. [2023-12-25 09:55:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:55:57,793 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:55:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:57,794 INFO L225 Difference]: With dead ends: 248 [2023-12-25 09:55:57,794 INFO L226 Difference]: Without dead ends: 166 [2023-12-25 09:55:57,795 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:55:57,795 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 179 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:55:57,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:55:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-25 09:55:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2023-12-25 09:55:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 163 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2023-12-25 09:55:57,807 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 36 [2023-12-25 09:55:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:57,807 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2023-12-25 09:55:57,808 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:55:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2023-12-25 09:55:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 09:55:57,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:57,809 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:55:57,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:58,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:58,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:58,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2072992163, now seen corresponding path program 1 times [2023-12-25 09:55:58,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004591719] [2023-12-25 09:55:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:58,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:58,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:58,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:58,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 09:55:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:58,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:55:58,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:58,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:58,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004591719] [2023-12-25 09:55:58,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004591719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:55:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910064970] [2023-12-25 09:55:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:58,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:55:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:55:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:55:58,304 INFO L87 Difference]: Start difference. First operand 164 states and 249 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:55:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:58,379 INFO L93 Difference]: Finished difference Result 310 states and 480 transitions. [2023-12-25 09:55:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:55:58,379 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:55:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:58,380 INFO L225 Difference]: With dead ends: 310 [2023-12-25 09:55:58,380 INFO L226 Difference]: Without dead ends: 164 [2023-12-25 09:55:58,381 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:55:58,381 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 132 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 62 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.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:58,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 62 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:55:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-25 09:55:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-12-25 09:55:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.5153374233128833) internal successors, (247), 163 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call 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:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2023-12-25 09:55:58,388 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 37 [2023-12-25 09:55:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:58,388 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2023-12-25 09:55:58,388 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:55:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2023-12-25 09:55:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 09:55:58,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:58,389 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:55:58,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:58,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:58,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:58,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1301128510, now seen corresponding path program 1 times [2023-12-25 09:55:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578125927] [2023-12-25 09:55:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:58,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:58,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:58,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 09:55:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:58,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:55:58,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:58,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:58,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578125927] [2023-12-25 09:55:58,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578125927] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:58,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:58,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:55:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930688826] [2023-12-25 09:55:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:58,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:55:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:55:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:55:58,718 INFO L87 Difference]: Start difference. First operand 164 states and 247 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:55:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:58,732 INFO L93 Difference]: Finished difference Result 424 states and 653 transitions. [2023-12-25 09:55:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:55:58,733 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:55:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:58,735 INFO L225 Difference]: With dead ends: 424 [2023-12-25 09:55:58,735 INFO L226 Difference]: Without dead ends: 278 [2023-12-25 09:55:58,740 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:55:58,742 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 45 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 173 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:55:58,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:55:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-12-25 09:55:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2023-12-25 09:55:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.5236363636363637) internal successors, (419), 275 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call 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:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 419 transitions. [2023-12-25 09:55:58,756 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 419 transitions. Word has length 37 [2023-12-25 09:55:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:58,757 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 419 transitions. [2023-12-25 09:55:58,757 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:55:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 419 transitions. [2023-12-25 09:55:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 09:55:58,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:58,759 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:55:58,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:58,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:58,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:58,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1794471352, now seen corresponding path program 1 times [2023-12-25 09:55:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:58,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279533691] [2023-12-25 09:55:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:58,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:58,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:58,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:58,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 09:55:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:59,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:55:59,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:59,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:59,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:59,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279533691] [2023-12-25 09:55:59,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279533691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:59,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:59,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:55:59,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595572287] [2023-12-25 09:55:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:59,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:55:59,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:59,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:55:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:55:59,168 INFO L87 Difference]: Start difference. First operand 276 states and 419 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:55:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:59,227 INFO L93 Difference]: Finished difference Result 1308 states and 2023 transitions. [2023-12-25 09:55:59,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:55:59,228 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:55:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:59,233 INFO L225 Difference]: With dead ends: 1308 [2023-12-25 09:55:59,233 INFO L226 Difference]: Without dead ends: 1050 [2023-12-25 09:55:59,234 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:55:59,234 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 216 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:59,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 317 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:55:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2023-12-25 09:55:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 788. [2023-12-25 09:55:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.5184243964421855) internal successors, (1195), 787 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1195 transitions. [2023-12-25 09:55:59,264 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1195 transitions. Word has length 38 [2023-12-25 09:55:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:59,265 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1195 transitions. [2023-12-25 09:55:59,265 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:55:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1195 transitions. [2023-12-25 09:55:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 09:55:59,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:59,274 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:55:59,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:59,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:59,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:59,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1168060612, now seen corresponding path program 1 times [2023-12-25 09:55:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197929930] [2023-12-25 09:55:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:59,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:59,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:59,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:59,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 09:55:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:59,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:55:59,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:59,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:59,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:59,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197929930] [2023-12-25 09:55:59,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197929930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:59,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:55:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619585605] [2023-12-25 09:55:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:59,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:55:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:55:59,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:55:59,585 INFO L87 Difference]: Start difference. First operand 788 states and 1195 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:55:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:59,605 INFO L93 Difference]: Finished difference Result 1880 states and 2843 transitions. [2023-12-25 09:55:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:55:59,606 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:55:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:59,609 INFO L225 Difference]: With dead ends: 1880 [2023-12-25 09:55:59,609 INFO L226 Difference]: Without dead ends: 1110 [2023-12-25 09:55:59,610 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:55:59,611 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:59,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:55:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-12-25 09:55:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1096. [2023-12-25 09:55:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1095 states have (on average 1.480365296803653) internal successors, (1621), 1095 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:59,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1621 transitions. [2023-12-25 09:55:59,628 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1621 transitions. Word has length 40 [2023-12-25 09:55:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:59,628 INFO L495 AbstractCegarLoop]: Abstraction has 1096 states and 1621 transitions. [2023-12-25 09:55:59,628 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:55:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1621 transitions. [2023-12-25 09:55:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 09:55:59,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:59,629 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:55:59,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 09:55:59,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:59,832 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:55:59,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:55:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1795653810, now seen corresponding path program 1 times [2023-12-25 09:55:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:55:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092270743] [2023-12-25 09:55:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:55:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:55:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:55:59,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:55:59,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 09:55:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:55:59,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:55:59,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:55:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:55:59,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:55:59,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:55:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092270743] [2023-12-25 09:55:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092270743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:55:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:55:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:55:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347176019] [2023-12-25 09:55:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:55:59,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:55:59,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:55:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:55:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:55:59,925 INFO L87 Difference]: Start difference. First operand 1096 states and 1621 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:55:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:55:59,959 INFO L93 Difference]: Finished difference Result 2069 states and 3052 transitions. [2023-12-25 09:55:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:55:59,960 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:55:59,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:55:59,966 INFO L225 Difference]: With dead ends: 2069 [2023-12-25 09:55:59,966 INFO L226 Difference]: Without dead ends: 2067 [2023-12-25 09:55:59,967 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:55:59,967 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 114 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:55:59,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 283 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:55:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2023-12-25 09:55:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1152. [2023-12-25 09:55:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4535186794092094) internal successors, (1673), 1151 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:55:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1673 transitions. [2023-12-25 09:55:59,991 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1673 transitions. Word has length 41 [2023-12-25 09:55:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:55:59,991 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 1673 transitions. [2023-12-25 09:55:59,991 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:55:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1673 transitions. [2023-12-25 09:55:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 09:55:59,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:55:59,992 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:55:59,996 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:56:00,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:00,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1846258053, now seen corresponding path program 1 times [2023-12-25 09:56:00,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:00,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949430757] [2023-12-25 09:56:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:00,196 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:00,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 09:56:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:00,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:00,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:00,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:00,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:00,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949430757] [2023-12-25 09:56:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949430757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:00,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:00,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313008597] [2023-12-25 09:56:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:00,278 INFO L87 Difference]: Start difference. First operand 1152 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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:56:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:00,293 INFO L93 Difference]: Finished difference Result 2551 states and 3755 transitions. [2023-12-25 09:56:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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:56:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:00,299 INFO L225 Difference]: With dead ends: 2551 [2023-12-25 09:56:00,299 INFO L226 Difference]: Without dead ends: 1732 [2023-12-25 09:56:00,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:00,301 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 52 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 183 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:56:00,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 183 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2023-12-25 09:56:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1730. [2023-12-25 09:56:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1729 states have (on average 1.4476576055523425) internal successors, (2503), 1729 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2503 transitions. [2023-12-25 09:56:00,324 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2503 transitions. Word has length 41 [2023-12-25 09:56:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:00,324 INFO L495 AbstractCegarLoop]: Abstraction has 1730 states and 2503 transitions. [2023-12-25 09:56:00,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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:56:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2503 transitions. [2023-12-25 09:56:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:56:00,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:00,325 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:56:00,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:00,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:00,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1413176550, now seen corresponding path program 1 times [2023-12-25 09:56:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485991082] [2023-12-25 09:56:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:00,530 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 09:56:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:00,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:00,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:00,602 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:56:00,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:00,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485991082] [2023-12-25 09:56:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485991082] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375351387] [2023-12-25 09:56:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:00,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:00,603 INFO L87 Difference]: Start difference. First operand 1730 states and 2503 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:56:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:00,620 INFO L93 Difference]: Finished difference Result 3152 states and 4588 transitions. [2023-12-25 09:56:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:00,621 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:56:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:00,624 INFO L225 Difference]: With dead ends: 3152 [2023-12-25 09:56:00,624 INFO L226 Difference]: Without dead ends: 1442 [2023-12-25 09:56:00,626 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:56:00,626 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 174 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:56:00,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2023-12-25 09:56:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1440. [2023-12-25 09:56:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.444753300903405) internal successors, (2079), 1439 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2079 transitions. [2023-12-25 09:56:00,645 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2079 transitions. Word has length 60 [2023-12-25 09:56:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:00,646 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 2079 transitions. [2023-12-25 09:56:00,646 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:56:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2079 transitions. [2023-12-25 09:56:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:56:00,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:00,646 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:56:00,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:00,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,849 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:00,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1292403605, now seen corresponding path program 1 times [2023-12-25 09:56:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:00,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787090774] [2023-12-25 09:56:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:00,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:00,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:00,851 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:00,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 (11)] Waiting until timeout for monitored process [2023-12-25 09:56:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:00,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:00,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:01,290 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:56:01,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:01,554 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:56:01,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:01,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787090774] [2023-12-25 09:56:01,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787090774] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:01,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:01,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:56:01,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60045699] [2023-12-25 09:56:01,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:01,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:56:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:56:01,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:56:01,556 INFO L87 Difference]: Start difference. First operand 1440 states and 2079 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:03,121 INFO L93 Difference]: Finished difference Result 5227 states and 7476 transitions. [2023-12-25 09:56:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-25 09:56:03,122 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:56:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:03,136 INFO L225 Difference]: With dead ends: 5227 [2023-12-25 09:56:03,136 INFO L226 Difference]: Without dead ends: 3821 [2023-12-25 09:56:03,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2023-12-25 09:56:03,141 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1319 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:03,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 474 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:56:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2023-12-25 09:56:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 1440. [2023-12-25 09:56:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1439 states have (on average 1.419041000694927) internal successors, (2042), 1439 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2042 transitions. [2023-12-25 09:56:03,193 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2042 transitions. Word has length 61 [2023-12-25 09:56:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:03,194 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 2042 transitions. [2023-12-25 09:56:03,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2042 transitions. [2023-12-25 09:56:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:56:03,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:03,195 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:56:03,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:03,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:03,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:03,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash -996358177, now seen corresponding path program 1 times [2023-12-25 09:56:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600496584] [2023-12-25 09:56:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:03,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:03,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:03,405 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:03,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 09:56:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:03,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:03,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:03,964 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:56:03,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:04,132 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:56:04,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:04,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600496584] [2023-12-25 09:56:04,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600496584] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:04,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:04,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:56:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823482349] [2023-12-25 09:56:04,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:04,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:56:04,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:04,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:56:04,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:56:04,134 INFO L87 Difference]: Start difference. First operand 1440 states and 2042 transitions. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:06,393 INFO L93 Difference]: Finished difference Result 6123 states and 8585 transitions. [2023-12-25 09:56:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-25 09:56:06,394 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 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:56:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:06,406 INFO L225 Difference]: With dead ends: 6123 [2023-12-25 09:56:06,406 INFO L226 Difference]: Without dead ends: 4729 [2023-12-25 09:56:06,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=892, Invalid=3140, Unknown=0, NotChecked=0, Total=4032 [2023-12-25 09:56:06,410 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2641 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:06,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 963 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 09:56:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4729 states. [2023-12-25 09:56:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4729 to 1476. [2023-12-25 09:56:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1475 states have (on average 1.408813559322034) internal successors, (2078), 1475 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2078 transitions. [2023-12-25 09:56:06,444 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2078 transitions. Word has length 61 [2023-12-25 09:56:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:06,444 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 2078 transitions. [2023-12-25 09:56:06,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2078 transitions. [2023-12-25 09:56:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 09:56:06,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:06,445 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:56:06,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:06,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:06,647 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:06,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1539675511, now seen corresponding path program 1 times [2023-12-25 09:56:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:06,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543663754] [2023-12-25 09:56:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:06,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:06,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:06,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 09:56:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:06,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:56:06,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:07,195 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:56:07,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:07,383 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:56:07,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:07,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543663754] [2023-12-25 09:56:07,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543663754] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:07,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:07,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:56:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111289027] [2023-12-25 09:56:07,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:07,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:56:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:56:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:56:07,385 INFO L87 Difference]: Start difference. First operand 1476 states and 2078 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 15 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:56:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:09,908 INFO L93 Difference]: Finished difference Result 6769 states and 9414 transitions. [2023-12-25 09:56:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-25 09:56:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 15 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 62 [2023-12-25 09:56:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:09,920 INFO L225 Difference]: With dead ends: 6769 [2023-12-25 09:56:09,920 INFO L226 Difference]: Without dead ends: 5339 [2023-12-25 09:56:09,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1207, Invalid=3485, Unknown=0, NotChecked=0, Total=4692 [2023-12-25 09:56:09,924 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1414 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:09,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 536 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 09:56:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2023-12-25 09:56:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 1560. [2023-12-25 09:56:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1559 states have (on average 1.394483643361129) internal successors, (2174), 1559 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call 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:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2174 transitions. [2023-12-25 09:56:09,960 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2174 transitions. Word has length 62 [2023-12-25 09:56:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:09,961 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 2174 transitions. [2023-12-25 09:56:09,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 15 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:56:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2174 transitions. [2023-12-25 09:56:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:56:09,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:09,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:09,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:10,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:10,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:10,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash 85366934, now seen corresponding path program 1 times [2023-12-25 09:56:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:10,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108965325] [2023-12-25 09:56:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:10,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:10,165 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:10,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 09:56:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:10,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:10,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:10,238 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:56:10,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:10,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:10,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108965325] [2023-12-25 09:56:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108965325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:10,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:10,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811332973] [2023-12-25 09:56:10,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:10,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:10,239 INFO L87 Difference]: Start difference. First operand 1560 states and 2174 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:10,249 INFO L93 Difference]: Finished difference Result 2302 states and 3214 transitions. [2023-12-25 09:56:10,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-12-25 09:56:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:10,251 INFO L225 Difference]: With dead ends: 2302 [2023-12-25 09:56:10,251 INFO L226 Difference]: Without dead ends: 788 [2023-12-25 09:56:10,252 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:56:10,253 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 155 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:56:10,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-12-25 09:56:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 786. [2023-12-25 09:56:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3554140127388534) internal successors, (1064), 785 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call 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:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1064 transitions. [2023-12-25 09:56:10,261 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1064 transitions. Word has length 63 [2023-12-25 09:56:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:10,261 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 1064 transitions. [2023-12-25 09:56:10,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1064 transitions. [2023-12-25 09:56:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:56:10,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:10,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:10,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:10,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:10,463 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:10,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 371107379, now seen corresponding path program 1 times [2023-12-25 09:56:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345622006] [2023-12-25 09:56:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:10,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:10,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:10,465 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:10,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 09:56:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:10,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:10,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:10,547 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:56:10,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:10,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345622006] [2023-12-25 09:56:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345622006] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:10,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:10,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001172539] [2023-12-25 09:56:10,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:10,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:10,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:10,548 INFO L87 Difference]: Start difference. First operand 786 states and 1064 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:10,556 INFO L93 Difference]: Finished difference Result 1159 states and 1567 transitions. [2023-12-25 09:56:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-12-25 09:56:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:10,557 INFO L225 Difference]: With dead ends: 1159 [2023-12-25 09:56:10,557 INFO L226 Difference]: Without dead ends: 419 [2023-12-25 09:56:10,558 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:56:10,559 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 140 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:56:10,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-25 09:56:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2023-12-25 09:56:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.3100961538461537) internal successors, (545), 416 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call 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:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 545 transitions. [2023-12-25 09:56:10,564 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 545 transitions. Word has length 63 [2023-12-25 09:56:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:10,564 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 545 transitions. [2023-12-25 09:56:10,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 545 transitions. [2023-12-25 09:56:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:56:10,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:10,565 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:56:10,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:10,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:10,768 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:10,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash -67619789, now seen corresponding path program 1 times [2023-12-25 09:56:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:10,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133156729] [2023-12-25 09:56:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:10,770 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:10,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 09:56:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:10,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:10,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:10,996 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:56:10,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:10,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:10,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133156729] [2023-12-25 09:56:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133156729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480375848] [2023-12-25 09:56:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:10,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:10,999 INFO L87 Difference]: Start difference. First operand 417 states and 545 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:56:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:11,046 INFO L93 Difference]: Finished difference Result 917 states and 1213 transitions. [2023-12-25 09:56:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:56:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:11,048 INFO L225 Difference]: With dead ends: 917 [2023-12-25 09:56:11,048 INFO L226 Difference]: Without dead ends: 792 [2023-12-25 09:56:11,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:11,049 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:11,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-12-25 09:56:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 663. [2023-12-25 09:56:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.297583081570997) internal successors, (859), 662 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call 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:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 859 transitions. [2023-12-25 09:56:11,057 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 859 transitions. Word has length 63 [2023-12-25 09:56:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:11,058 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 859 transitions. [2023-12-25 09:56:11,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:56:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 859 transitions. [2023-12-25 09:56:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:56:11,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:11,058 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:56:11,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:11,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:11,269 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:11,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1346473962, now seen corresponding path program 1 times [2023-12-25 09:56:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:11,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945145963] [2023-12-25 09:56:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:11,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:11,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:11,271 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:11,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 09:56:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:11,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:11,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:11,524 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:56:11,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:11,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:11,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945145963] [2023-12-25 09:56:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945145963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:11,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:11,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:11,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533068966] [2023-12-25 09:56:11,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:11,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:11,526 INFO L87 Difference]: Start difference. First operand 663 states and 859 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:56:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:11,578 INFO L93 Difference]: Finished difference Result 1040 states and 1370 transitions. [2023-12-25 09:56:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:11,579 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 63 [2023-12-25 09:56:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:11,581 INFO L225 Difference]: With dead ends: 1040 [2023-12-25 09:56:11,581 INFO L226 Difference]: Without dead ends: 669 [2023-12-25 09:56:11,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:11,582 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 141 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 352 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:56:11,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 352 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2023-12-25 09:56:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 540. [2023-12-25 09:56:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.280148423005566) internal successors, (690), 539 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call 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:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 690 transitions. [2023-12-25 09:56:11,591 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 690 transitions. Word has length 63 [2023-12-25 09:56:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:11,592 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 690 transitions. [2023-12-25 09:56:11,592 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:56:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 690 transitions. [2023-12-25 09:56:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:56:11,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:11,593 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:56:11,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:11,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:11,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:11,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:11,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1379763274, now seen corresponding path program 1 times [2023-12-25 09:56:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:11,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23610200] [2023-12-25 09:56:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:11,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:11,798 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:11,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 09:56:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:11,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:56:11,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:12,058 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:56:12,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:12,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23610200] [2023-12-25 09:56:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23610200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:56:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124609689] [2023-12-25 09:56:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:12,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:56:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:56:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:12,059 INFO L87 Difference]: Start difference. First operand 540 states and 690 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:12,106 INFO L93 Difference]: Finished difference Result 917 states and 1201 transitions. [2023-12-25 09:56:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-12-25 09:56:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:12,109 INFO L225 Difference]: With dead ends: 917 [2023-12-25 09:56:12,109 INFO L226 Difference]: Without dead ends: 792 [2023-12-25 09:56:12,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:56:12,110 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 161 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:12,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 333 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-12-25 09:56:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 663. [2023-12-25 09:56:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.2794561933534743) internal successors, (847), 662 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call 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:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 847 transitions. [2023-12-25 09:56:12,119 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 847 transitions. Word has length 63 [2023-12-25 09:56:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:12,119 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 847 transitions. [2023-12-25 09:56:12,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 847 transitions. [2023-12-25 09:56:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:56:12,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:12,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:12,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-25 09:56:12,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:12,325 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:12,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -828916665, now seen corresponding path program 1 times [2023-12-25 09:56:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:12,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374634887] [2023-12-25 09:56:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:12,326 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:12,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 09:56:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:12,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:56:12,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:13,992 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:56:13,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:15,019 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:56:15,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:15,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374634887] [2023-12-25 09:56:15,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374634887] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:15,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:15,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2023-12-25 09:56:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62398039] [2023-12-25 09:56:15,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:15,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 09:56:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:15,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 09:56:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 09:56:15,022 INFO L87 Difference]: Start difference. First operand 663 states and 847 transitions. Second operand has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 39 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:42,428 INFO L93 Difference]: Finished difference Result 8159 states and 10420 transitions. [2023-12-25 09:56:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2023-12-25 09:56:42,429 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 39 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-12-25 09:56:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:42,437 INFO L225 Difference]: With dead ends: 8159 [2023-12-25 09:56:42,438 INFO L226 Difference]: Without dead ends: 7665 [2023-12-25 09:56:42,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34072 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=11941, Invalid=67301, Unknown=0, NotChecked=0, Total=79242 [2023-12-25 09:56:42,451 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 5993 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5993 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:42,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5993 Valid, 3435 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-25 09:56:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2023-12-25 09:56:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 2369. [2023-12-25 09:56:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2368 states have (on average 1.2837837837837838) internal successors, (3040), 2368 states have internal predecessors, (3040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3040 transitions. [2023-12-25 09:56:42,503 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3040 transitions. Word has length 64 [2023-12-25 09:56:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:42,503 INFO L495 AbstractCegarLoop]: Abstraction has 2369 states and 3040 transitions. [2023-12-25 09:56:42,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 39 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3040 transitions. [2023-12-25 09:56:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-25 09:56:42,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:42,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:42,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:42,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:42,707 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:42,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2073967922, now seen corresponding path program 1 times [2023-12-25 09:56:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448762461] [2023-12-25 09:56:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:42,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:42,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:42,709 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:42,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 09:56:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:42,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:56:42,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:42,821 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:56:42,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:42,902 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:56:42,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448762461] [2023-12-25 09:56:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448762461] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:42,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:42,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 09:56:42,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966035513] [2023-12-25 09:56:42,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:42,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:56:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:56:42,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:56:42,903 INFO L87 Difference]: Start difference. First operand 2369 states and 3040 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:42,942 INFO L93 Difference]: Finished difference Result 6330 states and 8135 transitions. [2023-12-25 09:56:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:56:42,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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 65 [2023-12-25 09:56:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:42,948 INFO L225 Difference]: With dead ends: 6330 [2023-12-25 09:56:42,948 INFO L226 Difference]: Without dead ends: 4301 [2023-12-25 09:56:42,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 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:56:42,951 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 153 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:42,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 306 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2023-12-25 09:56:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4269. [2023-12-25 09:56:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4269 states, 4268 states have (on average 1.232895970009372) internal successors, (5262), 4268 states have internal predecessors, (5262), 0 states have call successors, (0), 0 states have call 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:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4269 states to 4269 states and 5262 transitions. [2023-12-25 09:56:43,009 INFO L78 Accepts]: Start accepts. Automaton has 4269 states and 5262 transitions. Word has length 65 [2023-12-25 09:56:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:43,009 INFO L495 AbstractCegarLoop]: Abstraction has 4269 states and 5262 transitions. [2023-12-25 09:56:43,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call 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:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4269 states and 5262 transitions. [2023-12-25 09:56:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-25 09:56:43,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:43,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, 1, 1, 1] [2023-12-25 09:56:43,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:43,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:43,214 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:43,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash -36698254, now seen corresponding path program 1 times [2023-12-25 09:56:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890435261] [2023-12-25 09:56:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:43,217 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:43,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 09:56:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:43,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:43,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:43,293 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:56:43,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:43,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:43,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890435261] [2023-12-25 09:56:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890435261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:43,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023647430] [2023-12-25 09:56:43,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:43,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:43,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:43,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:43,295 INFO L87 Difference]: Start difference. First operand 4269 states and 5262 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:43,329 INFO L93 Difference]: Finished difference Result 8160 states and 10078 transitions. [2023-12-25 09:56:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-12-25 09:56:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:43,335 INFO L225 Difference]: With dead ends: 8160 [2023-12-25 09:56:43,335 INFO L226 Difference]: Without dead ends: 3999 [2023-12-25 09:56:43,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:43,340 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:43,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 74 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2023-12-25 09:56:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3999. [2023-12-25 09:56:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3998 states have (on average 1.2131065532766383) internal successors, (4850), 3998 states have internal predecessors, (4850), 0 states have call successors, (0), 0 states have call 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:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 4850 transitions. [2023-12-25 09:56:43,388 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 4850 transitions. Word has length 65 [2023-12-25 09:56:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:43,388 INFO L495 AbstractCegarLoop]: Abstraction has 3999 states and 4850 transitions. [2023-12-25 09:56:43,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 4850 transitions. [2023-12-25 09:56:43,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-25 09:56:43,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:43,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:43,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:43,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:43,593 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:43,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 426071879, now seen corresponding path program 1 times [2023-12-25 09:56:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:43,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588611643] [2023-12-25 09:56:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:43,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:43,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:43,595 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:43,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-25 09:56:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:43,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:43,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:43,665 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:56:43,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:43,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588611643] [2023-12-25 09:56:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588611643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:43,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:43,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685536660] [2023-12-25 09:56:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:43,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:43,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:43,667 INFO L87 Difference]: Start difference. First operand 3999 states and 4850 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:43,699 INFO L93 Difference]: Finished difference Result 7303 states and 8874 transitions. [2023-12-25 09:56:43,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:43,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-12-25 09:56:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:43,703 INFO L225 Difference]: With dead ends: 7303 [2023-12-25 09:56:43,703 INFO L226 Difference]: Without dead ends: 3424 [2023-12-25 09:56:43,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:43,707 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:43,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2023-12-25 09:56:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3424. [2023-12-25 09:56:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3423 states have (on average 1.193689745836985) internal successors, (4086), 3423 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call 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:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 4086 transitions. [2023-12-25 09:56:43,733 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 4086 transitions. Word has length 65 [2023-12-25 09:56:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:43,733 INFO L495 AbstractCegarLoop]: Abstraction has 3424 states and 4086 transitions. [2023-12-25 09:56:43,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:56:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 4086 transitions. [2023-12-25 09:56:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-25 09:56:43,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:43,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:43,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:43,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:43,936 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:43,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1967886148, now seen corresponding path program 1 times [2023-12-25 09:56:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873909318] [2023-12-25 09:56:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:43,938 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:43,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 09:56:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:43,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:56:43,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:43,994 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:56:43,995 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:56:43,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873909318] [2023-12-25 09:56:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873909318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:56:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:56:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:56:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046404533] [2023-12-25 09:56:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:56:43,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:56:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:56:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:43,996 INFO L87 Difference]: Start difference. First operand 3424 states and 4086 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:56:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:44,019 INFO L93 Difference]: Finished difference Result 5050 states and 6055 transitions. [2023-12-25 09:56:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:56:44,021 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 65 [2023-12-25 09:56:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:44,023 INFO L225 Difference]: With dead ends: 5050 [2023-12-25 09:56:44,023 INFO L226 Difference]: Without dead ends: 1806 [2023-12-25 09:56:44,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:56:44,027 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 82 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:56:44,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 82 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:56:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2023-12-25 09:56:44,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1792. [2023-12-25 09:56:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1791 states have (on average 1.192071468453378) internal successors, (2135), 1791 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call 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:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2135 transitions. [2023-12-25 09:56:44,051 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2135 transitions. Word has length 65 [2023-12-25 09:56:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:44,051 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 2135 transitions. [2023-12-25 09:56:44,051 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:56:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2135 transitions. [2023-12-25 09:56:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 09:56:44,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:44,052 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:44,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-25 09:56:44,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:44,254 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:44,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash -394454054, now seen corresponding path program 1 times [2023-12-25 09:56:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317923066] [2023-12-25 09:56:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:44,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:44,257 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:44,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 09:56:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:44,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:56:44,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:44,776 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:56:44,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:44,958 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:56:44,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317923066] [2023-12-25 09:56:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317923066] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:44,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:44,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-12-25 09:56:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125016964] [2023-12-25 09:56:44,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:44,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:56:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:56:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:56:44,960 INFO L87 Difference]: Start difference. First operand 1792 states and 2135 transitions. Second operand has 17 states, 17 states have (on average 6.882352941176471) internal successors, (117), 17 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call 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:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:56:45,354 INFO L93 Difference]: Finished difference Result 2877 states and 3470 transitions. [2023-12-25 09:56:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 09:56:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.882352941176471) internal successors, (117), 17 states have internal predecessors, (117), 0 states have call successors, (0), 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 66 [2023-12-25 09:56:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:56:45,362 INFO L225 Difference]: With dead ends: 2877 [2023-12-25 09:56:45,362 INFO L226 Difference]: Without dead ends: 2139 [2023-12-25 09:56:45,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 115 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:56:45,363 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 398 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:56:45,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 715 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:56:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-12-25 09:56:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1654. [2023-12-25 09:56:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.191167574107683) internal successors, (1969), 1653 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call 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:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1969 transitions. [2023-12-25 09:56:45,376 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1969 transitions. Word has length 66 [2023-12-25 09:56:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:56:45,376 INFO L495 AbstractCegarLoop]: Abstraction has 1654 states and 1969 transitions. [2023-12-25 09:56:45,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.882352941176471) internal successors, (117), 17 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call 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:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1969 transitions. [2023-12-25 09:56:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:56:45,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:56:45,377 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:56:45,379 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 (24)] Ended with exit code 0 [2023-12-25 09:56:45,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:45,580 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:56:45,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:56:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash 350606184, now seen corresponding path program 1 times [2023-12-25 09:56:45,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:56:45,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243655571] [2023-12-25 09:56:45,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:56:45,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:56:45,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:56:45,581 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:56:45,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-25 09:56:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:56:45,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 09:56:45,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:56:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 22 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:47,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:56:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:56:48,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:56:48,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243655571] [2023-12-25 09:56:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243655571] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:56:48,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:56:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 43 [2023-12-25 09:56:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117593140] [2023-12-25 09:56:48,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:56:48,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 09:56:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:56:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 09:56:48,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 09:56:48,988 INFO L87 Difference]: Start difference. First operand 1654 states and 1969 transitions. Second operand has 43 states, 43 states have (on average 4.930232558139535) internal successors, (212), 43 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:34,462 INFO L93 Difference]: Finished difference Result 8557 states and 10256 transitions. [2023-12-25 09:57:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2023-12-25 09:57:34,463 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.930232558139535) internal successors, (212), 43 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:57:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:34,469 INFO L225 Difference]: With dead ends: 8557 [2023-12-25 09:57:34,469 INFO L226 Difference]: Without dead ends: 7420 [2023-12-25 09:57:34,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32870 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=8959, Invalid=72551, Unknown=0, NotChecked=0, Total=81510 [2023-12-25 09:57:34,475 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 3289 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3289 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:34,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3289 Valid, 2861 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 09:57:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2023-12-25 09:57:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 3166. [2023-12-25 09:57:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3166 states, 3165 states have (on average 1.1829383886255924) internal successors, (3744), 3165 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call 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:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 3744 transitions. [2023-12-25 09:57:34,516 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 3744 transitions. Word has length 110 [2023-12-25 09:57:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:34,516 INFO L495 AbstractCegarLoop]: Abstraction has 3166 states and 3744 transitions. [2023-12-25 09:57:34,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.930232558139535) internal successors, (212), 43 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 3744 transitions. [2023-12-25 09:57:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 09:57:34,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:34,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 09:57:34,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:57:34,721 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:34,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1833940289, now seen corresponding path program 1 times [2023-12-25 09:57:34,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:34,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184248116] [2023-12-25 09:57:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:34,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:34,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:34,723 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:57:34,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 09:57:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:34,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:57:34,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 62 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:57:35,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 62 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 09:57:35,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184248116] [2023-12-25 09:57:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184248116] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:35,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:35,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:57:35,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116242583] [2023-12-25 09:57:35,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:35,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:57:35,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:35,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:57:35,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:57:35,498 INFO L87 Difference]: Start difference. First operand 3166 states and 3744 transitions. Second operand has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 17 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:57:36,140 INFO L93 Difference]: Finished difference Result 5174 states and 6139 transitions. [2023-12-25 09:57:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 09:57:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 17 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2023-12-25 09:57:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:57:36,144 INFO L225 Difference]: With dead ends: 5174 [2023-12-25 09:57:36,144 INFO L226 Difference]: Without dead ends: 2287 [2023-12-25 09:57:36,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 202 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:57:36,147 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 454 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:57:36,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 398 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:57:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2023-12-25 09:57:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1910. [2023-12-25 09:57:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 1.1671031953902566) internal successors, (2228), 1909 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2228 transitions. [2023-12-25 09:57:36,160 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2228 transitions. Word has length 110 [2023-12-25 09:57:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:57:36,160 INFO L495 AbstractCegarLoop]: Abstraction has 1910 states and 2228 transitions. [2023-12-25 09:57:36,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 17 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:57:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2228 transitions. [2023-12-25 09:57:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 09:57:36,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:57:36,161 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:57:36,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-25 09:57:36,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:57:36,364 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:57:36,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:57:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2071722289, now seen corresponding path program 1 times [2023-12-25 09:57:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:57:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765561907] [2023-12-25 09:57:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:57:36,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:36,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:57:36,366 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:57:36,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 09:57:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:57:36,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 09:57:36,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:57:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 32 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:39,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:57:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:57:41,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:57:41,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765561907] [2023-12-25 09:57:41,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765561907] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:57:41,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:57:41,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2023-12-25 09:57:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304180791] [2023-12-25 09:57:41,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:57:41,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-25 09:57:41,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:57:41,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-25 09:57:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2635, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 09:57:41,277 INFO L87 Difference]: Start difference. First operand 1910 states and 2228 transitions. Second operand has 55 states, 55 states have (on average 3.8) internal successors, (209), 55 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:58:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:42,133 INFO L93 Difference]: Finished difference Result 9291 states and 10968 transitions. [2023-12-25 09:58:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2023-12-25 09:58:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.8) internal successors, (209), 55 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) Word has length 111 [2023-12-25 09:58:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:42,137 INFO L225 Difference]: With dead ends: 9291 [2023-12-25 09:58:42,138 INFO L226 Difference]: Without dead ends: 7580 [2023-12-25 09:58:42,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30569 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=9486, Invalid=72024, Unknown=0, NotChecked=0, Total=81510 [2023-12-25 09:58:42,142 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 3194 mSDsluCounter, 5159 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3194 SdHoareTripleChecker+Valid, 5315 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:42,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3194 Valid, 5315 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 09:58:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7580 states. [2023-12-25 09:58:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7580 to 3660. [2023-12-25 09:58:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 3659 states have (on average 1.1705383984695272) internal successors, (4283), 3659 states have internal predecessors, (4283), 0 states have call successors, (0), 0 states have call 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:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4283 transitions. [2023-12-25 09:58:42,184 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4283 transitions. Word has length 111 [2023-12-25 09:58:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:42,184 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 4283 transitions. [2023-12-25 09:58:42,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.8) internal successors, (209), 55 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:58:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4283 transitions. [2023-12-25 09:58:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 09:58:42,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:42,185 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, 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:42,187 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:58:42,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:42,385 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:42,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1797929648, now seen corresponding path program 1 times [2023-12-25 09:58:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:42,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748469357] [2023-12-25 09:58:42,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:42,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:42,387 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:58:42,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 09:58:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:42,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 09:58:42,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:44,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:44,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748469357] [2023-12-25 09:58:44,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748469357] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:44,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:44,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2023-12-25 09:58:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460230331] [2023-12-25 09:58:44,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:44,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 09:58:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 09:58:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 09:58:44,601 INFO L87 Difference]: Start difference. First operand 3660 states and 4283 transitions. Second operand has 35 states, 35 states have (on average 5.771428571428571) internal successors, (202), 35 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call 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:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:52,675 INFO L93 Difference]: Finished difference Result 9419 states and 11029 transitions. [2023-12-25 09:58:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-25 09:58:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.771428571428571) internal successors, (202), 35 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-25 09:58:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:52,680 INFO L225 Difference]: With dead ends: 9419 [2023-12-25 09:58:52,680 INFO L226 Difference]: Without dead ends: 6627 [2023-12-25 09:58:52,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1216, Invalid=10340, Unknown=0, NotChecked=0, Total=11556 [2023-12-25 09:58:52,683 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 1470 mSDsluCounter, 5768 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 6045 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:52,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 6045 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-25 09:58:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2023-12-25 09:58:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 5172. [2023-12-25 09:58:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5172 states, 5171 states have (on average 1.1649584219686715) internal successors, (6024), 5171 states have internal predecessors, (6024), 0 states have call successors, (0), 0 states have call 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:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 6024 transitions. [2023-12-25 09:58:52,736 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 6024 transitions. Word has length 111 [2023-12-25 09:58:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:52,736 INFO L495 AbstractCegarLoop]: Abstraction has 5172 states and 6024 transitions. [2023-12-25 09:58:52,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.771428571428571) internal successors, (202), 35 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call 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:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 6024 transitions. [2023-12-25 09:58:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-25 09:58:52,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:52,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:58:52,743 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:58:52,941 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:58:52,941 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:52,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:52,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2097555340, now seen corresponding path program 1 times [2023-12-25 09:58:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:52,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066109349] [2023-12-25 09:58:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:52,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:52,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:52,943 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:58:52,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 09:58:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:53,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 09:58:53,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:53,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:53,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066109349] [2023-12-25 09:58:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066109349] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:53,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2023-12-25 09:58:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169072924] [2023-12-25 09:58:53,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:53,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:58:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:53,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:58:53,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:58:53,408 INFO L87 Difference]: Start difference. First operand 5172 states and 6024 transitions. Second operand has 16 states, 16 states have (on average 9.125) internal successors, (146), 16 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call 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:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:53,964 INFO L93 Difference]: Finished difference Result 11098 states and 13067 transitions. [2023-12-25 09:58:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 09:58:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.125) internal successors, (146), 16 states have internal predecessors, (146), 0 states have call successors, (0), 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 112 [2023-12-25 09:58:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:54,000 INFO L225 Difference]: With dead ends: 11098 [2023-12-25 09:58:54,000 INFO L226 Difference]: Without dead ends: 9072 [2023-12-25 09:58:54,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 212 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:58:54,004 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 421 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:54,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1325 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:58:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9072 states. [2023-12-25 09:58:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9072 to 6734. [2023-12-25 09:58:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6734 states, 6733 states have (on average 1.1664933907619188) internal successors, (7854), 6733 states have internal predecessors, (7854), 0 states have call successors, (0), 0 states have call 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:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 7854 transitions. [2023-12-25 09:58:54,079 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 7854 transitions. Word has length 112 [2023-12-25 09:58:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:54,079 INFO L495 AbstractCegarLoop]: Abstraction has 6734 states and 7854 transitions. [2023-12-25 09:58:54,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.125) internal successors, (146), 16 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call 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:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 7854 transitions. [2023-12-25 09:58:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-25 09:58:54,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:54,081 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, 1, 1, 1] [2023-12-25 09:58:54,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-25 09:58:54,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:54,284 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:54,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1898208324, now seen corresponding path program 1 times [2023-12-25 09:58:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269880775] [2023-12-25 09:58:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:54,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:54,286 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:58:54,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 09:58:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:54,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:58:54,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:58:54,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 68 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:58:55,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269880775] [2023-12-25 09:58:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269880775] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:55,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:58:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464878582] [2023-12-25 09:58:55,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:55,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:58:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:55,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:58:55,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:58:55,216 INFO L87 Difference]: Start difference. First operand 6734 states and 7854 transitions. Second operand has 23 states, 23 states have (on average 8.695652173913043) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call 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:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:58:56,430 INFO L93 Difference]: Finished difference Result 13307 states and 15499 transitions. [2023-12-25 09:58:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 09:58:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.695652173913043) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 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 112 [2023-12-25 09:58:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:58:56,438 INFO L225 Difference]: With dead ends: 13307 [2023-12-25 09:58:56,438 INFO L226 Difference]: Without dead ends: 7911 [2023-12-25 09:58:56,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=365, Invalid=1357, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 09:58:56,443 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 1021 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:58:56,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 1477 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:58:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7911 states. [2023-12-25 09:58:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7911 to 5478. [2023-12-25 09:58:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1537337958736535) internal successors, (6319), 5477 states have internal predecessors, (6319), 0 states have call successors, (0), 0 states have call 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:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6319 transitions. [2023-12-25 09:58:56,485 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6319 transitions. Word has length 112 [2023-12-25 09:58:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:58:56,486 INFO L495 AbstractCegarLoop]: Abstraction has 5478 states and 6319 transitions. [2023-12-25 09:58:56,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.695652173913043) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call 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:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6319 transitions. [2023-12-25 09:58:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 09:58:56,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:58:56,487 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, 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:58:56,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 (30)] Forceful destruction successful, exit code 0 [2023-12-25 09:58:56,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:58:56,698 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:58:56,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:58:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1611862054, now seen corresponding path program 1 times [2023-12-25 09:58:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:58:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23199636] [2023-12-25 09:58:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:58:56,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_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:56,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:58:56,700 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:58:56,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 09:58:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:58:56,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:58:56,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:58:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:58,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:58:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:58:59,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:58:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23199636] [2023-12-25 09:58:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23199636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:58:59,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:58:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2023-12-25 09:58:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467387469] [2023-12-25 09:58:59,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:58:59,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-25 09:58:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:58:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-25 09:58:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 09:58:59,282 INFO L87 Difference]: Start difference. First operand 5478 states and 6319 transitions. Second operand has 40 states, 40 states have (on average 5.3) internal successors, (212), 40 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:59:12,053 INFO L93 Difference]: Finished difference Result 12366 states and 14364 transitions. [2023-12-25 09:59:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2023-12-25 09:59:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.3) internal successors, (212), 40 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-12-25 09:59:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:59:12,061 INFO L225 Difference]: With dead ends: 12366 [2023-12-25 09:59:12,061 INFO L226 Difference]: Without dead ends: 8464 [2023-12-25 09:59:12,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8303 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=3706, Invalid=20474, Unknown=0, NotChecked=0, Total=24180 [2023-12-25 09:59:12,065 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 1609 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:59:12,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 3557 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-25 09:59:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states. [2023-12-25 09:59:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 5558. [2023-12-25 09:59:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 5557 states have (on average 1.1535000899766061) internal successors, (6410), 5557 states have internal predecessors, (6410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 6410 transitions. [2023-12-25 09:59:12,112 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 6410 transitions. Word has length 113 [2023-12-25 09:59:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:59:12,112 INFO L495 AbstractCegarLoop]: Abstraction has 5558 states and 6410 transitions. [2023-12-25 09:59:12,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.3) internal successors, (212), 40 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 6410 transitions. [2023-12-25 09:59:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 09:59:12,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:59:12,113 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, 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:59:12,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 09:59:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:59:12,314 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:59:12,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:59:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -621103024, now seen corresponding path program 1 times [2023-12-25 09:59:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:59:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281280563] [2023-12-25 09:59:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:59:12,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:59:12,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:59:12,316 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:59:12,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 09:59:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:59:12,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:59:12,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:59:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 38 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:13,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:59:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:14,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:59:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281280563] [2023-12-25 09:59:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281280563] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:59:14,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:59:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2023-12-25 09:59:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916479625] [2023-12-25 09:59:14,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:59:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:59:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:59:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:59:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:59:14,587 INFO L87 Difference]: Start difference. First operand 5558 states and 6410 transitions. Second operand has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 38 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:59:25,731 INFO L93 Difference]: Finished difference Result 12538 states and 14518 transitions. [2023-12-25 09:59:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2023-12-25 09:59:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 38 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-12-25 09:59:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:59:25,737 INFO L225 Difference]: With dead ends: 12538 [2023-12-25 09:59:25,737 INFO L226 Difference]: Without dead ends: 8648 [2023-12-25 09:59:25,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8759 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3718, Invalid=22364, Unknown=0, NotChecked=0, Total=26082 [2023-12-25 09:59:25,741 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 1328 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 4713 SdHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-25 09:59:25,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 4713 Invalid, 2319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-25 09:59:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8648 states. [2023-12-25 09:59:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8648 to 5889. [2023-12-25 09:59:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5889 states, 5888 states have (on average 1.1548913043478262) internal successors, (6800), 5888 states have internal predecessors, (6800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5889 states to 5889 states and 6800 transitions. [2023-12-25 09:59:25,786 INFO L78 Accepts]: Start accepts. Automaton has 5889 states and 6800 transitions. Word has length 113 [2023-12-25 09:59:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:59:25,786 INFO L495 AbstractCegarLoop]: Abstraction has 5889 states and 6800 transitions. [2023-12-25 09:59:25,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 38 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5889 states and 6800 transitions. [2023-12-25 09:59:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 09:59:25,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:59:25,788 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, 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:59:25,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-25 09:59:25,990 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:59:25,990 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:59:25,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:59:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1393514769, now seen corresponding path program 1 times [2023-12-25 09:59:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:59:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106392536] [2023-12-25 09:59:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:59:25,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:59:25,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:59:25,992 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:59:25,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:59:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:59:26,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 09:59:26,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:59:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:27,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:59:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:28,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:59:28,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106392536] [2023-12-25 09:59:28,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106392536] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:59:28,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:59:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2023-12-25 09:59:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778733212] [2023-12-25 09:59:28,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:59:28,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 09:59:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:59:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 09:59:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 09:59:28,145 INFO L87 Difference]: Start difference. First operand 5889 states and 6800 transitions. Second operand has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 35 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:59:44,277 INFO L93 Difference]: Finished difference Result 19755 states and 23121 transitions. [2023-12-25 09:59:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-12-25 09:59:44,278 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 35 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-12-25 09:59:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:59:44,288 INFO L225 Difference]: With dead ends: 19755 [2023-12-25 09:59:44,289 INFO L226 Difference]: Without dead ends: 14669 [2023-12-25 09:59:44,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6515 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=2337, Invalid=17685, Unknown=0, NotChecked=0, Total=20022 [2023-12-25 09:59:44,295 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1947 mSDsluCounter, 6295 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1947 SdHoareTripleChecker+Valid, 6643 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-25 09:59:44,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1947 Valid, 6643 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2766 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-25 09:59:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14669 states. [2023-12-25 09:59:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14669 to 7666. [2023-12-25 09:59:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7666 states, 7665 states have (on average 1.1598173515981736) internal successors, (8890), 7665 states have internal predecessors, (8890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7666 states to 7666 states and 8890 transitions. [2023-12-25 09:59:44,373 INFO L78 Accepts]: Start accepts. Automaton has 7666 states and 8890 transitions. Word has length 113 [2023-12-25 09:59:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:59:44,373 INFO L495 AbstractCegarLoop]: Abstraction has 7666 states and 8890 transitions. [2023-12-25 09:59:44,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 35 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7666 states and 8890 transitions. [2023-12-25 09:59:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:59:44,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:59:44,374 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, 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:59:44,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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 09:59:44,576 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:59:44,577 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:59:44,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:59:44,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2122135523, now seen corresponding path program 1 times [2023-12-25 09:59:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:59:44,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128657625] [2023-12-25 09:59:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:59:44,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:59:44,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:59:44,578 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:59:44,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-25 09:59:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:59:44,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 09:59:44,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:59:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 19 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:45,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:59:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 19 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:46,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:59:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128657625] [2023-12-25 09:59:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128657625] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:59:46,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:59:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2023-12-25 09:59:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297083918] [2023-12-25 09:59:46,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:59:46,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 09:59:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:59:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 09:59:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2023-12-25 09:59:46,159 INFO L87 Difference]: Start difference. First operand 7666 states and 8890 transitions. Second operand has 27 states, 27 states have (on average 8.074074074074074) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:59:48,321 INFO L93 Difference]: Finished difference Result 12643 states and 14679 transitions. [2023-12-25 09:59:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 09:59:48,322 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.074074074074074) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-25 09:59:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:59:48,327 INFO L225 Difference]: With dead ends: 12643 [2023-12-25 09:59:48,327 INFO L226 Difference]: Without dead ends: 10676 [2023-12-25 09:59:48,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=378, Invalid=2484, Unknown=0, NotChecked=0, Total=2862 [2023-12-25 09:59:48,329 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 818 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:59:48,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 2759 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 09:59:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2023-12-25 09:59:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 7662. [2023-12-25 09:59:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7662 states, 7661 states have (on average 1.1597702649784623) internal successors, (8885), 7661 states have internal predecessors, (8885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 8885 transitions. [2023-12-25 09:59:48,384 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 8885 transitions. Word has length 114 [2023-12-25 09:59:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:59:48,384 INFO L495 AbstractCegarLoop]: Abstraction has 7662 states and 8885 transitions. [2023-12-25 09:59:48,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.074074074074074) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:59:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 8885 transitions. [2023-12-25 09:59:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-25 09:59:48,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:59:48,386 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, 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:59:48,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-25 09:59:48,587 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:59:48,587 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:59:48,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:59:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash 498852538, now seen corresponding path program 1 times [2023-12-25 09:59:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:59:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175220832] [2023-12-25 09:59:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:59:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:59:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:59:48,589 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:59:48,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:59:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:59:48,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 09:59:48,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:59:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 143 proven. 76 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 09:59:49,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:59:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 55 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:59:51,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:59:51,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175220832] [2023-12-25 09:59:51,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175220832] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:59:51,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:59:51,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2023-12-25 09:59:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916927641] [2023-12-25 09:59:51,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:59:51,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 09:59:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:59:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 09:59:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 09:59:51,025 INFO L87 Difference]: Start difference. First operand 7662 states and 8885 transitions. Second operand has 38 states, 38 states have (on average 7.421052631578948) internal successors, (282), 38 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:00:45,688 INFO L93 Difference]: Finished difference Result 27837 states and 32447 transitions. [2023-12-25 10:00:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2023-12-25 10:00:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.421052631578948) internal successors, (282), 38 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2023-12-25 10:00:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:00:45,704 INFO L225 Difference]: With dead ends: 27837 [2023-12-25 10:00:45,704 INFO L226 Difference]: Without dead ends: 23254 [2023-12-25 10:00:45,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38930 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=11430, Invalid=81900, Unknown=0, NotChecked=0, Total=93330 [2023-12-25 10:00:45,712 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 2808 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2808 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-25 10:00:45,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2808 Valid, 4964 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-25 10:00:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23254 states. [2023-12-25 10:00:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23254 to 13027. [2023-12-25 10:00:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13027 states, 13026 states have (on average 1.1601412559496391) internal successors, (15112), 13026 states have internal predecessors, (15112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 15112 transitions. [2023-12-25 10:00:45,857 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 15112 transitions. Word has length 157 [2023-12-25 10:00:45,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:00:45,857 INFO L495 AbstractCegarLoop]: Abstraction has 13027 states and 15112 transitions. [2023-12-25 10:00:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.421052631578948) internal successors, (282), 38 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 15112 transitions. [2023-12-25 10:00:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:00:45,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:00:45,860 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, 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 10:00:45,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-12-25 10:00:46,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:00:46,063 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:00:46,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:00:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash 634102606, now seen corresponding path program 1 times [2023-12-25 10:00:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:00:46,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013799525] [2023-12-25 10:00:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:00:46,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:00:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:00:46,064 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:00:46,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-25 10:00:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:00:46,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 10:00:46,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:00:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 10:00:46,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:00:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 10:00:46,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:00:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013799525] [2023-12-25 10:00:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013799525] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:00:46,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:00:46,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 10:00:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891656338] [2023-12-25 10:00:46,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:00:46,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 10:00:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:00:46,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 10:00:46,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 10:00:46,523 INFO L87 Difference]: Start difference. First operand 13027 states and 15112 transitions. Second operand has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:00:46,765 INFO L93 Difference]: Finished difference Result 51462 states and 61938 transitions. [2023-12-25 10:00:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 10:00:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-12-25 10:00:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:00:46,796 INFO L225 Difference]: With dead ends: 51462 [2023-12-25 10:00:46,796 INFO L226 Difference]: Without dead ends: 39285 [2023-12-25 10:00:46,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-25 10:00:46,805 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 334 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 10:00:46,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 888 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 10:00:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39285 states. [2023-12-25 10:00:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39285 to 39277. [2023-12-25 10:00:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39277 states, 39276 states have (on average 1.1286790915571852) internal successors, (44330), 39276 states have internal predecessors, (44330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39277 states to 39277 states and 44330 transitions. [2023-12-25 10:00:47,154 INFO L78 Accepts]: Start accepts. Automaton has 39277 states and 44330 transitions. Word has length 159 [2023-12-25 10:00:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:00:47,154 INFO L495 AbstractCegarLoop]: Abstraction has 39277 states and 44330 transitions. [2023-12-25 10:00:47,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39277 states and 44330 transitions. [2023-12-25 10:00:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:00:47,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:00:47,157 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, 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 10:00:47,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-25 10:00:47,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:00:47,359 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:00:47,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:00:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 19062926, now seen corresponding path program 1 times [2023-12-25 10:00:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:00:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049206370] [2023-12-25 10:00:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:00:47,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:00:47,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:00:47,361 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:00:47,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-25 10:00:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:00:47,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 10:00:47,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:00:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 48 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:00:48,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:00:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 48 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:00:48,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:00:48,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049206370] [2023-12-25 10:00:48,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049206370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:00:48,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:00:48,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 10:00:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911954559] [2023-12-25 10:00:48,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:00:48,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:00:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:00:48,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:00:48,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:00:48,925 INFO L87 Difference]: Start difference. First operand 39277 states and 44330 transitions. Second operand has 33 states, 33 states have (on average 9.030303030303031) internal successors, (298), 33 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:00:54,461 INFO L93 Difference]: Finished difference Result 68828 states and 77962 transitions. [2023-12-25 10:00:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-12-25 10:00:54,462 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 9.030303030303031) internal successors, (298), 33 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-12-25 10:00:54,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:00:54,496 INFO L225 Difference]: With dead ends: 68828 [2023-12-25 10:00:54,496 INFO L226 Difference]: Without dead ends: 40952 [2023-12-25 10:00:54,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1518, Invalid=9194, Unknown=0, NotChecked=0, Total=10712 [2023-12-25 10:00:54,515 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 1190 mSDsluCounter, 3639 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 3797 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 10:00:54,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 3797 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 10:00:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40952 states. [2023-12-25 10:00:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40952 to 36723. [2023-12-25 10:00:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36723 states, 36722 states have (on average 1.127879745111922) internal successors, (41418), 36722 states have internal predecessors, (41418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36723 states to 36723 states and 41418 transitions. [2023-12-25 10:00:54,915 INFO L78 Accepts]: Start accepts. Automaton has 36723 states and 41418 transitions. Word has length 159 [2023-12-25 10:00:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:00:54,915 INFO L495 AbstractCegarLoop]: Abstraction has 36723 states and 41418 transitions. [2023-12-25 10:00:54,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.030303030303031) internal successors, (298), 33 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:00:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 36723 states and 41418 transitions. [2023-12-25 10:00:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:00:54,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:00:54,917 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, 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 10:00:54,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-25 10:00:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:00:55,120 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:00:55,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:00:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1963717778, now seen corresponding path program 1 times [2023-12-25 10:00:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:00:55,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465271783] [2023-12-25 10:00:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:00:55,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:00:55,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:00:55,121 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:00:55,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-25 10:00:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 10:00:55,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 10:00:55,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 10:00:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 32 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:00:56,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 10:00:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 32 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 10:00:56,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 10:00:56,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465271783] [2023-12-25 10:00:56,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465271783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 10:00:56,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 10:00:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-12-25 10:00:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999783249] [2023-12-25 10:00:56,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 10:00:56,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 10:00:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 10:00:56,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 10:00:56,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 10:00:56,559 INFO L87 Difference]: Start difference. First operand 36723 states and 41418 transitions. Second operand has 33 states, 33 states have (on average 9.06060606060606) internal successors, (299), 33 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 10:01:04,207 INFO L93 Difference]: Finished difference Result 75678 states and 85864 transitions. [2023-12-25 10:01:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2023-12-25 10:01:04,207 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 9.06060606060606) internal successors, (299), 33 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2023-12-25 10:01:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 10:01:04,243 INFO L225 Difference]: With dead ends: 75678 [2023-12-25 10:01:04,243 INFO L226 Difference]: Without dead ends: 41802 [2023-12-25 10:01:04,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6002 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2650, Invalid=17090, Unknown=0, NotChecked=0, Total=19740 [2023-12-25 10:01:04,263 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1648 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 10:01:04,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 3448 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 10:01:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41802 states. [2023-12-25 10:01:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41802 to 32609. [2023-12-25 10:01:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32609 states, 32608 states have (on average 1.123834641805692) internal successors, (36646), 32608 states have internal predecessors, (36646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32609 states to 32609 states and 36646 transitions. [2023-12-25 10:01:04,604 INFO L78 Accepts]: Start accepts. Automaton has 32609 states and 36646 transitions. Word has length 159 [2023-12-25 10:01:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 10:01:04,604 INFO L495 AbstractCegarLoop]: Abstraction has 32609 states and 36646 transitions. [2023-12-25 10:01:04,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.06060606060606) internal successors, (299), 33 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 10:01:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 32609 states and 36646 transitions. [2023-12-25 10:01:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-25 10:01:04,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 10:01:04,606 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, 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 10:01:04,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-12-25 10:01:04,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:04,809 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 10:01:04,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 10:01:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash -44198184, now seen corresponding path program 1 times [2023-12-25 10:01:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 10:01:04,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505929450] [2023-12-25 10:01:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 10:01:04,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:04,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 10:01:04,811 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 10:01:04,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-25 10:01:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:01:04,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 10:01:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 10:01:05,010 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 10:01:05,011 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 10:01:05,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 10:01:05,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-12-25 10:01:05,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 10:01:05,219 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 10:01:05,221 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 10:01:05,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 10:01:05 BoogieIcfgContainer [2023-12-25 10:01:05,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 10:01:05,339 INFO L158 Benchmark]: Toolchain (without parser) took 309641.52ms. Allocated memory was 289.4MB in the beginning and 723.5MB in the end (delta: 434.1MB). Free memory was 235.9MB in the beginning and 241.4MB in the end (delta: -5.5MB). Peak memory consumption was 429.4MB. Max. memory is 8.0GB. [2023-12-25 10:01:05,339 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory was 166.2MB in the beginning and 166.1MB in the end (delta: 155.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 10:01:05,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.16ms. Allocated memory is still 289.4MB. Free memory was 235.9MB in the beginning and 220.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 10:01:05,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.99ms. Allocated memory is still 289.4MB. Free memory was 220.6MB in the beginning and 218.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 10:01:05,339 INFO L158 Benchmark]: Boogie Preprocessor took 77.50ms. Allocated memory is still 289.4MB. Free memory was 218.4MB in the beginning and 215.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 10:01:05,339 INFO L158 Benchmark]: RCFGBuilder took 528.67ms. Allocated memory is still 289.4MB. Free memory was 215.7MB in the beginning and 248.5MB in the end (delta: -32.7MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. [2023-12-25 10:01:05,339 INFO L158 Benchmark]: TraceAbstraction took 308694.91ms. Allocated memory was 289.4MB in the beginning and 723.5MB in the end (delta: 434.1MB). Free memory was 247.9MB in the beginning and 241.4MB in the end (delta: 6.5MB). Peak memory consumption was 440.6MB. Max. memory is 8.0GB. [2023-12-25 10:01:05,340 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory was 166.2MB in the beginning and 166.1MB in the end (delta: 155.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.16ms. Allocated memory is still 289.4MB. Free memory was 235.9MB in the beginning and 220.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.99ms. Allocated memory is still 289.4MB. Free memory was 220.6MB in the beginning and 218.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.50ms. Allocated memory is still 289.4MB. Free memory was 218.4MB in the beginning and 215.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 528.67ms. Allocated memory is still 289.4MB. Free memory was 215.7MB in the beginning and 248.5MB in the end (delta: -32.7MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. * TraceAbstraction took 308694.91ms. Allocated memory was 289.4MB in the beginning and 723.5MB in the end (delta: 434.1MB). Free memory was 247.9MB in the beginning and 241.4MB in the end (delta: 6.5MB). Peak memory consumption was 440.6MB. 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: 201]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] unsigned char r1 = '\x0'; [L28] port_t p1 = 0; [L29] char p1_old = '\x0'; [L30] char p1_new = '\x0'; [L31] char id1 = '\x0'; [L32] char st1 = '\x0'; [L33] msg_t send1 = '\x0'; [L34] _Bool mode1 = 0; [L35] port_t p2 = 0; [L36] char p2_old = '\x0'; [L37] char p2_new = '\x0'; [L38] char id2 = '\x0'; [L39] char st2 = '\x0'; [L40] msg_t send2 = '\x0'; [L41] _Bool mode2 = 0; [L42] port_t p3 = 0; [L43] char p3_old = '\x0'; [L44] char p3_new = '\x0'; [L45] char id3 = '\x0'; [L46] char st3 = '\x0'; [L47] msg_t send3 = '\x0'; [L48] _Bool mode3 = 0; [L52] void (*nodes[3])() = { &node1, &node2, &node3 }; [L56] int __return_1394; [L57] int __return_1470; [L60] int main__c1; [L61] int main__i2; [L62] main__c1 = 0 [L63] r1 = __VERIFIER_nondet_uchar() [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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394=0, __return_1470=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_1394 = init__tmp [L112] main__i2 = __return_1394 VAL [__return_1394=1, __return_1470=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_1394=1, __return_1470=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] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=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] [L126] COND FALSE !(!(mode1 == 0)) [L360] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=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] [L361] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=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] [L363] COND TRUE p1_new == nomsg [L365] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=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] [L367] p1_new = node1____CPAchecker_TMP_0 [L368] mode1 = 1 VAL [__return_1394=1, __return_1470=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] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=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] [L146] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=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_1394=1, __return_1470=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_1394=1, __return_1470=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_1394=1, __return_1470=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] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=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] [L161] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=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_1394=1, __return_1470=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_1394=1, __return_1470=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_1394=1, __return_1470=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] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=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 TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=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] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=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_1394=1, __return_1470=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] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=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] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __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] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __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] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __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] [L126] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __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] [L128] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __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] [L132] r1 = r1 + 1 [L133] node1__m1 = p3_old [L134] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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 TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L137] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L141] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L146] COND TRUE !(mode2 == 0) [L148] node2__m2 = p1_old [L149] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L152] COND TRUE ((int)node2__m2) > ((int)id2) [L154] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __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=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] [L156] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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 TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L167] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L171] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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 TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __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=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] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __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=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] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __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=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] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L126] COND FALSE !(!(mode1 == 0)) [L360] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __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=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] [L361] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L363] COND TRUE p1_new == nomsg [L365] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=1, __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=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] [L367] p1_new = node1____CPAchecker_TMP_0 [L368] mode1 = 1 VAL [__return_1394=1, __return_1470=1, __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=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] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L146] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L161] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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 TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __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=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] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __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=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] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __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=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] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L126] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __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=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 FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __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=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] [L132] r1 = r1 + 1 [L133] node1__m1 = p3_old [L134] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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 TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L137] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L141] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L146] COND TRUE !(mode2 == 0) [L148] node2__m2 = p1_old [L149] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L152] COND TRUE ((int)node2__m2) > ((int)id2) [L154] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __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=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] [L156] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L167] COND TRUE ((int)node3__m3) > ((int)id3) [L169] send3 = node3__m3 VAL [__return_1394=1, __return_1470=1, __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=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] [L171] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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 TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __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=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] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __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=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] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __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=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] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L126] COND FALSE !(!(mode1 == 0)) [L360] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __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=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] [L361] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L363] COND TRUE p1_new == nomsg [L365] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=1, __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=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] [L367] p1_new = node1____CPAchecker_TMP_0 [L368] mode1 = 1 VAL [__return_1394=1, __return_1470=1, __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=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] [L144] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L146] COND FALSE !(!(mode2 == 0)) [L309] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L159] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L161] COND FALSE !(!(mode3 == 0)) [L264] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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 TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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] [L183] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=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=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] [L186] COND TRUE ((int)r1) < 3 [L188] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __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=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] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __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=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] [L199] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __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=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] [L124] msg_t node1__m1; [L125] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L126] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __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=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 FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __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=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] [L132] r1 = r1 + 1 [L133] node1__m1 = p3_old [L134] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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 TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L137] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L141] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] msg_t node2__m2; [L145] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L146] COND TRUE !(mode2 == 0) [L148] node2__m2 = p1_old [L149] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L152] COND TRUE ((int)node2__m2) > ((int)id2) [L154] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __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=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] [L156] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] msg_t node3__m3; [L160] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __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=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] [L161] COND TRUE !(mode3 == 0) [L163] node3__m3 = p2_old [L164] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __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=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 TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __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=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] [L167] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1394=1, __return_1470=1, __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=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_1394=1, __return_1470=1, __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=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] [L171] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __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=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] [L173] p1_old = p1_new [L174] p1_new = nomsg [L175] p2_old = p2_new [L176] p2_new = nomsg [L177] p3_old = p3_new [L178] p3_new = nomsg [L180] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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] [L181] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L239] check__tmp = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=0, id1=64, id2=0, id3=32, init__tmp=1, main__c1=1, main__i2=0, 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] [L192] __return_1470 = check__tmp [L193] main__c1 = __return_1470 [L195] _Bool __tmp_1; [L196] __tmp_1 = main__c1 [L197] _Bool assert__arg; [L198] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=0, __return_main=0, __tmp_1=0, assert__arg=0, check__tmp=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=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] COND TRUE assert__arg == 0 VAL [__return_1394=1, __return_1470=0, __return_main=0, __tmp_1=0, assert__arg=0, check__tmp=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=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] [L201] reach_error() VAL [__return_1394=1, __return_1470=0, __return_main=0, __tmp_1=0, assert__arg=0, check__tmp=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=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, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 308.5s, OverallIterations: 38, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 262.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34993 SdHoareTripleChecker+Valid, 33.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34993 mSDsluCounter, 57790 SdHoareTripleChecker+Invalid, 30.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53001 mSDsCounter, 647 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26049 IncrementalHoareTripleChecker+Invalid, 26696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 647 mSolverCounterUnsat, 4789 mSDtfsCounter, 26049 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6988 GetRequests, 4633 SyntacticMatches, 4 SemanticMatches, 2351 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 176004 ImplicationChecksByTransitivity, 239.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39277occurred in iteration=35, InterpolantAutomatonStates: 1968, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 70948 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 3167 NumberOfCodeBlocks, 3167 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5083 ConstructedInterpolants, 1288 QuantifiedInterpolants, 65651 SizeOfPredicates, 212 NumberOfNonLiveVariables, 6240 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 57 InterpolantComputations, 17 PerfectInterpolantSequences, 1374/4081 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 10:01:05,479 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...