/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 09:20:24,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 09:20:24,928 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:20:24,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 09:20:24,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 09:20:24,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 09:20:24,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 09:20:24,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 09:20:24,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 09:20:24,960 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 09:20:24,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 09:20:24,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 09:20:24,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 09:20:24,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 09:20:24,962 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 09:20:24,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 09:20:24,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 09:20:24,963 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 09:20:24,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 09:20:24,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 09:20:24,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 09:20:24,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 09:20:24,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 09:20:24,964 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 09:20:24,964 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 09:20:24,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 09:20:24,964 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 09:20:24,964 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 09:20:24,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 09:20:24,964 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 09:20:24,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 09:20:24,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 09:20:24,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 09:20:24,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 09:20:24,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:20:24,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 09:20:24,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 09:20:24,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 09:20:24,966 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 09:20:24,966 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 09:20:24,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 09:20:24,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 09:20:24,967 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 09:20:24,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 09:20:24,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 09:20:24,967 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 09:20:24,967 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:20:25,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 09:20:25,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 09:20:25,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 09:20:25,178 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 09:20:25,178 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 09:20:25,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:20:26,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 09:20:26,248 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 09:20:26,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:20:26,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3522a9b/148b2c48eab749d6991b3f3c2f16c4d4/FLAG2448beaaa [2023-12-25 09:20:26,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3522a9b/148b2c48eab749d6991b3f3c2f16c4d4 [2023-12-25 09:20:26,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 09:20:26,660 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 09:20:26,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 09:20:26,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 09:20:26,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 09:20:26,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42940537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26, skipping insertion in model container [2023-12-25 09:20:26,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 09:20:26,824 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2023-12-25 09:20:26,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:20:26,850 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 09:20:26,870 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2023-12-25 09:20:26,879 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 09:20:26,890 INFO L206 MainTranslator]: Completed translation [2023-12-25 09:20:26,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26 WrapperNode [2023-12-25 09:20:26,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 09:20:26,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 09:20:26,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 09:20:26,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 09:20:26,896 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:20:26" (1/1) ... [2023-12-25 09:20:26,903 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:20:26" (1/1) ... [2023-12-25 09:20:26,921 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 337 [2023-12-25 09:20:26,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 09:20:26,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 09:20:26,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 09:20:26,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 09:20:26,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,948 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:20:26,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 09:20:26,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 09:20:26,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 09:20:26,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 09:20:26,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (1/1) ... [2023-12-25 09:20:26,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 09:20:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 09:20:26,986 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:20:27,025 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:20:27,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 09:20:27,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 09:20:27,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 09:20:27,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 09:20:27,135 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 09:20:27,137 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 09:20:27,469 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 09:20:27,486 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 09:20:27,486 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 09:20:27,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:20:27 BoogieIcfgContainer [2023-12-25 09:20:27,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 09:20:27,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 09:20:27,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 09:20:27,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 09:20:27,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 09:20:26" (1/3) ... [2023-12-25 09:20:27,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335cf04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:20:27, skipping insertion in model container [2023-12-25 09:20:27,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 09:20:26" (2/3) ... [2023-12-25 09:20:27,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335cf04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 09:20:27, skipping insertion in model container [2023-12-25 09:20:27,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 09:20:27" (3/3) ... [2023-12-25 09:20:27,496 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2023-12-25 09:20:27,506 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 09:20:27,507 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 09:20:27,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 09:20:27,537 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;@51e445ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 09:20:27,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 09:20:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 77 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 09:20:27,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:27,548 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:20:27,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:27,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2064705082, now seen corresponding path program 1 times [2023-12-25 09:20:27,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127478354] [2023-12-25 09:20:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:27,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:27,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:27,562 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:20:27,563 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:20:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:27,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:27,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:27,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:27,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127478354] [2023-12-25 09:20:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127478354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:27,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:27,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799277674] [2023-12-25 09:20:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:27,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:27,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:27,718 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 77 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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:20:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:27,758 INFO L93 Difference]: Finished difference Result 180 states and 290 transitions. [2023-12-25 09:20:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:27,760 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:20:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:27,766 INFO L225 Difference]: With dead ends: 180 [2023-12-25 09:20:27,766 INFO L226 Difference]: Without dead ends: 117 [2023-12-25 09:20:27,768 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:20:27,770 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 84 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:27,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-25 09:20:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-12-25 09:20:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5) internal successors, (171), 114 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2023-12-25 09:20:27,794 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 36 [2023-12-25 09:20:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:27,795 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2023-12-25 09:20:27,795 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:20:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2023-12-25 09:20:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 09:20:27,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:27,796 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:20:27,801 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:20:28,000 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:20:28,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:28,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:28,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2100240699, now seen corresponding path program 1 times [2023-12-25 09:20:28,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:28,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417053888] [2023-12-25 09:20:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:28,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:28,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:28,004 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:20:28,005 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:20:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:28,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:28,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:28,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:28,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417053888] [2023-12-25 09:20:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417053888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:28,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777839607] [2023-12-25 09:20:28,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:28,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:28,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:28,141 INFO L87 Difference]: Start difference. First operand 115 states and 171 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:20:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:28,166 INFO L93 Difference]: Finished difference Result 275 states and 423 transitions. [2023-12-25 09:20:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:28,167 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:20:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:28,171 INFO L225 Difference]: With dead ends: 275 [2023-12-25 09:20:28,172 INFO L226 Difference]: Without dead ends: 179 [2023-12-25 09:20:28,172 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:20:28,173 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 211 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:20:28,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-12-25 09:20:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2023-12-25 09:20:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 268 transitions. [2023-12-25 09:20:28,184 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 268 transitions. Word has length 37 [2023-12-25 09:20:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:28,185 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 268 transitions. [2023-12-25 09:20:28,185 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:20:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 268 transitions. [2023-12-25 09:20:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 09:20:28,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:28,186 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:20:28,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 09:20:28,388 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:20:28,388 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:28,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash -923316447, now seen corresponding path program 1 times [2023-12-25 09:20:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:28,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049000311] [2023-12-25 09:20:28,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:28,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:28,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:28,391 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:20:28,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 09:20:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:28,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:28,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:28,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:28,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049000311] [2023-12-25 09:20:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049000311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692593126] [2023-12-25 09:20:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:28,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:28,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:28,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:28,553 INFO L87 Difference]: Start difference. First operand 177 states and 268 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:20:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:28,600 INFO L93 Difference]: Finished difference Result 595 states and 923 transitions. [2023-12-25 09:20:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:28,600 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:20:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:28,603 INFO L225 Difference]: With dead ends: 595 [2023-12-25 09:20:28,603 INFO L226 Difference]: Without dead ends: 437 [2023-12-25 09:20:28,603 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:20:28,604 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 264 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:28,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 332 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-12-25 09:20:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2023-12-25 09:20:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 1.5462962962962963) internal successors, (668), 432 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 668 transitions. [2023-12-25 09:20:28,632 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 668 transitions. Word has length 38 [2023-12-25 09:20:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:28,632 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 668 transitions. [2023-12-25 09:20:28,632 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:20:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 668 transitions. [2023-12-25 09:20:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 09:20:28,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:28,633 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:20:28,638 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:20:28,838 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:20:28,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:28,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1001413948, now seen corresponding path program 1 times [2023-12-25 09:20:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:28,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246871755] [2023-12-25 09:20:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:28,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:28,841 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:20:28,846 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:20:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:28,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:28,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:28,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:28,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:28,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246871755] [2023-12-25 09:20:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246871755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:28,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:28,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:28,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955688844] [2023-12-25 09:20:28,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:28,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:28,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:28,930 INFO L87 Difference]: Start difference. First operand 433 states and 668 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:20:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:28,945 INFO L93 Difference]: Finished difference Result 1129 states and 1750 transitions. [2023-12-25 09:20:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:28,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:20:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:28,948 INFO L225 Difference]: With dead ends: 1129 [2023-12-25 09:20:28,948 INFO L226 Difference]: Without dead ends: 715 [2023-12-25 09:20:28,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:28,955 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 78 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 259 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:20:28,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 259 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-12-25 09:20:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2023-12-25 09:20:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 1.5280898876404494) internal successors, (1088), 712 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1088 transitions. [2023-12-25 09:20:29,009 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1088 transitions. Word has length 38 [2023-12-25 09:20:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:29,009 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1088 transitions. [2023-12-25 09:20:29,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:20:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1088 transitions. [2023-12-25 09:20:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 09:20:29,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:29,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:29,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:29,211 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:20:29,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:29,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1119606870, now seen corresponding path program 1 times [2023-12-25 09:20:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472803097] [2023-12-25 09:20:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:29,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:29,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:29,213 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:20:29,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 09:20:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:29,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:29,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:29,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:29,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:29,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472803097] [2023-12-25 09:20:29,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472803097] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:29,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:29,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:20:29,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224636141] [2023-12-25 09:20:29,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:29,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:29,497 INFO L87 Difference]: Start difference. First operand 713 states and 1088 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 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:20:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:29,623 INFO L93 Difference]: Finished difference Result 2101 states and 3226 transitions. [2023-12-25 09:20:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:29,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 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:20:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:29,627 INFO L225 Difference]: With dead ends: 2101 [2023-12-25 09:20:29,627 INFO L226 Difference]: Without dead ends: 1407 [2023-12-25 09:20:29,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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:20:29,628 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 267 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:29,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 129 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2023-12-25 09:20:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1405. [2023-12-25 09:20:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.5242165242165242) internal successors, (2140), 1404 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2140 transitions. [2023-12-25 09:20:29,649 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2140 transitions. Word has length 40 [2023-12-25 09:20:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:29,649 INFO L495 AbstractCegarLoop]: Abstraction has 1405 states and 2140 transitions. [2023-12-25 09:20:29,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 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:20:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2140 transitions. [2023-12-25 09:20:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-25 09:20:29,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:29,650 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:20:29,657 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:20:29,856 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:20:29,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:29,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:29,857 INFO L85 PathProgramCache]: Analyzing trace with hash -790055281, now seen corresponding path program 1 times [2023-12-25 09:20:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151211852] [2023-12-25 09:20:29,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:29,859 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:20:29,860 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:20:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:29,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:29,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:30,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:30,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151211852] [2023-12-25 09:20:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151211852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042785972] [2023-12-25 09:20:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:30,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:30,101 INFO L87 Difference]: Start difference. First operand 1405 states and 2140 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:20:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:30,154 INFO L93 Difference]: Finished difference Result 5621 states and 8580 transitions. [2023-12-25 09:20:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:20:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:30,166 INFO L225 Difference]: With dead ends: 5621 [2023-12-25 09:20:30,166 INFO L226 Difference]: Without dead ends: 4235 [2023-12-25 09:20:30,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:20:30,169 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 306 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:30,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 386 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2023-12-25 09:20:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 2789. [2023-12-25 09:20:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2788 states have (on average 1.4935437589670015) internal successors, (4164), 2788 states have internal predecessors, (4164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4164 transitions. [2023-12-25 09:20:30,221 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4164 transitions. Word has length 40 [2023-12-25 09:20:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:30,224 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 4164 transitions. [2023-12-25 09:20:30,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:20:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4164 transitions. [2023-12-25 09:20:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 09:20:30,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:30,226 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:20:30,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:30,428 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:20:30,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:30,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1258633748, now seen corresponding path program 1 times [2023-12-25 09:20:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937584378] [2023-12-25 09:20:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:30,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:30,434 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:20:30,435 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:20:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:30,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 09:20:30,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:30,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:30,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937584378] [2023-12-25 09:20:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937584378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:20:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983729818] [2023-12-25 09:20:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:30,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 09:20:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 09:20:30,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 09:20:30,516 INFO L87 Difference]: Start difference. First operand 2789 states and 4164 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:20:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:30,557 INFO L93 Difference]: Finished difference Result 5751 states and 8501 transitions. [2023-12-25 09:20:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:30,557 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:20:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:30,571 INFO L225 Difference]: With dead ends: 5751 [2023-12-25 09:20:30,571 INFO L226 Difference]: Without dead ends: 5749 [2023-12-25 09:20:30,574 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:20:30,575 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 168 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:30,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 367 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5749 states. [2023-12-25 09:20:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5749 to 2981. [2023-12-25 09:20:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2980 states have (on average 1.461744966442953) internal successors, (4356), 2980 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4356 transitions. [2023-12-25 09:20:30,631 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4356 transitions. Word has length 41 [2023-12-25 09:20:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:30,631 INFO L495 AbstractCegarLoop]: Abstraction has 2981 states and 4356 transitions. [2023-12-25 09:20:30,631 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:20:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4356 transitions. [2023-12-25 09:20:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 09:20:30,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:30,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:30,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:30,840 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:20:30,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:30,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash 373513535, now seen corresponding path program 1 times [2023-12-25 09:20:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:30,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245087519] [2023-12-25 09:20:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:30,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:30,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:30,843 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:20:30,856 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:20:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:30,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:30,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:30,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:30,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245087519] [2023-12-25 09:20:30,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245087519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:30,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:30,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700939328] [2023-12-25 09:20:30,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:30,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:30,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:30,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:30,969 INFO L87 Difference]: Start difference. First operand 2981 states and 4356 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:30,999 INFO L93 Difference]: Finished difference Result 7123 states and 10402 transitions. [2023-12-25 09:20:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:30,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2023-12-25 09:20:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:31,010 INFO L225 Difference]: With dead ends: 7123 [2023-12-25 09:20:31,011 INFO L226 Difference]: Without dead ends: 4161 [2023-12-25 09:20:31,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:31,020 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:31,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2023-12-25 09:20:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 4159. [2023-12-25 09:20:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4159 states, 4158 states have (on average 1.4487734487734487) internal successors, (6024), 4158 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:20:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4159 states to 4159 states and 6024 transitions. [2023-12-25 09:20:31,093 INFO L78 Accepts]: Start accepts. Automaton has 4159 states and 6024 transitions. Word has length 42 [2023-12-25 09:20:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:31,093 INFO L495 AbstractCegarLoop]: Abstraction has 4159 states and 6024 transitions. [2023-12-25 09:20:31,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4159 states and 6024 transitions. [2023-12-25 09:20:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 09:20:31,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:31,096 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] [2023-12-25 09:20:31,101 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:20:31,299 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:20:31,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:31,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1493660826, now seen corresponding path program 1 times [2023-12-25 09:20:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733322679] [2023-12-25 09:20:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:31,301 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:20:31,336 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:20:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:31,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:20:31,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:31,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:32,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733322679] [2023-12-25 09:20:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733322679] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:32,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:20:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739481496] [2023-12-25 09:20:32,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:32,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:20:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:20:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:20:32,006 INFO L87 Difference]: Start difference. First operand 4159 states and 6024 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:36,615 INFO L93 Difference]: Finished difference Result 26904 states and 38268 transitions. [2023-12-25 09:20:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-12-25 09:20:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-25 09:20:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:36,677 INFO L225 Difference]: With dead ends: 26904 [2023-12-25 09:20:36,677 INFO L226 Difference]: Without dead ends: 22766 [2023-12-25 09:20:36,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4707 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2821, Invalid=10061, Unknown=0, NotChecked=0, Total=12882 [2023-12-25 09:20:36,698 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 3207 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3207 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:36,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3207 Valid, 1187 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 09:20:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22766 states. [2023-12-25 09:20:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22766 to 4574. [2023-12-25 09:20:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 4573 states have (on average 1.4380056855455936) internal successors, (6576), 4573 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6576 transitions. [2023-12-25 09:20:36,901 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6576 transitions. Word has length 59 [2023-12-25 09:20:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:36,902 INFO L495 AbstractCegarLoop]: Abstraction has 4574 states and 6576 transitions. [2023-12-25 09:20:36,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6576 transitions. [2023-12-25 09:20:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 09:20:36,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:36,904 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] [2023-12-25 09:20:36,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:37,106 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:20:37,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:37,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1881256847, now seen corresponding path program 1 times [2023-12-25 09:20:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:37,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470150040] [2023-12-25 09:20:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:37,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:37,109 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:20:37,113 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:20:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:37,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:37,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 09:20:37,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:37,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470150040] [2023-12-25 09:20:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470150040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:37,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:37,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 09:20:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746826886] [2023-12-25 09:20:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:37,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:37,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:37,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:37,282 INFO L87 Difference]: Start difference. First operand 4574 states and 6576 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:37,419 INFO L93 Difference]: Finished difference Result 13680 states and 19686 transitions. [2023-12-25 09:20:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:37,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-25 09:20:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:37,433 INFO L225 Difference]: With dead ends: 13680 [2023-12-25 09:20:37,433 INFO L226 Difference]: Without dead ends: 9127 [2023-12-25 09:20:37,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:20:37,441 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 347 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:37,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 137 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2023-12-25 09:20:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 9125. [2023-12-25 09:20:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9125 states, 9124 states have (on average 1.4309513371328364) internal successors, (13056), 9124 states have internal predecessors, (13056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9125 states to 9125 states and 13056 transitions. [2023-12-25 09:20:37,592 INFO L78 Accepts]: Start accepts. Automaton has 9125 states and 13056 transitions. Word has length 59 [2023-12-25 09:20:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:37,592 INFO L495 AbstractCegarLoop]: Abstraction has 9125 states and 13056 transitions. [2023-12-25 09:20:37,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9125 states and 13056 transitions. [2023-12-25 09:20:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 09:20:37,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:37,597 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] [2023-12-25 09:20:37,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 09:20:37,798 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:20:37,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:37,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1967626602, now seen corresponding path program 1 times [2023-12-25 09:20:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800487493] [2023-12-25 09:20:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:37,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:37,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:37,801 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:20:37,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 09:20:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:37,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:20:37,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:38,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:38,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800487493] [2023-12-25 09:20:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800487493] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:38,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:20:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243813686] [2023-12-25 09:20:38,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:38,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:20:38,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:38,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:20:38,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:20:38,285 INFO L87 Difference]: Start difference. First operand 9125 states and 13056 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:40,752 INFO L93 Difference]: Finished difference Result 31690 states and 44706 transitions. [2023-12-25 09:20:40,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-25 09:20:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-25 09:20:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:40,780 INFO L225 Difference]: With dead ends: 31690 [2023-12-25 09:20:40,780 INFO L226 Difference]: Without dead ends: 22586 [2023-12-25 09:20:40,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=977, Invalid=3183, Unknown=0, NotChecked=0, Total=4160 [2023-12-25 09:20:40,792 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 1925 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:40,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 1355 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 09:20:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22586 states. [2023-12-25 09:20:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22586 to 9051. [2023-12-25 09:20:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9051 states, 9050 states have (on average 1.4251933701657458) internal successors, (12898), 9050 states have internal predecessors, (12898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 12898 transitions. [2023-12-25 09:20:40,963 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 12898 transitions. Word has length 59 [2023-12-25 09:20:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:40,964 INFO L495 AbstractCegarLoop]: Abstraction has 9051 states and 12898 transitions. [2023-12-25 09:20:40,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 12898 transitions. [2023-12-25 09:20:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:20:40,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:40,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:40,970 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:20:41,168 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:20:41,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:41,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1285268948, now seen corresponding path program 1 times [2023-12-25 09:20:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:41,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225882785] [2023-12-25 09:20:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:41,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:41,170 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:20:41,171 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:20:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:41,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:41,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:41,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:41,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225882785] [2023-12-25 09:20:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225882785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:41,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:41,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443602592] [2023-12-25 09:20:41,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:41,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:41,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:41,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:41,245 INFO L87 Difference]: Start difference. First operand 9051 states and 12898 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:20:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:41,285 INFO L93 Difference]: Finished difference Result 15576 states and 22273 transitions. [2023-12-25 09:20:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:41,285 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:20:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:41,294 INFO L225 Difference]: With dead ends: 15576 [2023-12-25 09:20:41,294 INFO L226 Difference]: Without dead ends: 6546 [2023-12-25 09:20:41,302 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:20:41,303 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 61 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 229 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:20:41,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2023-12-25 09:20:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 6528. [2023-12-25 09:20:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6528 states, 6527 states have (on average 1.4210203768959706) internal successors, (9275), 6527 states have internal predecessors, (9275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6528 states to 6528 states and 9275 transitions. [2023-12-25 09:20:41,396 INFO L78 Accepts]: Start accepts. Automaton has 6528 states and 9275 transitions. Word has length 60 [2023-12-25 09:20:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:41,396 INFO L495 AbstractCegarLoop]: Abstraction has 6528 states and 9275 transitions. [2023-12-25 09:20:41,396 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:20:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6528 states and 9275 transitions. [2023-12-25 09:20:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:20:41,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:41,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:41,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:41,600 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:20:41,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:41,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 594381132, now seen corresponding path program 1 times [2023-12-25 09:20:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237210966] [2023-12-25 09:20:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:41,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:41,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:41,602 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:20:41,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 09:20:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:41,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:41,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:41,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:41,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237210966] [2023-12-25 09:20:41,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237210966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:41,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:41,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:41,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252800255] [2023-12-25 09:20:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:41,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:41,671 INFO L87 Difference]: Start difference. First operand 6528 states and 9275 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:20:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:41,702 INFO L93 Difference]: Finished difference Result 9746 states and 13853 transitions. [2023-12-25 09:20:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:41,703 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:20:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:41,708 INFO L225 Difference]: With dead ends: 9746 [2023-12-25 09:20:41,709 INFO L226 Difference]: Without dead ends: 3312 [2023-12-25 09:20:41,714 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:20:41,715 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 47 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 219 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:20:41,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 219 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2023-12-25 09:20:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3286. [2023-12-25 09:20:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 3285 states have (on average 1.3969558599695586) internal successors, (4589), 3285 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4589 transitions. [2023-12-25 09:20:41,746 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4589 transitions. Word has length 60 [2023-12-25 09:20:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:41,746 INFO L495 AbstractCegarLoop]: Abstraction has 3286 states and 4589 transitions. [2023-12-25 09:20:41,747 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:20:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4589 transitions. [2023-12-25 09:20:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:20:41,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:41,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:41,759 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:20:41,950 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:20:41,950 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:41,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1135753583, now seen corresponding path program 1 times [2023-12-25 09:20:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224739245] [2023-12-25 09:20:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:41,952 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:20:41,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 09:20:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:42,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:42,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:42,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:42,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224739245] [2023-12-25 09:20:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224739245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887653216] [2023-12-25 09:20:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:42,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:42,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:42,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:42,036 INFO L87 Difference]: Start difference. First operand 3286 states and 4589 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:20:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:42,051 INFO L93 Difference]: Finished difference Result 4474 states and 6187 transitions. [2023-12-25 09:20:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:42,052 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:20:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:42,055 INFO L225 Difference]: With dead ends: 4474 [2023-12-25 09:20:42,055 INFO L226 Difference]: Without dead ends: 2842 [2023-12-25 09:20:42,056 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:20:42,057 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:42,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 234 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2023-12-25 09:20:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2616. [2023-12-25 09:20:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2615 states have (on average 1.3667304015296367) internal successors, (3574), 2615 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3574 transitions. [2023-12-25 09:20:42,080 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3574 transitions. Word has length 60 [2023-12-25 09:20:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:42,080 INFO L495 AbstractCegarLoop]: Abstraction has 2616 states and 3574 transitions. [2023-12-25 09:20:42,080 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:20:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3574 transitions. [2023-12-25 09:20:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:20:42,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:42,084 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] [2023-12-25 09:20:42,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-25 09:20:42,286 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:20:42,286 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:42,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1782554138, now seen corresponding path program 1 times [2023-12-25 09:20:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:42,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189307510] [2023-12-25 09:20:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:42,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:42,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:42,288 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:20:42,289 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:20:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:42,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 09:20:42,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 09:20:42,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 09:20:42,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189307510] [2023-12-25 09:20:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189307510] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:42,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 09:20:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448115040] [2023-12-25 09:20:42,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:42,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 09:20:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 09:20:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 09:20:42,468 INFO L87 Difference]: Start difference. First operand 2616 states and 3574 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:42,504 INFO L93 Difference]: Finished difference Result 8955 states and 12162 transitions. [2023-12-25 09:20:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-25 09:20:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:42,516 INFO L225 Difference]: With dead ends: 8955 [2023-12-25 09:20:42,516 INFO L226 Difference]: Without dead ends: 6403 [2023-12-25 09:20:42,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 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:20:42,521 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 274 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:42,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 511 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2023-12-25 09:20:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6237. [2023-12-25 09:20:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6237 states, 6236 states have (on average 1.3353110968569595) internal successors, (8327), 6236 states have internal predecessors, (8327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6237 states to 6237 states and 8327 transitions. [2023-12-25 09:20:42,574 INFO L78 Accepts]: Start accepts. Automaton has 6237 states and 8327 transitions. Word has length 60 [2023-12-25 09:20:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:42,574 INFO L495 AbstractCegarLoop]: Abstraction has 6237 states and 8327 transitions. [2023-12-25 09:20:42,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6237 states and 8327 transitions. [2023-12-25 09:20:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 09:20:42,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:42,575 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:42,580 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:20:42,777 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:20:42,778 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:42,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -136307855, now seen corresponding path program 1 times [2023-12-25 09:20:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:42,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264248471] [2023-12-25 09:20:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:42,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:42,779 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:20:42,780 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:20:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:42,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:42,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:42,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:42,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264248471] [2023-12-25 09:20:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264248471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085587294] [2023-12-25 09:20:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:42,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:42,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:42,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:42,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:42,854 INFO L87 Difference]: Start difference. First operand 6237 states and 8327 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:20:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:42,917 INFO L93 Difference]: Finished difference Result 13206 states and 17501 transitions. [2023-12-25 09:20:42,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:42,919 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:20:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:42,931 INFO L225 Difference]: With dead ends: 13206 [2023-12-25 09:20:42,932 INFO L226 Difference]: Without dead ends: 9616 [2023-12-25 09:20:42,934 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:20:42,935 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 55 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:42,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 210 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2023-12-25 09:20:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 9565. [2023-12-25 09:20:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9565 states, 9564 states have (on average 1.3118987871183605) internal successors, (12547), 9564 states have internal predecessors, (12547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9565 states to 9565 states and 12547 transitions. [2023-12-25 09:20:43,026 INFO L78 Accepts]: Start accepts. Automaton has 9565 states and 12547 transitions. Word has length 60 [2023-12-25 09:20:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:43,026 INFO L495 AbstractCegarLoop]: Abstraction has 9565 states and 12547 transitions. [2023-12-25 09:20:43,026 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:20:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9565 states and 12547 transitions. [2023-12-25 09:20:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:20:43,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:43,028 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:20:43,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-25 09:20:43,230 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:20:43,230 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:43,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1295823606, now seen corresponding path program 1 times [2023-12-25 09:20:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454625809] [2023-12-25 09:20:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:43,232 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:20:43,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 09:20:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:43,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:43,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:43,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:43,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:43,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454625809] [2023-12-25 09:20:43,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454625809] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:43,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:43,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754488152] [2023-12-25 09:20:43,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:43,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:43,426 INFO L87 Difference]: Start difference. First operand 9565 states and 12547 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:43,575 INFO L93 Difference]: Finished difference Result 20578 states and 26820 transitions. [2023-12-25 09:20:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 09:20:43,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:20:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:43,590 INFO L225 Difference]: With dead ends: 20578 [2023-12-25 09:20:43,590 INFO L226 Difference]: Without dead ends: 11101 [2023-12-25 09:20:43,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:43,598 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 720 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:43,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 250 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11101 states. [2023-12-25 09:20:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11101 to 9271. [2023-12-25 09:20:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9271 states, 9270 states have (on average 1.2827400215749731) internal successors, (11891), 9270 states have internal predecessors, (11891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9271 states to 9271 states and 11891 transitions. [2023-12-25 09:20:43,686 INFO L78 Accepts]: Start accepts. Automaton has 9271 states and 11891 transitions. Word has length 61 [2023-12-25 09:20:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:43,686 INFO L495 AbstractCegarLoop]: Abstraction has 9271 states and 11891 transitions. [2023-12-25 09:20:43,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 9271 states and 11891 transitions. [2023-12-25 09:20:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:20:43,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:43,687 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:20:43,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:43,889 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:20:43,890 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:43,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash -704170213, now seen corresponding path program 1 times [2023-12-25 09:20:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:43,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820299914] [2023-12-25 09:20:43,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:43,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:43,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:43,891 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:20:43,892 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:20:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:43,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:43,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:44,097 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:20:44,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:44,157 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:20:44,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:44,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820299914] [2023-12-25 09:20:44,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820299914] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:44,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:44,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:44,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443003098] [2023-12-25 09:20:44,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:44,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:44,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:44,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:44,158 INFO L87 Difference]: Start difference. First operand 9271 states and 11891 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:44,342 INFO L93 Difference]: Finished difference Result 25309 states and 32335 transitions. [2023-12-25 09:20:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 09:20:44,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:20:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:44,358 INFO L225 Difference]: With dead ends: 25309 [2023-12-25 09:20:44,358 INFO L226 Difference]: Without dead ends: 16082 [2023-12-25 09:20:44,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:44,368 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 712 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:44,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 339 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16082 states. [2023-12-25 09:20:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16082 to 10618. [2023-12-25 09:20:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10618 states, 10617 states have (on average 1.2676839031741547) internal successors, (13459), 10617 states have internal predecessors, (13459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10618 states to 10618 states and 13459 transitions. [2023-12-25 09:20:44,476 INFO L78 Accepts]: Start accepts. Automaton has 10618 states and 13459 transitions. Word has length 61 [2023-12-25 09:20:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:44,476 INFO L495 AbstractCegarLoop]: Abstraction has 10618 states and 13459 transitions. [2023-12-25 09:20:44,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 10618 states and 13459 transitions. [2023-12-25 09:20:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:20:44,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:44,478 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:20:44,480 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:20:44,680 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:20:44,680 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:44,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1939950564, now seen corresponding path program 1 times [2023-12-25 09:20:44,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:44,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096425030] [2023-12-25 09:20:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:44,682 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:20:44,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 09:20:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:44,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 09:20:44,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:44,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:44,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096425030] [2023-12-25 09:20:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096425030] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:44,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:44,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-25 09:20:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625439533] [2023-12-25 09:20:44,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:44,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 09:20:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 09:20:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 09:20:44,927 INFO L87 Difference]: Start difference. First operand 10618 states and 13459 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:45,049 INFO L93 Difference]: Finished difference Result 24184 states and 30606 transitions. [2023-12-25 09:20:45,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 09:20:45,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:20:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:45,061 INFO L225 Difference]: With dead ends: 24184 [2023-12-25 09:20:45,061 INFO L226 Difference]: Without dead ends: 13662 [2023-12-25 09:20:45,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-25 09:20:45,069 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 514 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:45,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 197 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 09:20:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13662 states. [2023-12-25 09:20:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13662 to 11132. [2023-12-25 09:20:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11132 states, 11131 states have (on average 1.2518192435540383) internal successors, (13934), 11131 states have internal predecessors, (13934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11132 states to 11132 states and 13934 transitions. [2023-12-25 09:20:45,178 INFO L78 Accepts]: Start accepts. Automaton has 11132 states and 13934 transitions. Word has length 61 [2023-12-25 09:20:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:45,178 INFO L495 AbstractCegarLoop]: Abstraction has 11132 states and 13934 transitions. [2023-12-25 09:20:45,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11132 states and 13934 transitions. [2023-12-25 09:20:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 09:20:45,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:45,179 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:45,182 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:20:45,382 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:20:45,382 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:45,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -988441383, now seen corresponding path program 1 times [2023-12-25 09:20:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81178597] [2023-12-25 09:20:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:45,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:45,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:45,384 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:20:45,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 09:20:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:45,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:45,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:45,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:45,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:45,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81178597] [2023-12-25 09:20:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81178597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:45,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:45,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380334338] [2023-12-25 09:20:45,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:45,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:45,459 INFO L87 Difference]: Start difference. First operand 11132 states and 13934 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:20:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:45,494 INFO L93 Difference]: Finished difference Result 17699 states and 21922 transitions. [2023-12-25 09:20:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 09:20:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:45,504 INFO L225 Difference]: With dead ends: 17699 [2023-12-25 09:20:45,504 INFO L226 Difference]: Without dead ends: 9750 [2023-12-25 09:20:45,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:45,511 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 52 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:45,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 229 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9750 states. [2023-12-25 09:20:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9750 to 9419. [2023-12-25 09:20:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9418 states have (on average 1.2156508812911446) internal successors, (11449), 9418 states have internal predecessors, (11449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 11449 transitions. [2023-12-25 09:20:45,592 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 11449 transitions. Word has length 61 [2023-12-25 09:20:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:45,592 INFO L495 AbstractCegarLoop]: Abstraction has 9419 states and 11449 transitions. [2023-12-25 09:20:45,592 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:20:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 11449 transitions. [2023-12-25 09:20:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:20:45,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:45,595 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:20:45,606 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:20:45,797 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:20:45,798 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:45,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:45,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1478317037, now seen corresponding path program 1 times [2023-12-25 09:20:45,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:45,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949452494] [2023-12-25 09:20:45,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:45,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:45,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:45,799 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:20:45,800 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:20:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:45,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:45,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:46,007 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:20:46,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:46,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949452494] [2023-12-25 09:20:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949452494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:46,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217921350] [2023-12-25 09:20:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:46,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:46,009 INFO L87 Difference]: Start difference. First operand 9419 states and 11449 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:20:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:46,082 INFO L93 Difference]: Finished difference Result 15274 states and 18676 transitions. [2023-12-25 09:20:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:46,083 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:20:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:46,094 INFO L225 Difference]: With dead ends: 15274 [2023-12-25 09:20:46,094 INFO L226 Difference]: Without dead ends: 12617 [2023-12-25 09:20:46,095 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:20:46,096 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 226 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:46,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 406 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12617 states. [2023-12-25 09:20:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12617 to 10300. [2023-12-25 09:20:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10300 states, 10299 states have (on average 1.2091465190795223) internal successors, (12453), 10299 states have internal predecessors, (12453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 12453 transitions. [2023-12-25 09:20:46,182 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 12453 transitions. Word has length 63 [2023-12-25 09:20:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:46,182 INFO L495 AbstractCegarLoop]: Abstraction has 10300 states and 12453 transitions. [2023-12-25 09:20:46,182 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:20:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 12453 transitions. [2023-12-25 09:20:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 09:20:46,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:46,183 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:20:46,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:46,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:46,384 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:46,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash -392875314, now seen corresponding path program 1 times [2023-12-25 09:20:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908379961] [2023-12-25 09:20:46,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:46,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:46,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:46,386 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:46,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 09:20:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:46,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 09:20:46,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:46,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:46,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908379961] [2023-12-25 09:20:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908379961] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:46,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:46,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-25 09:20:46,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537221190] [2023-12-25 09:20:46,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:46,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:20:46,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:20:46,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:20:46,947 INFO L87 Difference]: Start difference. First operand 10300 states and 12453 transitions. Second operand has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:47,739 INFO L93 Difference]: Finished difference Result 23747 states and 28440 transitions. [2023-12-25 09:20:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 09:20:47,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-12-25 09:20:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:47,754 INFO L225 Difference]: With dead ends: 23747 [2023-12-25 09:20:47,754 INFO L226 Difference]: Without dead ends: 13572 [2023-12-25 09:20:47,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2023-12-25 09:20:47,762 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 1285 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:47,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 927 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:20:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13572 states. [2023-12-25 09:20:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13572 to 9626. [2023-12-25 09:20:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9626 states, 9625 states have (on average 1.1943896103896103) internal successors, (11496), 9625 states have internal predecessors, (11496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 11496 transitions. [2023-12-25 09:20:47,845 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 11496 transitions. Word has length 63 [2023-12-25 09:20:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:47,845 INFO L495 AbstractCegarLoop]: Abstraction has 9626 states and 11496 transitions. [2023-12-25 09:20:47,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 11496 transitions. [2023-12-25 09:20:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:47,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:47,847 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:20:47,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-25 09:20:48,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:48,047 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:48,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1932166969, now seen corresponding path program 1 times [2023-12-25 09:20:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:48,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943905348] [2023-12-25 09:20:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:48,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:48,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:48,049 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:48,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 09:20:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:48,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:48,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:48,278 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:20:48,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:48,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943905348] [2023-12-25 09:20:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943905348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109995363] [2023-12-25 09:20:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:48,280 INFO L87 Difference]: Start difference. First operand 9626 states and 11496 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:20:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:48,333 INFO L93 Difference]: Finished difference Result 15412 states and 18555 transitions. [2023-12-25 09:20:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:48,334 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 64 [2023-12-25 09:20:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:48,344 INFO L225 Difference]: With dead ends: 15412 [2023-12-25 09:20:48,345 INFO L226 Difference]: Without dead ends: 12834 [2023-12-25 09:20:48,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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:20:48,348 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 178 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:48,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 473 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2023-12-25 09:20:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 11369. [2023-12-25 09:20:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11369 states, 11368 states have (on average 1.186576354679803) internal successors, (13489), 11368 states have internal predecessors, (13489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 13489 transitions. [2023-12-25 09:20:48,454 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 13489 transitions. Word has length 64 [2023-12-25 09:20:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:48,454 INFO L495 AbstractCegarLoop]: Abstraction has 11369 states and 13489 transitions. [2023-12-25 09:20:48,454 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:20:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 13489 transitions. [2023-12-25 09:20:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:48,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:48,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:48,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:48,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:48,658 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:48,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash -975821647, now seen corresponding path program 1 times [2023-12-25 09:20:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252943584] [2023-12-25 09:20:48,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:48,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:48,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:48,659 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:48,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-25 09:20:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:48,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:48,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:48,728 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:20:48,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:48,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:48,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252943584] [2023-12-25 09:20:48,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252943584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:48,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:48,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708015169] [2023-12-25 09:20:48,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:48,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:48,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:48,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:48,729 INFO L87 Difference]: Start difference. First operand 11369 states and 13489 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:48,755 INFO L93 Difference]: Finished difference Result 15731 states and 18698 transitions. [2023-12-25 09:20:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2023-12-25 09:20:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:48,759 INFO L225 Difference]: With dead ends: 15731 [2023-12-25 09:20:48,759 INFO L226 Difference]: Without dead ends: 5698 [2023-12-25 09:20:48,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:48,764 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 27 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 164 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:20:48,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2023-12-25 09:20:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5141. [2023-12-25 09:20:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5141 states, 5140 states have (on average 1.1601167315175098) internal successors, (5963), 5140 states have internal predecessors, (5963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5141 states to 5141 states and 5963 transitions. [2023-12-25 09:20:48,796 INFO L78 Accepts]: Start accepts. Automaton has 5141 states and 5963 transitions. Word has length 64 [2023-12-25 09:20:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:48,796 INFO L495 AbstractCegarLoop]: Abstraction has 5141 states and 5963 transitions. [2023-12-25 09:20:48,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5141 states and 5963 transitions. [2023-12-25 09:20:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-25 09:20:48,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:48,797 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:20:48,800 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:20:48,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:48,999 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:49,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1160286704, now seen corresponding path program 1 times [2023-12-25 09:20:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:49,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828869141] [2023-12-25 09:20:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:49,001 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:49,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 09:20:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:49,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 09:20:49,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:49,212 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:20:49,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:49,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828869141] [2023-12-25 09:20:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828869141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:49,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 09:20:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098320579] [2023-12-25 09:20:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:49,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 09:20:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 09:20:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 09:20:49,213 INFO L87 Difference]: Start difference. First operand 5141 states and 5963 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:49,253 INFO L93 Difference]: Finished difference Result 8695 states and 10227 transitions. [2023-12-25 09:20:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 09:20:49,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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 64 [2023-12-25 09:20:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:49,258 INFO L225 Difference]: With dead ends: 8695 [2023-12-25 09:20:49,258 INFO L226 Difference]: Without dead ends: 6381 [2023-12-25 09:20:49,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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:20:49,260 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 221 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:49,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 398 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2023-12-25 09:20:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 5188. [2023-12-25 09:20:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 5187 states have (on average 1.1494119915172547) internal successors, (5962), 5187 states have internal predecessors, (5962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 5962 transitions. [2023-12-25 09:20:49,289 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 5962 transitions. Word has length 64 [2023-12-25 09:20:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:49,290 INFO L495 AbstractCegarLoop]: Abstraction has 5188 states and 5962 transitions. [2023-12-25 09:20:49,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 5962 transitions. [2023-12-25 09:20:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 09:20:49,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:49,291 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:49,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-25 09:20:49,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:49,493 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:49,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -787835367, now seen corresponding path program 1 times [2023-12-25 09:20:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222490485] [2023-12-25 09:20:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:49,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:49,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:49,495 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:49,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 09:20:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:49,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:49,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:49,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:49,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:49,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222490485] [2023-12-25 09:20:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222490485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:49,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:49,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517778129] [2023-12-25 09:20:49,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:49,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:49,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:49,570 INFO L87 Difference]: Start difference. First operand 5188 states and 5962 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:49,586 INFO L93 Difference]: Finished difference Result 6998 states and 8015 transitions. [2023-12-25 09:20:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:49,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2023-12-25 09:20:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:49,589 INFO L225 Difference]: With dead ends: 6998 [2023-12-25 09:20:49,589 INFO L226 Difference]: Without dead ends: 4893 [2023-12-25 09:20:49,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:49,591 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 42 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:49,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2023-12-25 09:20:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4891. [2023-12-25 09:20:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4890 states have (on average 1.1402862985685072) internal successors, (5576), 4890 states have internal predecessors, (5576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 5576 transitions. [2023-12-25 09:20:49,615 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 5576 transitions. Word has length 69 [2023-12-25 09:20:49,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:49,615 INFO L495 AbstractCegarLoop]: Abstraction has 4891 states and 5576 transitions. [2023-12-25 09:20:49,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 5576 transitions. [2023-12-25 09:20:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 09:20:49,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:49,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:49,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-25 09:20:49,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:49,819 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:49,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1911176366, now seen corresponding path program 1 times [2023-12-25 09:20:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180894142] [2023-12-25 09:20:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:49,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:49,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:49,820 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:49,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 09:20:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:49,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 09:20:49,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:49,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 09:20:49,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180894142] [2023-12-25 09:20:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180894142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 09:20:49,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 09:20:49,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 09:20:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831952981] [2023-12-25 09:20:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 09:20:49,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 09:20:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 09:20:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:49,900 INFO L87 Difference]: Start difference. First operand 4891 states and 5576 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:20:49,946 INFO L93 Difference]: Finished difference Result 5343 states and 6059 transitions. [2023-12-25 09:20:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 09:20:49,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2023-12-25 09:20:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:20:49,948 INFO L225 Difference]: With dead ends: 5343 [2023-12-25 09:20:49,948 INFO L226 Difference]: Without dead ends: 3552 [2023-12-25 09:20:49,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 09:20:49,949 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 49 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 09:20:49,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 222 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 09:20:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2023-12-25 09:20:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3550. [2023-12-25 09:20:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 3549 states have (on average 1.1265145111298958) internal successors, (3998), 3549 states have internal predecessors, (3998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 3998 transitions. [2023-12-25 09:20:49,972 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 3998 transitions. Word has length 69 [2023-12-25 09:20:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:20:49,972 INFO L495 AbstractCegarLoop]: Abstraction has 3550 states and 3998 transitions. [2023-12-25 09:20:49,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:20:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 3998 transitions. [2023-12-25 09:20:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 09:20:49,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:20:49,973 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:20:49,975 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 (28)] Ended with exit code 0 [2023-12-25 09:20:50,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:50,175 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:20:50,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:20:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash -919494610, now seen corresponding path program 1 times [2023-12-25 09:20:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:20:50,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970031051] [2023-12-25 09:20:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:20:50,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:20:50,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:20:50,177 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:20:50,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 09:20:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:20:50,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 09:20:50,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:20:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:20:51,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:20:52,282 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:20:52,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:20:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970031051] [2023-12-25 09:20:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970031051] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:20:52,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:20:52,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2023-12-25 09:20:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427182899] [2023-12-25 09:20:52,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:20:52,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 09:20:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:20:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 09:20:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 09:20:52,284 INFO L87 Difference]: Start difference. First operand 3550 states and 3998 transitions. Second operand has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:06,501 INFO L93 Difference]: Finished difference Result 14293 states and 16008 transitions. [2023-12-25 09:21:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2023-12-25 09:21:06,504 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 0 states have call successors, (0), 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 70 [2023-12-25 09:21:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:06,513 INFO L225 Difference]: With dead ends: 14293 [2023-12-25 09:21:06,513 INFO L226 Difference]: Without dead ends: 11337 [2023-12-25 09:21:06,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17787 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=7075, Invalid=36397, Unknown=0, NotChecked=0, Total=43472 [2023-12-25 09:21:06,523 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 2921 mSDsluCounter, 5162 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2921 SdHoareTripleChecker+Valid, 5542 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:06,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2921 Valid, 5542 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 09:21:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11337 states. [2023-12-25 09:21:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11337 to 3812. [2023-12-25 09:21:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3812 states, 3811 states have (on average 1.1214904224612963) internal successors, (4274), 3811 states have internal predecessors, (4274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 3812 states and 4274 transitions. [2023-12-25 09:21:06,563 INFO L78 Accepts]: Start accepts. Automaton has 3812 states and 4274 transitions. Word has length 70 [2023-12-25 09:21:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:06,563 INFO L495 AbstractCegarLoop]: Abstraction has 3812 states and 4274 transitions. [2023-12-25 09:21:06,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3812 states and 4274 transitions. [2023-12-25 09:21:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:21:06,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:06,565 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:06,572 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:21:06,767 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:21:06,768 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:06,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:06,768 INFO L85 PathProgramCache]: Analyzing trace with hash 109539833, now seen corresponding path program 1 times [2023-12-25 09:21:06,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:06,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268552672] [2023-12-25 09:21:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:06,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:21:06,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:06,769 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:21:06,770 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:21:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:06,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:21:06,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:21:07,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:21:07,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:07,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268552672] [2023-12-25 09:21:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268552672] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:07,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:07,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 09:21:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908002422] [2023-12-25 09:21:07,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:07,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 09:21:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 09:21:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 09:21:07,563 INFO L87 Difference]: Start difference. First operand 3812 states and 4274 transitions. Second operand has 18 states, 18 states have (on average 10.777777777777779) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:09,055 INFO L93 Difference]: Finished difference Result 6578 states and 7381 transitions. [2023-12-25 09:21:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 09:21:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.777777777777779) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-25 09:21:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:09,061 INFO L225 Difference]: With dead ends: 6578 [2023-12-25 09:21:09,062 INFO L226 Difference]: Without dead ends: 5687 [2023-12-25 09:21:09,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=487, Invalid=1405, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 09:21:09,064 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 883 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:09,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1113 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 09:21:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5687 states. [2023-12-25 09:21:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5687 to 3668. [2023-12-25 09:21:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 3667 states have (on average 1.1164439596400326) internal successors, (4094), 3667 states have internal predecessors, (4094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4094 transitions. [2023-12-25 09:21:09,102 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4094 transitions. Word has length 114 [2023-12-25 09:21:09,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:09,102 INFO L495 AbstractCegarLoop]: Abstraction has 3668 states and 4094 transitions. [2023-12-25 09:21:09,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.777777777777779) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4094 transitions. [2023-12-25 09:21:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:21:09,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:09,104 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:09,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-25 09:21:09,306 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:21:09,306 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:09,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1830870708, now seen corresponding path program 1 times [2023-12-25 09:21:09,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:09,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623577008] [2023-12-25 09:21:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:09,308 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:21:09,309 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:21:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:09,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:21:09,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 29 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:10,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:10,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623577008] [2023-12-25 09:21:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623577008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:10,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:10,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:21:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894607361] [2023-12-25 09:21:10,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:10,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:21:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:21:10,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:21:10,323 INFO L87 Difference]: Start difference. First operand 3668 states and 4094 transitions. Second operand has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:12,042 INFO L93 Difference]: Finished difference Result 9829 states and 11001 transitions. [2023-12-25 09:21:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-25 09:21:12,043 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-25 09:21:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:12,051 INFO L225 Difference]: With dead ends: 9829 [2023-12-25 09:21:12,051 INFO L226 Difference]: Without dead ends: 8341 [2023-12-25 09:21:12,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=621, Invalid=2459, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 09:21:12,054 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1251 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:12,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 2686 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:21:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2023-12-25 09:21:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 6376. [2023-12-25 09:21:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6376 states, 6375 states have (on average 1.1126274509803922) internal successors, (7093), 6375 states have internal predecessors, (7093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6376 states to 6376 states and 7093 transitions. [2023-12-25 09:21:12,109 INFO L78 Accepts]: Start accepts. Automaton has 6376 states and 7093 transitions. Word has length 114 [2023-12-25 09:21:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:12,109 INFO L495 AbstractCegarLoop]: Abstraction has 6376 states and 7093 transitions. [2023-12-25 09:21:12,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6376 states and 7093 transitions. [2023-12-25 09:21:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:21:12,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:12,111 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:12,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-12-25 09:21:12,311 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:21:12,311 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:12,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 838174878, now seen corresponding path program 2 times [2023-12-25 09:21:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699604523] [2023-12-25 09:21:12,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:21:12,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:12,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:12,313 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:21:12,315 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:21:12,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:21:12,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:21:12,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 09:21:12,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 31 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:12,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:12,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:12,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699604523] [2023-12-25 09:21:12,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699604523] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:12,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:12,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2023-12-25 09:21:12,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250232651] [2023-12-25 09:21:12,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:12,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 09:21:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 09:21:12,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-12-25 09:21:12,973 INFO L87 Difference]: Start difference. First operand 6376 states and 7093 transitions. Second operand has 21 states, 21 states have (on average 10.0) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:14,005 INFO L93 Difference]: Finished difference Result 11497 states and 12829 transitions. [2023-12-25 09:21:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-25 09:21:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.0) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2023-12-25 09:21:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:14,012 INFO L225 Difference]: With dead ends: 11497 [2023-12-25 09:21:14,012 INFO L226 Difference]: Without dead ends: 7744 [2023-12-25 09:21:14,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=443, Invalid=1909, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 09:21:14,016 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 879 mSDsluCounter, 3517 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 3811 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:14,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 3811 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:21:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7744 states. [2023-12-25 09:21:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7744 to 5915. [2023-12-25 09:21:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5914 states have (on average 1.104159621237741) internal successors, (6530), 5914 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 6530 transitions. [2023-12-25 09:21:14,064 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 6530 transitions. Word has length 114 [2023-12-25 09:21:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:14,064 INFO L495 AbstractCegarLoop]: Abstraction has 5915 states and 6530 transitions. [2023-12-25 09:21:14,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.0) internal successors, (210), 21 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 6530 transitions. [2023-12-25 09:21:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:21:14,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:14,066 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:14,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-12-25 09:21:14,268 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:21:14,268 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:14,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -873592319, now seen corresponding path program 1 times [2023-12-25 09:21:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763651920] [2023-12-25 09:21:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:14,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:14,270 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:21:14,270 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:21:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:14,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:21:14,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 53 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:21:14,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:21:15,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763651920] [2023-12-25 09:21:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763651920] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:15,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:15,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:21:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516726270] [2023-12-25 09:21:15,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:15,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:21:15,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:15,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:21:15,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:21:15,102 INFO L87 Difference]: Start difference. First operand 5915 states and 6530 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:16,282 INFO L93 Difference]: Finished difference Result 12258 states and 13509 transitions. [2023-12-25 09:21:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 09:21:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 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:21:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:16,290 INFO L225 Difference]: With dead ends: 12258 [2023-12-25 09:21:16,290 INFO L226 Difference]: Without dead ends: 9962 [2023-12-25 09:21:16,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=455, Invalid=1897, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 09:21:16,293 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 1249 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:16,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 2643 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:21:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9962 states. [2023-12-25 09:21:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9962 to 7814. [2023-12-25 09:21:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7814 states, 7813 states have (on average 1.1004735696915398) internal successors, (8598), 7813 states have internal predecessors, (8598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 8598 transitions. [2023-12-25 09:21:16,348 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 8598 transitions. Word has length 114 [2023-12-25 09:21:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:16,348 INFO L495 AbstractCegarLoop]: Abstraction has 7814 states and 8598 transitions. [2023-12-25 09:21:16,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 8598 transitions. [2023-12-25 09:21:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-25 09:21:16,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:16,350 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:21:16,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-12-25 09:21:16,552 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:21:16,552 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:16,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1265109443, now seen corresponding path program 2 times [2023-12-25 09:21:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175238942] [2023-12-25 09:21:16,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:21:16,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:16,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:16,554 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:21:16,554 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:21:16,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:21:16,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:21:16,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 09:21:16,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 53 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:21:17,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 62 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 09:21:17,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175238942] [2023-12-25 09:21:17,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175238942] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:17,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:17,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2023-12-25 09:21:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477409444] [2023-12-25 09:21:17,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:17,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 09:21:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 09:21:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-25 09:21:17,381 INFO L87 Difference]: Start difference. First operand 7814 states and 8598 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:18,756 INFO L93 Difference]: Finished difference Result 14488 states and 15947 transitions. [2023-12-25 09:21:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 09:21:18,756 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 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:21:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:18,764 INFO L225 Difference]: With dead ends: 14488 [2023-12-25 09:21:18,764 INFO L226 Difference]: Without dead ends: 10243 [2023-12-25 09:21:18,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2023-12-25 09:21:18,767 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1180 mSDsluCounter, 2779 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:18,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 2975 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 09:21:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2023-12-25 09:21:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 8651. [2023-12-25 09:21:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8651 states, 8650 states have (on average 1.0972254335260117) internal successors, (9491), 8650 states have internal predecessors, (9491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8651 states to 8651 states and 9491 transitions. [2023-12-25 09:21:18,832 INFO L78 Accepts]: Start accepts. Automaton has 8651 states and 9491 transitions. Word has length 114 [2023-12-25 09:21:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:18,833 INFO L495 AbstractCegarLoop]: Abstraction has 8651 states and 9491 transitions. [2023-12-25 09:21:18,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 23 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8651 states and 9491 transitions. [2023-12-25 09:21:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 09:21:18,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:18,835 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-25 09:21:18,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-12-25 09:21:19,035 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:21:19,036 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:19,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1263241309, now seen corresponding path program 1 times [2023-12-25 09:21:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704908475] [2023-12-25 09:21:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:19,037 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:21:19,038 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:21:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:19,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:21:19,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 09:21:19,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 09:21:19,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704908475] [2023-12-25 09:21:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704908475] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:19,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-12-25 09:21:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635732720] [2023-12-25 09:21:19,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 09:21:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 09:21:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 09:21:19,648 INFO L87 Difference]: Start difference. First operand 8651 states and 9491 transitions. Second operand has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:20,211 INFO L93 Difference]: Finished difference Result 15398 states and 16964 transitions. [2023-12-25 09:21:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 09:21:20,211 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-25 09:21:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:20,219 INFO L225 Difference]: With dead ends: 15398 [2023-12-25 09:21:20,220 INFO L226 Difference]: Without dead ends: 12511 [2023-12-25 09:21:20,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2023-12-25 09:21:20,223 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 583 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:20,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1228 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:21:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2023-12-25 09:21:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 8175. [2023-12-25 09:21:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8175 states, 8174 states have (on average 1.0979936383655493) internal successors, (8975), 8174 states have internal predecessors, (8975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8175 states to 8175 states and 8975 transitions. [2023-12-25 09:21:20,284 INFO L78 Accepts]: Start accepts. Automaton has 8175 states and 8975 transitions. Word has length 115 [2023-12-25 09:21:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:20,284 INFO L495 AbstractCegarLoop]: Abstraction has 8175 states and 8975 transitions. [2023-12-25 09:21:20,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8175 states and 8975 transitions. [2023-12-25 09:21:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-25 09:21:20,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:20,286 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-25 09:21:20,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-12-25 09:21:20,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:20,486 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:20,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1255679292, now seen corresponding path program 1 times [2023-12-25 09:21:20,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147329242] [2023-12-25 09:21:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:20,488 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:21:20,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-25 09:21:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:20,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 09:21:20,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 09:21:20,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 09:21:20,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147329242] [2023-12-25 09:21:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147329242] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:20,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:20,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-25 09:21:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179471816] [2023-12-25 09:21:20,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:20,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 09:21:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 09:21:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-12-25 09:21:20,955 INFO L87 Difference]: Start difference. First operand 8175 states and 8975 transitions. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:21:21,436 INFO L93 Difference]: Finished difference Result 11973 states and 13156 transitions. [2023-12-25 09:21:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 09:21:21,436 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-25 09:21:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:21:21,444 INFO L225 Difference]: With dead ends: 11973 [2023-12-25 09:21:21,444 INFO L226 Difference]: Without dead ends: 10701 [2023-12-25 09:21:21,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2023-12-25 09:21:21,447 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 651 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 09:21:21,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1197 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 09:21:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10701 states. [2023-12-25 09:21:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10701 to 8123. [2023-12-25 09:21:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8123 states, 8122 states have (on average 1.097759172617582) internal successors, (8916), 8122 states have internal predecessors, (8916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8123 states to 8123 states and 8916 transitions. [2023-12-25 09:21:21,514 INFO L78 Accepts]: Start accepts. Automaton has 8123 states and 8916 transitions. Word has length 115 [2023-12-25 09:21:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:21:21,515 INFO L495 AbstractCegarLoop]: Abstraction has 8123 states and 8916 transitions. [2023-12-25 09:21:21,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:21:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8123 states and 8916 transitions. [2023-12-25 09:21:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-25 09:21:21,517 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:21:21,517 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-25 09:21:21,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-12-25 09:21:21,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:21,717 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:21:21,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:21:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1314492124, now seen corresponding path program 1 times [2023-12-25 09:21:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:21:21,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205360997] [2023-12-25 09:21:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:21:21,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:21:21,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:21:21,719 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:21:21,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-25 09:21:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:21:21,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 09:21:21,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:21:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:23,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:21:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:21:24,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:21:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205360997] [2023-12-25 09:21:24,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205360997] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:21:24,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:21:24,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2023-12-25 09:21:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402851252] [2023-12-25 09:21:24,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:21:24,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-25 09:21:24,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:21:24,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-25 09:21:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 09:21:24,939 INFO L87 Difference]: Start difference. First operand 8123 states and 8916 transitions. Second operand has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:22:40,005 INFO L93 Difference]: Finished difference Result 26512 states and 29008 transitions. [2023-12-25 09:22:40,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 394 states. [2023-12-25 09:22:40,006 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 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 119 [2023-12-25 09:22:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:22:40,023 INFO L225 Difference]: With dead ends: 26512 [2023-12-25 09:22:40,024 INFO L226 Difference]: Without dead ends: 23315 [2023-12-25 09:22:40,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82291 ImplicationChecksByTransitivity, 68.5s TimeCoverageRelationStatistics Valid=18945, Invalid=168977, Unknown=0, NotChecked=0, Total=187922 [2023-12-25 09:22:40,036 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 4659 mSDsluCounter, 8133 mSDsCounter, 0 mSdLazyCounter, 4897 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 8587 SdHoareTripleChecker+Invalid, 4990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:22:40,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 8587 Invalid, 4990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4897 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-12-25 09:22:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23315 states. [2023-12-25 09:22:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23315 to 11636. [2023-12-25 09:22:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11636 states, 11635 states have (on average 1.0927374301675978) internal successors, (12714), 11635 states have internal predecessors, (12714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 12714 transitions. [2023-12-25 09:22:40,172 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 12714 transitions. Word has length 119 [2023-12-25 09:22:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:22:40,172 INFO L495 AbstractCegarLoop]: Abstraction has 11636 states and 12714 transitions. [2023-12-25 09:22:40,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.4523809523809526) internal successors, (229), 42 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:22:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 12714 transitions. [2023-12-25 09:22:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 09:22:40,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:22:40,175 INFO L195 NwaCegarLoop]: trace histogram [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, 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:22:40,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-12-25 09:22:40,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:22:40,375 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:22:40,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:22:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 135057541, now seen corresponding path program 1 times [2023-12-25 09:22:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:22:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236497862] [2023-12-25 09:22:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:22:40,376 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:22:40,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:22:40,377 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:22:40,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-25 09:22:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:22:40,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 09:22:40,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:22:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:42,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:22:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:22:44,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:22:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236497862] [2023-12-25 09:22:44,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236497862] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:22:44,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:22:44,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 43 [2023-12-25 09:22:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964726722] [2023-12-25 09:22:44,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:22:44,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 09:22:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:22:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 09:22:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1596, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 09:22:44,028 INFO L87 Difference]: Start difference. First operand 11636 states and 12714 transitions. Second operand has 43 states, 43 states have (on average 5.372093023255814) internal successors, (231), 43 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:23:36,337 INFO L93 Difference]: Finished difference Result 26259 states and 28673 transitions. [2023-12-25 09:23:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 304 states. [2023-12-25 09:23:36,338 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.372093023255814) internal successors, (231), 43 states have internal predecessors, (231), 0 states have call successors, (0), 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 120 [2023-12-25 09:23:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:23:36,353 INFO L225 Difference]: With dead ends: 26259 [2023-12-25 09:23:36,353 INFO L226 Difference]: Without dead ends: 21019 [2023-12-25 09:23:36,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49787 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=12057, Invalid=106623, Unknown=0, NotChecked=0, Total=118680 [2023-12-25 09:23:36,359 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 5541 mSDsluCounter, 6010 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5541 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-25 09:23:36,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5541 Valid, 6292 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-25 09:23:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21019 states. [2023-12-25 09:23:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21019 to 13003. [2023-12-25 09:23:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13003 states, 13002 states have (on average 1.09421627441932) internal successors, (14227), 13002 states have internal predecessors, (14227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13003 states to 13003 states and 14227 transitions. [2023-12-25 09:23:36,479 INFO L78 Accepts]: Start accepts. Automaton has 13003 states and 14227 transitions. Word has length 120 [2023-12-25 09:23:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:23:36,480 INFO L495 AbstractCegarLoop]: Abstraction has 13003 states and 14227 transitions. [2023-12-25 09:23:36,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.372093023255814) internal successors, (231), 43 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:23:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 13003 states and 14227 transitions. [2023-12-25 09:23:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 09:23:36,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:23:36,482 INFO L195 NwaCegarLoop]: trace histogram [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, 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:23:36,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-12-25 09:23:36,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:23:36,682 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:23:36,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:23:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash -338491739, now seen corresponding path program 1 times [2023-12-25 09:23:36,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:23:36,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532165368] [2023-12-25 09:23:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:23:36,683 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:23:36,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:23:36,684 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:23:36,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-25 09:23:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 09:23:36,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-25 09:23:36,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:23:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:39,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:23:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 09:23:41,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:23:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532165368] [2023-12-25 09:23:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532165368] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:23:41,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:23:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 55 [2023-12-25 09:23:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802374689] [2023-12-25 09:23:41,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:23:41,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-25 09:23:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:23:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-25 09:23:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2635, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 09:23:41,461 INFO L87 Difference]: Start difference. First operand 13003 states and 14227 transitions. Second operand has 55 states, 55 states have (on average 4.090909090909091) internal successors, (225), 55 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:25:41,791 INFO L93 Difference]: Finished difference Result 30260 states and 33092 transitions. [2023-12-25 09:25:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 484 states. [2023-12-25 09:25:41,792 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.090909090909091) internal successors, (225), 55 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2023-12-25 09:25:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:25:41,810 INFO L225 Difference]: With dead ends: 30260 [2023-12-25 09:25:41,810 INFO L226 Difference]: Without dead ends: 23598 [2023-12-25 09:25:41,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 535 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125615 ImplicationChecksByTransitivity, 111.5s TimeCoverageRelationStatistics Valid=26755, Invalid=261077, Unknown=0, NotChecked=0, Total=287832 [2023-12-25 09:25:41,826 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 7023 mSDsluCounter, 10749 mSDsCounter, 0 mSdLazyCounter, 6343 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7023 SdHoareTripleChecker+Valid, 11078 SdHoareTripleChecker+Invalid, 6569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 6343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-12-25 09:25:41,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7023 Valid, 11078 Invalid, 6569 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [226 Valid, 6343 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2023-12-25 09:25:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23598 states. [2023-12-25 09:25:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 13516. [2023-12-25 09:25:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13516 states, 13515 states have (on average 1.0927118017018127) internal successors, (14768), 13515 states have internal predecessors, (14768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13516 states to 13516 states and 14768 transitions. [2023-12-25 09:25:41,966 INFO L78 Accepts]: Start accepts. Automaton has 13516 states and 14768 transitions. Word has length 120 [2023-12-25 09:25:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:25:41,967 INFO L495 AbstractCegarLoop]: Abstraction has 13516 states and 14768 transitions. [2023-12-25 09:25:41,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.090909090909091) internal successors, (225), 55 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13516 states and 14768 transitions. [2023-12-25 09:25:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-25 09:25:41,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:25:41,969 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 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:25:41,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-25 09:25:42,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:42,170 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:25:42,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:25:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1826584358, now seen corresponding path program 2 times [2023-12-25 09:25:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:25:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970431743] [2023-12-25 09:25:42,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 09:25:42,171 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:25:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:25:42,172 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:25:42,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-25 09:25:42,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 09:25:42,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 09:25:42,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 09:25:42,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 09:25:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 141 proven. 19 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-25 09:25:42,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 09:25:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 128 proven. 32 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-25 09:25:43,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 09:25:43,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970431743] [2023-12-25 09:25:43,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970431743] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 09:25:43,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 09:25:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2023-12-25 09:25:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325406430] [2023-12-25 09:25:43,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 09:25:43,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 09:25:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 09:25:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 09:25:43,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-25 09:25:43,049 INFO L87 Difference]: Start difference. First operand 13516 states and 14768 transitions. Second operand has 19 states, 19 states have (on average 9.157894736842104) internal successors, (174), 19 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 09:25:43,946 INFO L93 Difference]: Finished difference Result 26211 states and 28766 transitions. [2023-12-25 09:25:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 09:25:43,947 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.157894736842104) internal successors, (174), 19 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2023-12-25 09:25:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 09:25:43,965 INFO L225 Difference]: With dead ends: 26211 [2023-12-25 09:25:43,965 INFO L226 Difference]: Without dead ends: 21130 [2023-12-25 09:25:43,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 09:25:43,972 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 943 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 09:25:43,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1880 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 09:25:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21130 states. [2023-12-25 09:25:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21130 to 16447. [2023-12-25 09:25:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16447 states, 16446 states have (on average 1.0919980542381127) internal successors, (17959), 16446 states have internal predecessors, (17959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16447 states to 16447 states and 17959 transitions. [2023-12-25 09:25:44,125 INFO L78 Accepts]: Start accepts. Automaton has 16447 states and 17959 transitions. Word has length 138 [2023-12-25 09:25:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 09:25:44,125 INFO L495 AbstractCegarLoop]: Abstraction has 16447 states and 17959 transitions. [2023-12-25 09:25:44,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.157894736842104) internal successors, (174), 19 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 09:25:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 16447 states and 17959 transitions. [2023-12-25 09:25:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-25 09:25:44,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 09:25:44,127 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 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:25:44,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-12-25 09:25:44,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:44,330 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 09:25:44,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 09:25:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 907664208, now seen corresponding path program 1 times [2023-12-25 09:25:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 09:25:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890878604] [2023-12-25 09:25:44,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 09:25:44,331 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:25:44,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 09:25:44,332 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 09:25:44,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-12-25 09:25:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:25:44,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 09:25:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 09:25:44,552 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 09:25:44,552 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 09:25:44,553 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 09:25:44,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-12-25 09:25:44,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 09:25:44,759 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 09:25:44,761 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 09:25:44,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 09:25:44 BoogieIcfgContainer [2023-12-25 09:25:44,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 09:25:44,895 INFO L158 Benchmark]: Toolchain (without parser) took 318232.42ms. Allocated memory was 262.1MB in the beginning and 653.3MB in the end (delta: 391.1MB). Free memory was 220.1MB in the beginning and 126.1MB in the end (delta: 94.0MB). Peak memory consumption was 486.5MB. Max. memory is 8.0GB. [2023-12-25 09:25:44,895 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory was 147.5MB in the beginning and 147.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 09:25:44,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.37ms. Allocated memory is still 262.1MB. Free memory was 219.7MB in the beginning and 203.6MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-25 09:25:44,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.44ms. Allocated memory is still 262.1MB. Free memory was 203.6MB in the beginning and 201.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 09:25:44,897 INFO L158 Benchmark]: Boogie Preprocessor took 35.62ms. Allocated memory is still 262.1MB. Free memory was 201.3MB in the beginning and 198.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 09:25:44,897 INFO L158 Benchmark]: RCFGBuilder took 529.22ms. Allocated memory is still 262.1MB. Free memory was 198.4MB in the beginning and 226.0MB in the end (delta: -27.6MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2023-12-25 09:25:44,898 INFO L158 Benchmark]: TraceAbstraction took 317399.39ms. Allocated memory was 262.1MB in the beginning and 653.3MB in the end (delta: 391.1MB). Free memory was 224.9MB in the beginning and 126.1MB in the end (delta: 98.8MB). Peak memory consumption was 489.9MB. Max. memory is 8.0GB. [2023-12-25 09:25:44,898 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory was 147.5MB in the beginning and 147.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.37ms. Allocated memory is still 262.1MB. Free memory was 219.7MB in the beginning and 203.6MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.44ms. Allocated memory is still 262.1MB. Free memory was 203.6MB in the beginning and 201.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.62ms. Allocated memory is still 262.1MB. Free memory was 201.3MB in the beginning and 198.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 529.22ms. Allocated memory is still 262.1MB. Free memory was 198.4MB in the beginning and 226.0MB in the end (delta: -27.6MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. * TraceAbstraction took 317399.39ms. Allocated memory was 262.1MB in the beginning and 653.3MB in the end (delta: 391.1MB). Free memory was 224.9MB in the beginning and 126.1MB in the end (delta: 98.8MB). Peak memory consumption was 489.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 212]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] char r1 = '\x0'; [L27] port_t p1 = 0; [L28] char p1_old = '\x0'; [L29] char p1_new = '\x0'; [L30] char id1 = '\x0'; [L31] char st1 = '\x0'; [L32] msg_t send1 = '\x0'; [L33] _Bool mode1 = 0; [L34] _Bool alive1 = 0; [L35] port_t p2 = 0; [L36] char p2_old = '\x0'; [L37] char p2_new = '\x0'; [L38] char id2 = '\x0'; [L39] char st2 = '\x0'; [L40] msg_t send2 = '\x0'; [L41] _Bool mode2 = 0; [L42] _Bool alive2 = 0; [L43] port_t p3 = 0; [L44] char p3_old = '\x0'; [L45] char p3_new = '\x0'; [L46] char id3 = '\x0'; [L47] char st3 = '\x0'; [L48] msg_t send3 = '\x0'; [L49] _Bool mode3 = 0; [L50] _Bool alive3 = 0; [L54] void (*nodes[3])() = { &node1, &node2, &node3 }; [L58] int __return_6067; [L59] int __return_6163; [L60] int __return_6228; [L63] int main__c1; [L64] int main__i2; [L65] main__c1 = 0 [L66] r1 = __VERIFIER_nondet_char() [L67] id1 = __VERIFIER_nondet_char() [L68] st1 = __VERIFIER_nondet_char() [L69] send1 = __VERIFIER_nondet_char() [L70] mode1 = __VERIFIER_nondet_bool() [L71] alive1 = __VERIFIER_nondet_bool() [L72] id2 = __VERIFIER_nondet_char() [L73] st2 = __VERIFIER_nondet_char() [L74] send2 = __VERIFIER_nondet_char() [L75] mode2 = __VERIFIER_nondet_bool() [L76] alive2 = __VERIFIER_nondet_bool() [L77] id3 = __VERIFIER_nondet_char() [L78] st3 = __VERIFIER_nondet_char() [L79] send3 = __VERIFIER_nondet_char() [L80] mode3 = __VERIFIER_nondet_bool() [L81] alive3 = __VERIFIER_nondet_bool() [L83] int init__tmp; VAL [__return_6067=0, __return_6163=0, __return_6228=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] [L84] COND TRUE ((int)r1) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=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] [L86] COND TRUE ((((int)alive1) + ((int)alive2)) + ((int)alive3)) >= 1 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, 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] [L88] COND TRUE ((int)id1) >= 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=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] [L90] COND TRUE ((int)st1) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=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, st1=0] [L92] COND TRUE ((int)send1) == ((int)id1) VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=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, send1=0, st1=0] [L94] COND TRUE ((int)mode1) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=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=0, st1=0] [L96] COND TRUE ((int)id2) >= 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=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=0, st1=0] [L98] COND TRUE ((int)st2) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=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=0, st1=0, st2=0] [L100] COND TRUE ((int)send2) == ((int)id2) VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=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=0, send2=64, st1=0, st2=0] [L102] COND TRUE ((int)mode2) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, 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=0, send2=64, st1=0, st2=0] [L104] COND TRUE ((int)id3) >= 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, st1=0, st2=0] [L106] COND TRUE ((int)st3) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, st1=0, st2=0, st3=0] [L108] COND TRUE ((int)send3) == ((int)id3) VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L110] COND TRUE ((int)mode3) == 0 VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L112] COND TRUE ((int)id1) != ((int)id2) VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L114] COND TRUE ((int)id1) != ((int)id3) VAL [__return_6067=0, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L116] COND TRUE ((int)id2) != ((int)id3) [L118] init__tmp = 1 [L119] __return_6067 = init__tmp [L120] main__i2 = __return_6067 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L121] COND TRUE main__i2 != 0 [L123] p1_old = nomsg [L124] p1_new = nomsg [L125] p2_old = nomsg [L126] p2_new = nomsg [L127] p3_old = nomsg [L128] p3_new = nomsg [L129] main__i2 = 0 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L442] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L453] mode1 = 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, 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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L155] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L356] COND FALSE !(!(alive2 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L384] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L270] COND TRUE !(alive3 == 0) [L272] int node3____CPAchecker_TMP_0; VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L273] COND TRUE send3 != nomsg VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L275] COND TRUE p3_new == nomsg [L277] node3____CPAchecker_TMP_0 = send3 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L279] p3_new = node3____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, alive1=0, alive2=0, alive3=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=0, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main__c1=1, main__i2=0, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=0, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L136] COND TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=0, send2=64, send3=96, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L150] mode1 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L155] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L159] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L168] mode2 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L173] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L177] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L186] mode3 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=0, main__c1=1, main__i2=1, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L442] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L453] mode1 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L155] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L356] COND FALSE !(!(alive2 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L384] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L270] COND TRUE !(alive3 == 0) [L272] int node3____CPAchecker_TMP_0; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L273] COND TRUE send3 != nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L275] COND TRUE p3_new == nomsg [L277] node3____CPAchecker_TMP_0 = send3 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L279] p3_new = node3____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=1, main__c1=1, main__i2=2, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=1, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L136] COND TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L150] mode1 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L155] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L159] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L168] mode2 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L173] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L177] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L186] mode3 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=2, main__c1=1, main__i2=3, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L136] COND FALSE !(!(mode1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L442] COND FALSE !(!(alive1 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=0, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L453] mode1 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L155] COND FALSE !(!(mode2 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L356] COND FALSE !(!(alive2 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L384] COND FALSE !(((int)send2) != ((int)id2)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=0, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L367] mode2 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L173] COND FALSE !(!(mode3 == 0)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L270] COND TRUE !(alive3 == 0) [L272] int node3____CPAchecker_TMP_0; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L273] COND TRUE send3 != nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L275] COND TRUE p3_new == nomsg [L277] node3____CPAchecker_TMP_0 = send3 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L279] p3_new = node3____CPAchecker_TMP_0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=0, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L281] mode3 = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=96, p3_old=-1, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L198] COND TRUE ((int)r1) < 3 [L200] check__tmp = 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=3, main__c1=1, main__i2=4, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L210] COND FALSE !(assert__arg == 0) [L217] int main____CPAchecker_TMP_0 = main__i2; [L218] main__i2 = main__i2 + 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L131] COND TRUE main__i2 < 6 [L134] msg_t node1__m1; [L135] node1__m1 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=-1, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=96, r1=2, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L136] COND TRUE !(mode1 == 0) [L138] r1 = (char)(((int)r1) + 1) [L139] node1__m1 = p3_old [L140] p3_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L141] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(alive1 == 0)) [L431] send1 = node1__m1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=1, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L150] mode1 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L153] msg_t node2__m2; [L154] node2__m2 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L155] COND TRUE !(mode2 == 0) [L157] node2__m2 = p1_old [L158] p1_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L159] COND FALSE !(((int)node2__m2) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=1, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L168] mode2 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L171] msg_t node3__m3; [L172] node3__m3 = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L173] COND TRUE !(mode3 == 0) [L175] node3__m3 = p2_old [L176] p2_old = nomsg VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L177] COND FALSE !(((int)node3__m3) != ((int)nomsg)) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=1, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L186] mode3 = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L188] p1_old = p1_new [L189] p1_new = nomsg [L190] p2_old = p2_new [L191] p2_new = nomsg [L192] p3_old = p3_new [L193] p3_new = nomsg [L195] int check__tmp; VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L196] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L198] COND FALSE !(((int)r1) < 3) VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L225] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 1) [L232] check__tmp = 0 VAL [__return_6067=1, __return_6163=1, __return_6228=0, __return_main=0, __tmp_1=1, alive1=0, alive2=0, alive3=1, assert__arg=1, check__tmp=0, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=1, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L203] __return_6163 = check__tmp [L204] main__c1 = __return_6163 [L206] _Bool __tmp_1; [L207] __tmp_1 = main__c1 [L208] _Bool assert__arg; [L209] assert__arg = __tmp_1 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, __tmp_1=0, alive1=0, alive2=0, alive3=1, assert__arg=0, check__tmp=0, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L210] COND TRUE assert__arg == 0 VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, __tmp_1=0, alive1=0, alive2=0, alive3=1, assert__arg=0, check__tmp=0, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] [L212] reach_error() VAL [__return_6067=1, __return_6163=0, __return_6228=0, __return_main=0, __tmp_1=0, alive1=0, alive2=0, alive3=1, assert__arg=0, check__tmp=0, id1=0, id2=64, id3=96, init__tmp=1, main____CPAchecker_TMP_0=4, main__c1=0, main__i2=5, mode1=0, mode2=0, mode3=0, node1__m1=96, node2__m2=-1, node3____CPAchecker_TMP_0=96, node3__m3=-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=3, send1=96, send2=64, send3=96, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 317.2s, OverallIterations: 40, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 280.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39059 SdHoareTripleChecker+Valid, 33.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39059 mSDsluCounter, 59060 SdHoareTripleChecker+Invalid, 30.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52539 mSDsCounter, 771 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25934 IncrementalHoareTripleChecker+Invalid, 26705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 771 mSolverCounterUnsat, 6521 mSDtfsCounter, 25934 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6359 GetRequests, 4240 SyntacticMatches, 0 SemanticMatches, 2119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284426 ImplicationChecksByTransitivity, 251.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16447occurred in iteration=39, InterpolantAutomatonStates: 1858, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 114533 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 2994 NumberOfCodeBlocks, 2994 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4589 ConstructedInterpolants, 952 QuantifiedInterpolants, 50040 SizeOfPredicates, 157 NumberOfNonLiveVariables, 6094 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 58 InterpolantComputations, 20 PerfectInterpolantSequences, 1565/2466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 09:25:45,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...