/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/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 23:38:10,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 23:38:10,322 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-21 23:38:10,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 23:38:10,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 23:38:10,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 23:38:10,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 23:38:10,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 23:38:10,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 23:38:10,351 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 23:38:10,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 23:38:10,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 23:38:10,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 23:38:10,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 23:38:10,353 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 23:38:10,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 23:38:10,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 23:38:10,354 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 23:38:10,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 23:38:10,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 23:38:10,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 23:38:10,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 23:38:10,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 23:38:10,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 23:38:10,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 23:38:10,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 23:38:10,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 23:38:10,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 23:38:10,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 23:38:10,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 23:38:10,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 23:38:10,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 23:38:10,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:38:10,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 23:38:10,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 23:38:10,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 23:38:10,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 23:38:10,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 23:38:10,359 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 23:38:10,359 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-21 23:38:10,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 23:38:10,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 23:38:10,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 23:38:10,558 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 23:38:10,558 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 23:38:10,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2023-12-21 23:38:11,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 23:38:11,926 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 23:38:11,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2023-12-21 23:38:11,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50f88f22/4a6f67d1a9fb40daa7143ac3c5a7df67/FLAG5e2ecca7a [2023-12-21 23:38:11,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50f88f22/4a6f67d1a9fb40daa7143ac3c5a7df67 [2023-12-21 23:38:11,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 23:38:11,970 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 23:38:11,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 23:38:11,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 23:38:11,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 23:38:11,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:38:11" (1/1) ... [2023-12-21 23:38:11,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2037bf26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:11, skipping insertion in model container [2023-12-21 23:38:11,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:38:11" (1/1) ... [2023-12-21 23:38:12,073 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 23:38:12,383 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2023-12-21 23:38:12,433 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2023-12-21 23:38:12,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:38:12,943 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 23:38:12,973 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2023-12-21 23:38:12,983 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2023-12-21 23:38:13,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:38:13,349 INFO L206 MainTranslator]: Completed translation [2023-12-21 23:38:13,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13 WrapperNode [2023-12-21 23:38:13,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 23:38:13,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 23:38:13,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 23:38:13,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 23:38:13,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,533 INFO L138 Inliner]: procedures = 36, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4963 [2023-12-21 23:38:13,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 23:38:13,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 23:38:13,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 23:38:13,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 23:38:13,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,614 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-21 23:38:13,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 23:38:13,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 23:38:13,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 23:38:13,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 23:38:13,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (1/1) ... [2023-12-21 23:38:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:38:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 23:38:13,829 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-21 23:38:13,834 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-21 23:38:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 23:38:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 23:38:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 23:38:13,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 23:38:13,941 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 23:38:13,942 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 23:38:38,107 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 23:38:38,166 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 23:38:38,167 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 23:38:38,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:38:38 BoogieIcfgContainer [2023-12-21 23:38:38,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 23:38:38,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 23:38:38,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 23:38:38,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 23:38:38,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:38:11" (1/3) ... [2023-12-21 23:38:38,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5364d6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:38:38, skipping insertion in model container [2023-12-21 23:38:38,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:38:13" (2/3) ... [2023-12-21 23:38:38,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5364d6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:38:38, skipping insertion in model container [2023-12-21 23:38:38,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:38:38" (3/3) ... [2023-12-21 23:38:38,179 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2023-12-21 23:38:38,192 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 23:38:38,193 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 23:38:38,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 23:38:38,260 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;@132063c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 23:38:38,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 23:38:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:38:38,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:38,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:38,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:38,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2106044916, now seen corresponding path program 1 times [2023-12-21 23:38:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:38,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906696982] [2023-12-21 23:38:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:38,290 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-21 23:38:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:38,293 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-21 23:38:38,298 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-21 23:38:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:38,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 23:38:38,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:38,381 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-21 23:38:38,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:38,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906696982] [2023-12-21 23:38:38,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906696982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:38,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:38,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:38:38,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714471935] [2023-12-21 23:38:38,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:38,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 23:38:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 23:38:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:38:38,407 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 0 states have call successors, (0), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:38,472 INFO L93 Difference]: Finished difference Result 1597 states and 3151 transitions. [2023-12-21 23:38:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 23:38:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-12-21 23:38:38,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:38,486 INFO L225 Difference]: With dead ends: 1597 [2023-12-21 23:38:38,486 INFO L226 Difference]: Without dead ends: 805 [2023-12-21 23:38:38,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:38:38,495 INFO L413 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:38,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-21 23:38:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2023-12-21 23:38:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2023-12-21 23:38:38,570 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2023-12-21 23:38:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:38,571 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2023-12-21 23:38:38,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2023-12-21 23:38:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:38:38,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:38,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:38,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:38,774 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-21 23:38:38,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:38,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1602116366, now seen corresponding path program 1 times [2023-12-21 23:38:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:38,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008222730] [2023-12-21 23:38:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:38,776 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-21 23:38:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:38,782 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-21 23:38:38,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 (3)] Waiting until timeout for monitored process [2023-12-21 23:38:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:38,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:38:38,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:38,895 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-21 23:38:38,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:38,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008222730] [2023-12-21 23:38:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008222730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:38,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:38:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814739784] [2023-12-21 23:38:38,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:38,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:38:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:38,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:38:38,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:38:38,903 INFO L87 Difference]: Start difference. First operand 805 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:38,977 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2023-12-21 23:38:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:38:38,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-12-21 23:38:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:38,983 INFO L225 Difference]: With dead ends: 839 [2023-12-21 23:38:38,983 INFO L226 Difference]: Without dead ends: 805 [2023-12-21 23:38:38,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:38:38,985 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:38,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4543 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-21 23:38:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2023-12-21 23:38:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2023-12-21 23:38:39,016 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2023-12-21 23:38:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:39,016 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2023-12-21 23:38:39,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2023-12-21 23:38:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 23:38:39,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:39,018 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] [2023-12-21 23:38:39,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-21 23:38:39,221 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-21 23:38:39,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:39,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1530210848, now seen corresponding path program 1 times [2023-12-21 23:38:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123351050] [2023-12-21 23:38:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:39,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:39,224 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-21 23:38:39,226 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-21 23:38:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:39,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:38:39,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:39,566 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-21 23:38:39,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:39,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:39,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123351050] [2023-12-21 23:38:39,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123351050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:39,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:39,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:38:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440267398] [2023-12-21 23:38:39,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:39,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:38:39,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:39,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:38:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:38:39,568 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:39,696 INFO L93 Difference]: Finished difference Result 929 states and 1704 transitions. [2023-12-21 23:38:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:38:39,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2023-12-21 23:38:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:39,700 INFO L225 Difference]: With dead ends: 929 [2023-12-21 23:38:39,701 INFO L226 Difference]: Without dead ends: 898 [2023-12-21 23:38:39,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-21 23:38:39,703 INFO L413 NwaCegarLoop]: 1499 mSDtfsCounter, 1571 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:39,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1661 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:38:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2023-12-21 23:38:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 863. [2023-12-21 23:38:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 861 states have (on average 1.859465737514518) internal successors, (1601), 862 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1601 transitions. [2023-12-21 23:38:39,721 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1601 transitions. Word has length 32 [2023-12-21 23:38:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:39,722 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1601 transitions. [2023-12-21 23:38:39,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1601 transitions. [2023-12-21 23:38:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 23:38:39,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:39,726 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] [2023-12-21 23:38:39,729 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-21 23:38:39,929 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-21 23:38:39,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:39,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1777422384, now seen corresponding path program 1 times [2023-12-21 23:38:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:39,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324598448] [2023-12-21 23:38:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:39,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:39,932 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-21 23:38:39,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 23:38:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:39,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:39,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:40,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:40,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324598448] [2023-12-21 23:38:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324598448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:40,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:40,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444521892] [2023-12-21 23:38:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:40,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:40,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:40,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:40,057 INFO L87 Difference]: Start difference. First operand 863 states and 1601 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:40,114 INFO L93 Difference]: Finished difference Result 1025 states and 1857 transitions. [2023-12-21 23:38:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2023-12-21 23:38:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:40,118 INFO L225 Difference]: With dead ends: 1025 [2023-12-21 23:38:40,118 INFO L226 Difference]: Without dead ends: 936 [2023-12-21 23:38:40,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-21 23:38:40,119 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1466 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:40,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1542 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2023-12-21 23:38:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 931. [2023-12-21 23:38:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 929 states have (on average 1.8331539289558665) internal successors, (1703), 930 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1703 transitions. [2023-12-21 23:38:40,137 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1703 transitions. Word has length 34 [2023-12-21 23:38:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:40,138 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1703 transitions. [2023-12-21 23:38:40,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1703 transitions. [2023-12-21 23:38:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 23:38:40,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:40,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:40,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:40,341 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-21 23:38:40,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:40,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash 672590802, now seen corresponding path program 1 times [2023-12-21 23:38:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:40,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809841776] [2023-12-21 23:38:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:40,343 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-21 23:38:40,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:40,344 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-21 23:38:40,347 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-21 23:38:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:40,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:38:40,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:40,416 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-21 23:38:40,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:40,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:40,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809841776] [2023-12-21 23:38:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809841776] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:40,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:38:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052683131] [2023-12-21 23:38:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:40,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:38:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:38:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:38:40,418 INFO L87 Difference]: Start difference. First operand 931 states and 1703 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:40,481 INFO L93 Difference]: Finished difference Result 945 states and 1720 transitions. [2023-12-21 23:38:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:38:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-21 23:38:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:40,485 INFO L225 Difference]: With dead ends: 945 [2023-12-21 23:38:40,485 INFO L226 Difference]: Without dead ends: 943 [2023-12-21 23:38:40,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:38:40,486 INFO L413 NwaCegarLoop]: 1504 mSDtfsCounter, 1 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4504 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-21 23:38:40,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2023-12-21 23:38:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 939. [2023-12-21 23:38:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 937 states have (on average 1.8249733191035218) internal successors, (1710), 938 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1710 transitions. [2023-12-21 23:38:40,504 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1710 transitions. Word has length 35 [2023-12-21 23:38:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:40,505 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1710 transitions. [2023-12-21 23:38:40,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1710 transitions. [2023-12-21 23:38:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:38:40,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:40,513 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-21 23:38:40,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-21 23:38:40,716 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-21 23:38:40,716 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:40,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1662873624, now seen corresponding path program 1 times [2023-12-21 23:38:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:40,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909600676] [2023-12-21 23:38:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:40,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:40,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:40,720 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-21 23:38:40,721 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-21 23:38:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:40,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:40,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:40,809 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-21 23:38:40,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:40,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:40,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909600676] [2023-12-21 23:38:40,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909600676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:40,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:40,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:40,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60765889] [2023-12-21 23:38:40,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:40,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:40,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:40,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:40,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:40,811 INFO L87 Difference]: Start difference. First operand 939 states and 1710 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:40,840 INFO L93 Difference]: Finished difference Result 1245 states and 2170 transitions. [2023-12-21 23:38:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:40,840 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-21 23:38:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:40,843 INFO L225 Difference]: With dead ends: 1245 [2023-12-21 23:38:40,843 INFO L226 Difference]: Without dead ends: 1080 [2023-12-21 23:38:40,844 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-21 23:38:40,844 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 1473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1577 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-21 23:38:40,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1577 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-12-21 23:38:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2023-12-21 23:38:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.7769516728624535) internal successors, (1912), 1077 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1912 transitions. [2023-12-21 23:38:40,860 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1912 transitions. Word has length 36 [2023-12-21 23:38:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:40,860 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 1912 transitions. [2023-12-21 23:38:40,860 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-21 23:38:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1912 transitions. [2023-12-21 23:38:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:38:40,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:40,861 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-21 23:38:40,863 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-21 23:38:41,063 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-21 23:38:41,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:41,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1743360232, now seen corresponding path program 1 times [2023-12-21 23:38:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177149595] [2023-12-21 23:38:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:41,065 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-21 23:38:41,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:41,066 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-21 23:38:41,104 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-21 23:38:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:41,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:41,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:41,141 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-21 23:38:41,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:41,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:41,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177149595] [2023-12-21 23:38:41,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177149595] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:41,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:41,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032478662] [2023-12-21 23:38:41,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:41,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:41,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:41,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:41,142 INFO L87 Difference]: Start difference. First operand 1078 states and 1912 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:41,173 INFO L93 Difference]: Finished difference Result 1638 states and 2734 transitions. [2023-12-21 23:38:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:41,173 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-21 23:38:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:41,177 INFO L225 Difference]: With dead ends: 1638 [2023-12-21 23:38:41,177 INFO L226 Difference]: Without dead ends: 1334 [2023-12-21 23:38:41,178 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-21 23:38:41,178 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 1475 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1583 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-21 23:38:41,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1583 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2023-12-21 23:38:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1332. [2023-12-21 23:38:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1330 states have (on average 1.7052631578947368) internal successors, (2268), 1331 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2268 transitions. [2023-12-21 23:38:41,196 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2268 transitions. Word has length 36 [2023-12-21 23:38:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:41,196 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 2268 transitions. [2023-12-21 23:38:41,196 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-21 23:38:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2268 transitions. [2023-12-21 23:38:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-21 23:38:41,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:41,197 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-21 23:38:41,199 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-21 23:38:41,399 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-21 23:38:41,400 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:41,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:41,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1790190323, now seen corresponding path program 1 times [2023-12-21 23:38:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922118647] [2023-12-21 23:38:41,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:41,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:41,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:41,402 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-21 23:38:41,404 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-21 23:38:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:41,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:41,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:41,484 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-21 23:38:41,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:41,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:41,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922118647] [2023-12-21 23:38:41,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922118647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:41,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:41,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359070768] [2023-12-21 23:38:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:41,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:41,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:41,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:41,485 INFO L87 Difference]: Start difference. First operand 1332 states and 2268 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-21 23:38:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:41,521 INFO L93 Difference]: Finished difference Result 1915 states and 3138 transitions. [2023-12-21 23:38:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:41,522 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-21 23:38:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:41,527 INFO L225 Difference]: With dead ends: 1915 [2023-12-21 23:38:41,527 INFO L226 Difference]: Without dead ends: 1588 [2023-12-21 23:38:41,528 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-21 23:38:41,529 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 1474 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1584 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-21 23:38:41,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2023-12-21 23:38:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1586. [2023-12-21 23:38:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1584 states have (on average 1.6603535353535352) internal successors, (2630), 1585 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2630 transitions. [2023-12-21 23:38:41,558 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2630 transitions. Word has length 38 [2023-12-21 23:38:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:41,558 INFO L495 AbstractCegarLoop]: Abstraction has 1586 states and 2630 transitions. [2023-12-21 23:38:41,558 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-21 23:38:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2630 transitions. [2023-12-21 23:38:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:38:41,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:41,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:41,565 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-21 23:38:41,762 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-21 23:38:41,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:41,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1801881872, now seen corresponding path program 1 times [2023-12-21 23:38:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741086654] [2023-12-21 23:38:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:41,764 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-21 23:38:41,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:41,765 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-21 23:38:41,765 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-21 23:38:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:41,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:41,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:41,909 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-21 23:38:41,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:41,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741086654] [2023-12-21 23:38:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741086654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933926327] [2023-12-21 23:38:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:41,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:41,911 INFO L87 Difference]: Start difference. First operand 1586 states and 2630 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:41,942 INFO L93 Difference]: Finished difference Result 2181 states and 3500 transitions. [2023-12-21 23:38:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-21 23:38:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:41,947 INFO L225 Difference]: With dead ends: 2181 [2023-12-21 23:38:41,947 INFO L226 Difference]: Without dead ends: 1371 [2023-12-21 23:38:41,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-21 23:38:41,948 INFO L413 NwaCegarLoop]: 1529 mSDtfsCounter, 34 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:41,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3020 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2023-12-21 23:38:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2023-12-21 23:38:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1367 states have (on average 1.6949524506217997) internal successors, (2317), 1368 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2317 transitions. [2023-12-21 23:38:41,968 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2317 transitions. Word has length 50 [2023-12-21 23:38:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:41,968 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 2317 transitions. [2023-12-21 23:38:41,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2317 transitions. [2023-12-21 23:38:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 23:38:41,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:41,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:41,988 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-21 23:38:42,172 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-21 23:38:42,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:42,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -759813067, now seen corresponding path program 1 times [2023-12-21 23:38:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288813593] [2023-12-21 23:38:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:42,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:42,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:42,177 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-21 23:38:42,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 23:38:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:42,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:38:42,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:42,824 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-21 23:38:42,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:43,122 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-21 23:38:43,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288813593] [2023-12-21 23:38:43,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288813593] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:43,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:43,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211471562] [2023-12-21 23:38:43,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:43,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:43,124 INFO L87 Difference]: Start difference. First operand 1369 states and 2317 transitions. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:44,630 INFO L93 Difference]: Finished difference Result 2897 states and 4488 transitions. [2023-12-21 23:38:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 23:38:44,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-21 23:38:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:44,637 INFO L225 Difference]: With dead ends: 2897 [2023-12-21 23:38:44,638 INFO L226 Difference]: Without dead ends: 2319 [2023-12-21 23:38:44,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-21 23:38:44,640 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 6292 mSDsluCounter, 12057 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6292 SdHoareTripleChecker+Valid, 13569 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:44,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6292 Valid, 13569 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 23:38:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-12-21 23:38:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1945. [2023-12-21 23:38:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1943 states have (on average 1.6186309830159546) internal successors, (3145), 1944 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3145 transitions. [2023-12-21 23:38:44,683 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3145 transitions. Word has length 52 [2023-12-21 23:38:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:44,684 INFO L495 AbstractCegarLoop]: Abstraction has 1945 states and 3145 transitions. [2023-12-21 23:38:44,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3145 transitions. [2023-12-21 23:38:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-21 23:38:44,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:44,684 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] [2023-12-21 23:38:44,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:44,887 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-21 23:38:44,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:44,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1248913717, now seen corresponding path program 1 times [2023-12-21 23:38:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:44,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970286354] [2023-12-21 23:38:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:44,889 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-21 23:38:44,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:44,890 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-21 23:38:44,894 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-21 23:38:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:44,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:44,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:45,018 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-21 23:38:45,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:45,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970286354] [2023-12-21 23:38:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970286354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:45,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:45,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194835028] [2023-12-21 23:38:45,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:45,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:45,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:45,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:45,019 INFO L87 Difference]: Start difference. First operand 1945 states and 3145 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:45,053 INFO L93 Difference]: Finished difference Result 2525 states and 3981 transitions. [2023-12-21 23:38:45,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-21 23:38:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:45,058 INFO L225 Difference]: With dead ends: 2525 [2023-12-21 23:38:45,058 INFO L226 Difference]: Without dead ends: 1371 [2023-12-21 23:38:45,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:45,060 INFO L413 NwaCegarLoop]: 1522 mSDtfsCounter, 28 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:45,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3005 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2023-12-21 23:38:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2023-12-21 23:38:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1367 states have (on average 1.681784930504755) internal successors, (2299), 1368 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2299 transitions. [2023-12-21 23:38:45,085 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2299 transitions. Word has length 54 [2023-12-21 23:38:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:45,086 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 2299 transitions. [2023-12-21 23:38:45,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2299 transitions. [2023-12-21 23:38:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 23:38:45,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:45,086 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] [2023-12-21 23:38:45,089 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-21 23:38:45,289 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-21 23:38:45,289 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:45,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash -268698074, now seen corresponding path program 1 times [2023-12-21 23:38:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660425434] [2023-12-21 23:38:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:45,290 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-21 23:38:45,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:45,291 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-21 23:38:45,295 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-21 23:38:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:45,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:38:45,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:46,016 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-21 23:38:46,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:46,301 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-21 23:38:46,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660425434] [2023-12-21 23:38:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660425434] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:46,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564229232] [2023-12-21 23:38:46,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:46,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:46,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:46,303 INFO L87 Difference]: Start difference. First operand 1369 states and 2299 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 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-21 23:38:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:47,048 INFO L93 Difference]: Finished difference Result 1983 states and 3162 transitions. [2023-12-21 23:38:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 23:38:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 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 55 [2023-12-21 23:38:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:47,053 INFO L225 Difference]: With dead ends: 1983 [2023-12-21 23:38:47,053 INFO L226 Difference]: Without dead ends: 1405 [2023-12-21 23:38:47,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-12-21 23:38:47,055 INFO L413 NwaCegarLoop]: 1477 mSDtfsCounter, 3101 mSDsluCounter, 11811 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3101 SdHoareTripleChecker+Valid, 13288 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:47,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3101 Valid, 13288 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 23:38:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2023-12-21 23:38:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1379. [2023-12-21 23:38:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1377 states have (on average 1.6782861292665214) internal successors, (2311), 1378 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2311 transitions. [2023-12-21 23:38:47,080 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2311 transitions. Word has length 55 [2023-12-21 23:38:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:47,080 INFO L495 AbstractCegarLoop]: Abstraction has 1379 states and 2311 transitions. [2023-12-21 23:38:47,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 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-21 23:38:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2311 transitions. [2023-12-21 23:38:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-21 23:38:47,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:47,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:47,086 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-21 23:38:47,284 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-21 23:38:47,284 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:47,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -803432142, now seen corresponding path program 1 times [2023-12-21 23:38:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690908887] [2023-12-21 23:38:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:47,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:47,286 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-21 23:38:47,288 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-21 23:38:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:47,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:47,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:47,378 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-21 23:38:47,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:47,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690908887] [2023-12-21 23:38:47,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690908887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:47,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:47,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:47,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874961260] [2023-12-21 23:38:47,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:47,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:47,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:47,379 INFO L87 Difference]: Start difference. First operand 1379 states and 2311 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:47,407 INFO L93 Difference]: Finished difference Result 1671 states and 2721 transitions. [2023-12-21 23:38:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-21 23:38:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:47,411 INFO L225 Difference]: With dead ends: 1671 [2023-12-21 23:38:47,411 INFO L226 Difference]: Without dead ends: 1093 [2023-12-21 23:38:47,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-21 23:38:47,412 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 24 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:47,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2990 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2023-12-21 23:38:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1091. [2023-12-21 23:38:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1089 states have (on average 1.736455463728191) internal successors, (1891), 1090 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1891 transitions. [2023-12-21 23:38:47,428 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1891 transitions. Word has length 57 [2023-12-21 23:38:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:47,429 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1891 transitions. [2023-12-21 23:38:47,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1891 transitions. [2023-12-21 23:38:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 23:38:47,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:47,429 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] [2023-12-21 23:38:47,434 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-21 23:38:47,634 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-21 23:38:47,634 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:47,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1421823177, now seen corresponding path program 1 times [2023-12-21 23:38:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679438156] [2023-12-21 23:38:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:38:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:47,636 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-21 23:38:47,637 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-21 23:38:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:47,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:38:47,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:48,382 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-21 23:38:48,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:48,652 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-21 23:38:48,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679438156] [2023-12-21 23:38:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679438156] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:48,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850696232] [2023-12-21 23:38:48,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:48,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:48,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:48,653 INFO L87 Difference]: Start difference. First operand 1091 states and 1891 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 16 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-21 23:38:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:49,363 INFO L93 Difference]: Finished difference Result 1661 states and 2664 transitions. [2023-12-21 23:38:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 23:38:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 16 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 58 [2023-12-21 23:38:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:49,367 INFO L225 Difference]: With dead ends: 1661 [2023-12-21 23:38:49,367 INFO L226 Difference]: Without dead ends: 1371 [2023-12-21 23:38:49,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-21 23:38:49,368 INFO L413 NwaCegarLoop]: 1513 mSDtfsCounter, 4697 mSDsluCounter, 8993 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4697 SdHoareTripleChecker+Valid, 10506 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:49,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4697 Valid, 10506 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 23:38:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2023-12-21 23:38:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1307. [2023-12-21 23:38:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1305 states have (on average 1.6666666666666667) internal successors, (2175), 1306 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2175 transitions. [2023-12-21 23:38:49,397 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2175 transitions. Word has length 58 [2023-12-21 23:38:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:49,397 INFO L495 AbstractCegarLoop]: Abstraction has 1307 states and 2175 transitions. [2023-12-21 23:38:49,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 16 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-21 23:38:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2175 transitions. [2023-12-21 23:38:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-21 23:38:49,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:49,398 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-21 23:38:49,403 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-21 23:38:49,603 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-21 23:38:49,603 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:49,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -337476511, now seen corresponding path program 1 times [2023-12-21 23:38:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012348378] [2023-12-21 23:38:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:49,604 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-21 23:38:49,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:49,605 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-21 23:38:49,632 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-21 23:38:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:49,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 23:38:49,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:38:49,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:38:49,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:49,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012348378] [2023-12-21 23:38:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012348378] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:49,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:49,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 23:38:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048589769] [2023-12-21 23:38:49,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:49,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 23:38:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 23:38:49,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 23:38:49,837 INFO L87 Difference]: Start difference. First operand 1307 states and 2175 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:49,921 INFO L93 Difference]: Finished difference Result 2303 states and 3488 transitions. [2023-12-21 23:38:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:38:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-21 23:38:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:49,926 INFO L225 Difference]: With dead ends: 2303 [2023-12-21 23:38:49,926 INFO L226 Difference]: Without dead ends: 1797 [2023-12-21 23:38:49,927 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-21 23:38:49,927 INFO L413 NwaCegarLoop]: 1513 mSDtfsCounter, 2946 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:49,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 3099 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:38:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2023-12-21 23:38:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1785. [2023-12-21 23:38:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1783 states have (on average 1.5277621985417835) internal successors, (2724), 1784 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2724 transitions. [2023-12-21 23:38:49,976 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2724 transitions. Word has length 60 [2023-12-21 23:38:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:49,976 INFO L495 AbstractCegarLoop]: Abstraction has 1785 states and 2724 transitions. [2023-12-21 23:38:49,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:38:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2724 transitions. [2023-12-21 23:38:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-21 23:38:49,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:49,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:49,982 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-21 23:38:50,182 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-21 23:38:50,183 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:50,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash -51771552, now seen corresponding path program 1 times [2023-12-21 23:38:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459241033] [2023-12-21 23:38:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:50,184 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-21 23:38:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:50,185 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-21 23:38:50,185 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-21 23:38:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:50,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:50,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:50,363 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-21 23:38:50,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:50,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:50,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459241033] [2023-12-21 23:38:50,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459241033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:50,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:50,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:38:50,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060806629] [2023-12-21 23:38:50,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:50,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:50,364 INFO L87 Difference]: Start difference. First operand 1785 states and 2724 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-21 23:39:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:24,248 INFO L93 Difference]: Finished difference Result 3289 states and 5597 transitions. [2023-12-21 23:39:24,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:39:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-21 23:39:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:24,255 INFO L225 Difference]: With dead ends: 3289 [2023-12-21 23:39:24,255 INFO L226 Difference]: Without dead ends: 2536 [2023-12-21 23:39:24,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:39:24,257 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 808 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:24,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 541 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 33.7s Time] [2023-12-21 23:39:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2023-12-21 23:39:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2023-12-21 23:39:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2534 states have (on average 1.4613259668508287) internal successors, (3703), 2535 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3703 transitions. [2023-12-21 23:39:24,306 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3703 transitions. Word has length 62 [2023-12-21 23:39:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:24,306 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3703 transitions. [2023-12-21 23:39:24,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-21 23:39:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3703 transitions. [2023-12-21 23:39:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-21 23:39:24,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:24,307 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:24,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-21 23:39:24,509 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-21 23:39:24,510 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:24,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1239890541, now seen corresponding path program 1 times [2023-12-21 23:39:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:24,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495953489] [2023-12-21 23:39:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:24,510 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-21 23:39:24,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:24,511 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-21 23:39:24,512 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-21 23:39:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:24,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:39:24,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:25,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:26,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495953489] [2023-12-21 23:39:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495953489] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:26,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:39:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149685785] [2023-12-21 23:39:26,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:26,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:39:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:26,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:39:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:39:26,026 INFO L87 Difference]: Start difference. First operand 2536 states and 3703 transitions. Second operand has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 25 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-21 23:39:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:27,677 INFO L93 Difference]: Finished difference Result 3192 states and 4539 transitions. [2023-12-21 23:39:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 23:39:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 25 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 95 [2023-12-21 23:39:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:27,684 INFO L225 Difference]: With dead ends: 3192 [2023-12-21 23:39:27,684 INFO L226 Difference]: Without dead ends: 2560 [2023-12-21 23:39:27,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 23:39:27,686 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 17812 mSDsluCounter, 7654 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17812 SdHoareTripleChecker+Valid, 9152 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:27,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17812 Valid, 9152 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 23:39:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2023-12-21 23:39:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2536. [2023-12-21 23:39:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2534 states have (on average 1.4546172059984215) internal successors, (3686), 2535 states have internal predecessors, (3686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3686 transitions. [2023-12-21 23:39:27,736 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3686 transitions. Word has length 95 [2023-12-21 23:39:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:27,736 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3686 transitions. [2023-12-21 23:39:27,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 25 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-21 23:39:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3686 transitions. [2023-12-21 23:39:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-21 23:39:27,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:27,737 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-12-21 23:39:27,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-21 23:39:27,940 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-21 23:39:27,941 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:27,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1998340414, now seen corresponding path program 1 times [2023-12-21 23:39:27,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:27,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821914722] [2023-12-21 23:39:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:27,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:39:27,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:27,943 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-21 23:39:27,947 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-21 23:39:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:28,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:39:28,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:29,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:29,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821914722] [2023-12-21 23:39:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821914722] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:29,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:29,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:39:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284693051] [2023-12-21 23:39:29,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:29,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:39:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:39:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:39:29,469 INFO L87 Difference]: Start difference. First operand 2536 states and 3686 transitions. Second operand has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 25 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:31,167 INFO L93 Difference]: Finished difference Result 3316 states and 4666 transitions. [2023-12-21 23:39:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 23:39:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 25 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-21 23:39:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:31,174 INFO L225 Difference]: With dead ends: 3316 [2023-12-21 23:39:31,174 INFO L226 Difference]: Without dead ends: 2538 [2023-12-21 23:39:31,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 23:39:31,175 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 14779 mSDsluCounter, 6176 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14779 SdHoareTripleChecker+Valid, 7674 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:31,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14779 Valid, 7674 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 23:39:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2023-12-21 23:39:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2536. [2023-12-21 23:39:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2534 states have (on average 1.4483030781373323) internal successors, (3670), 2535 states have internal predecessors, (3670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3670 transitions. [2023-12-21 23:39:31,230 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3670 transitions. Word has length 96 [2023-12-21 23:39:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:31,230 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3670 transitions. [2023-12-21 23:39:31,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 25 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3670 transitions. [2023-12-21 23:39:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-21 23:39:31,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:31,231 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:31,235 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-21 23:39:31,435 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-21 23:39:31,435 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:31,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1674432131, now seen corresponding path program 1 times [2023-12-21 23:39:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42036259] [2023-12-21 23:39:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:31,436 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-21 23:39:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:31,437 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-21 23:39:31,440 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-21 23:39:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:31,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:39:31,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:32,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:33,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:33,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42036259] [2023-12-21 23:39:33,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42036259] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:33,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:33,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:39:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326216985] [2023-12-21 23:39:33,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:33,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:39:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:39:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:39:33,285 INFO L87 Difference]: Start difference. First operand 2536 states and 3670 transitions. Second operand has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:35,980 INFO L93 Difference]: Finished difference Result 3380 states and 4717 transitions. [2023-12-21 23:39:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 23:39:35,980 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-21 23:39:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:35,985 INFO L225 Difference]: With dead ends: 3380 [2023-12-21 23:39:35,985 INFO L226 Difference]: Without dead ends: 2950 [2023-12-21 23:39:35,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 23:39:35,987 INFO L413 NwaCegarLoop]: 1524 mSDtfsCounter, 6210 mSDsluCounter, 22672 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6210 SdHoareTripleChecker+Valid, 24196 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:35,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6210 Valid, 24196 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-21 23:39:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2023-12-21 23:39:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2416. [2023-12-21 23:39:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2414 states have (on average 1.4618889809444904) internal successors, (3529), 2415 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3529 transitions. [2023-12-21 23:39:36,044 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3529 transitions. Word has length 97 [2023-12-21 23:39:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:36,044 INFO L495 AbstractCegarLoop]: Abstraction has 2416 states and 3529 transitions. [2023-12-21 23:39:36,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.230769230769231) internal successors, (188), 26 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3529 transitions. [2023-12-21 23:39:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-21 23:39:36,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:36,045 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:36,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-21 23:39:36,246 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-21 23:39:36,247 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:36,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2029137703, now seen corresponding path program 1 times [2023-12-21 23:39:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:36,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922502677] [2023-12-21 23:39:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:36,248 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-21 23:39:36,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:36,249 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-21 23:39:36,249 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-21 23:39:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:36,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:39:36,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:37,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:37,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:37,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922502677] [2023-12-21 23:39:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922502677] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:37,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:39:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503942434] [2023-12-21 23:39:37,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:37,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:39:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:37,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:39:37,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:39:37,982 INFO L87 Difference]: Start difference. First operand 2416 states and 3529 transitions. Second operand has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:43,177 INFO L93 Difference]: Finished difference Result 3128 states and 4402 transitions. [2023-12-21 23:39:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 23:39:43,177 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-21 23:39:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:43,181 INFO L225 Difference]: With dead ends: 3128 [2023-12-21 23:39:43,181 INFO L226 Difference]: Without dead ends: 2806 [2023-12-21 23:39:43,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 23:39:43,184 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 3510 mSDsluCounter, 20185 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3510 SdHoareTripleChecker+Valid, 21772 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:43,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3510 Valid, 21772 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-21 23:39:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2023-12-21 23:39:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2606. [2023-12-21 23:39:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2604 states have (on average 1.4408602150537635) internal successors, (3752), 2605 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3752 transitions. [2023-12-21 23:39:43,247 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3752 transitions. Word has length 97 [2023-12-21 23:39:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:43,247 INFO L495 AbstractCegarLoop]: Abstraction has 2606 states and 3752 transitions. [2023-12-21 23:39:43,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 26 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3752 transitions. [2023-12-21 23:39:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-21 23:39:43,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:43,248 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:43,251 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 (21)] Ended with exit code 0 [2023-12-21 23:39:43,451 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-21 23:39:43,451 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:43,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash -479947517, now seen corresponding path program 1 times [2023-12-21 23:39:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330097845] [2023-12-21 23:39:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:43,452 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-21 23:39:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:43,453 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-21 23:39:43,453 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-21 23:39:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:43,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:39:43,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:44,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:45,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330097845] [2023-12-21 23:39:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330097845] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:45,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:39:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019513775] [2023-12-21 23:39:45,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:45,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:39:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:39:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:39:45,082 INFO L87 Difference]: Start difference. First operand 2606 states and 3752 transitions. Second operand has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:50,870 INFO L93 Difference]: Finished difference Result 4370 states and 5871 transitions. [2023-12-21 23:39:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-21 23:39:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-21 23:39:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:50,876 INFO L225 Difference]: With dead ends: 4370 [2023-12-21 23:39:50,876 INFO L226 Difference]: Without dead ends: 4030 [2023-12-21 23:39:50,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1011, Invalid=4995, Unknown=0, NotChecked=0, Total=6006 [2023-12-21 23:39:50,878 INFO L413 NwaCegarLoop]: 1603 mSDtfsCounter, 3343 mSDsluCounter, 25036 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3343 SdHoareTripleChecker+Valid, 26639 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:50,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3343 Valid, 26639 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-21 23:39:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2023-12-21 23:39:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 3389. [2023-12-21 23:39:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 3387 states have (on average 1.3838204901092412) internal successors, (4687), 3388 states have internal predecessors, (4687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4687 transitions. [2023-12-21 23:39:50,981 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4687 transitions. Word has length 97 [2023-12-21 23:39:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:50,981 INFO L495 AbstractCegarLoop]: Abstraction has 3389 states and 4687 transitions. [2023-12-21 23:39:50,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:39:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4687 transitions. [2023-12-21 23:39:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:50,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:50,983 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-21 23:39:50,988 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-21 23:39:51,183 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-21 23:39:51,183 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:51,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:51,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1847311506, now seen corresponding path program 1 times [2023-12-21 23:39:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667890761] [2023-12-21 23:39:51,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:51,184 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-21 23:39:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:51,185 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-21 23:39:51,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-21 23:39:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:51,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:39:51,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:51,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:51,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667890761] [2023-12-21 23:39:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667890761] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:39:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082544772] [2023-12-21 23:39:51,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:51,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:39:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:51,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:39:51,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:39:51,358 INFO L87 Difference]: Start difference. First operand 3389 states and 4687 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 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-21 23:40:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:28,192 INFO L93 Difference]: Finished difference Result 6395 states and 9518 transitions. [2023-12-21 23:40:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:40:28,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 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) Word has length 130 [2023-12-21 23:40:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:28,199 INFO L225 Difference]: With dead ends: 6395 [2023-12-21 23:40:28,199 INFO L226 Difference]: Without dead ends: 4891 [2023-12-21 23:40:28,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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-21 23:40:28,201 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 764 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:28,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 719 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 36.6s Time] [2023-12-21 23:40:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4891 states. [2023-12-21 23:40:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4891 to 4891. [2023-12-21 23:40:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4889 states have (on average 1.3076293720597258) internal successors, (6393), 4890 states have internal predecessors, (6393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 6393 transitions. [2023-12-21 23:40:28,339 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 6393 transitions. Word has length 130 [2023-12-21 23:40:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:28,339 INFO L495 AbstractCegarLoop]: Abstraction has 4891 states and 6393 transitions. [2023-12-21 23:40:28,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 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-21 23:40:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 6393 transitions. [2023-12-21 23:40:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 23:40:28,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:28,341 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:40:28,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-21 23:40:28,544 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-21 23:40:28,545 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:28,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 52506505, now seen corresponding path program 2 times [2023-12-21 23:40:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545229059] [2023-12-21 23:40:28,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:40:28,546 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-21 23:40:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:28,547 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-21 23:40:28,548 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-21 23:40:28,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:40:28,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:40:28,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:40:28,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2023-12-21 23:40:29,020 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:40:29,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:29,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545229059] [2023-12-21 23:40:29,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545229059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:40:29,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:40:29,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:40:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568045182] [2023-12-21 23:40:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:40:29,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:40:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:40:29,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:40:29,022 INFO L87 Difference]: Start difference. First operand 4891 states and 6393 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:29,186 INFO L93 Difference]: Finished difference Result 5779 states and 7506 transitions. [2023-12-21 23:40:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:40:29,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2023-12-21 23:40:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:29,193 INFO L225 Difference]: With dead ends: 5779 [2023-12-21 23:40:29,193 INFO L226 Difference]: Without dead ends: 5031 [2023-12-21 23:40:29,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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-21 23:40:29,195 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 1535 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:29,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 3111 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:40:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2023-12-21 23:40:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 4875. [2023-12-21 23:40:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4873 states have (on average 1.3012517956084548) internal successors, (6341), 4874 states have internal predecessors, (6341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6341 transitions. [2023-12-21 23:40:29,347 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6341 transitions. Word has length 136 [2023-12-21 23:40:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:29,348 INFO L495 AbstractCegarLoop]: Abstraction has 4875 states and 6341 transitions. [2023-12-21 23:40:29,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6341 transitions. [2023-12-21 23:40:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 23:40:29,349 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:29,349 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:40:29,354 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-21 23:40:29,552 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-21 23:40:29,553 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:29,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash 407212077, now seen corresponding path program 2 times [2023-12-21 23:40:29,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503720674] [2023-12-21 23:40:29,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:40:29,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-21 23:40:29,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:29,554 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-21 23:40:29,555 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-21 23:40:29,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:40:29,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:40:29,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:40:29,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2023-12-21 23:40:30,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:40:30,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503720674] [2023-12-21 23:40:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503720674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:40:30,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:40:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:40:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223194255] [2023-12-21 23:40:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:40:30,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:40:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:30,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:40:30,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:40:30,020 INFO L87 Difference]: Start difference. First operand 4875 states and 6341 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-21 23:40:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:30,182 INFO L93 Difference]: Finished difference Result 5524 states and 7170 transitions. [2023-12-21 23:40:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:40:30,183 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 136 [2023-12-21 23:40:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:30,190 INFO L225 Difference]: With dead ends: 5524 [2023-12-21 23:40:30,190 INFO L226 Difference]: Without dead ends: 5145 [2023-12-21 23:40:30,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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-21 23:40:30,191 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 2974 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2974 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:30,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2974 Valid, 3116 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:40:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2023-12-21 23:40:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5067. [2023-12-21 23:40:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5067 states, 5065 states have (on average 1.2937808489634748) internal successors, (6553), 5066 states have internal predecessors, (6553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 6553 transitions. [2023-12-21 23:40:30,334 INFO L78 Accepts]: Start accepts. Automaton has 5067 states and 6553 transitions. Word has length 136 [2023-12-21 23:40:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:30,334 INFO L495 AbstractCegarLoop]: Abstraction has 5067 states and 6553 transitions. [2023-12-21 23:40:30,334 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-21 23:40:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 6553 transitions. [2023-12-21 23:40:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 23:40:30,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:30,336 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:40:30,341 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-21 23:40:30,539 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-21 23:40:30,539 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:30,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2101873143, now seen corresponding path program 2 times [2023-12-21 23:40:30,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:30,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396271413] [2023-12-21 23:40:30,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:40:30,540 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-21 23:40:30,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:30,541 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-21 23:40:30,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-21 23:40:30,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:40:30,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:40:30,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:40:30,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2023-12-21 23:40:30,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:40:30,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:30,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396271413] [2023-12-21 23:40:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396271413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:40:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:40:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:40:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448076646] [2023-12-21 23:40:30,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:40:30,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:40:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:40:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:40:30,991 INFO L87 Difference]: Start difference. First operand 5067 states and 6553 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:31,164 INFO L93 Difference]: Finished difference Result 5663 states and 7313 transitions. [2023-12-21 23:40:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:40:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 136 [2023-12-21 23:40:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:31,177 INFO L225 Difference]: With dead ends: 5663 [2023-12-21 23:40:31,177 INFO L226 Difference]: Without dead ends: 5349 [2023-12-21 23:40:31,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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-21 23:40:31,178 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 1525 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 3144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:31,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 3144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:40:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2023-12-21 23:40:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 5271. [2023-12-21 23:40:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 5269 states have (on average 1.2881002087682671) internal successors, (6787), 5270 states have internal predecessors, (6787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 6787 transitions. [2023-12-21 23:40:31,316 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 6787 transitions. Word has length 136 [2023-12-21 23:40:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:31,316 INFO L495 AbstractCegarLoop]: Abstraction has 5271 states and 6787 transitions. [2023-12-21 23:40:31,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:40:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 6787 transitions. [2023-12-21 23:40:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 23:40:31,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:31,318 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:40:31,323 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-21 23:40:31,521 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-21 23:40:31,521 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:31,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1022663278, now seen corresponding path program 1 times [2023-12-21 23:40:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:31,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970792215] [2023-12-21 23:40:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:40:31,522 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-21 23:40:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:31,523 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-21 23:40:31,526 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-21 23:40:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:40:31,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 23:40:31,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 54 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:40:32,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:40:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 54 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:40:33,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:33,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970792215] [2023-12-21 23:40:33,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970792215] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:40:33,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:40:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:40:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103864774] [2023-12-21 23:40:33,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:40:33,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:40:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:40:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:40:33,953 INFO L87 Difference]: Start difference. First operand 5271 states and 6787 transitions. Second operand has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 34 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:41:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:03,561 INFO L93 Difference]: Finished difference Result 15854 states and 19479 transitions. [2023-12-21 23:41:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2023-12-21 23:41:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 34 states have internal predecessors, (256), 0 states have call successors, (0), 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 137 [2023-12-21 23:41:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:03,572 INFO L225 Difference]: With dead ends: 15854 [2023-12-21 23:41:03,572 INFO L226 Difference]: Without dead ends: 15190 [2023-12-21 23:41:03,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33521 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=8390, Invalid=76000, Unknown=0, NotChecked=0, Total=84390 [2023-12-21 23:41:03,582 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 27567 mSDsluCounter, 17503 mSDsCounter, 0 mSdLazyCounter, 4370 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27567 SdHoareTripleChecker+Valid, 19201 SdHoareTripleChecker+Invalid, 4462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:03,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27567 Valid, 19201 Invalid, 4462 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 4370 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-21 23:41:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15190 states. [2023-12-21 23:41:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15190 to 14290. [2023-12-21 23:41:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14290 states, 14288 states have (on average 1.22753359462486) internal successors, (17539), 14289 states have internal predecessors, (17539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:41:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14290 states to 14290 states and 17539 transitions. [2023-12-21 23:41:04,206 INFO L78 Accepts]: Start accepts. Automaton has 14290 states and 17539 transitions. Word has length 137 [2023-12-21 23:41:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:04,206 INFO L495 AbstractCegarLoop]: Abstraction has 14290 states and 17539 transitions. [2023-12-21 23:41:04,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.529411764705882) internal successors, (256), 34 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:41:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14290 states and 17539 transitions. [2023-12-21 23:41:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 23:41:04,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:04,211 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:04,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-21 23:41:04,415 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-21 23:41:04,415 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:04,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 550432786, now seen corresponding path program 1 times [2023-12-21 23:41:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540751390] [2023-12-21 23:41:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:04,416 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-21 23:41:04,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:04,417 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-21 23:41:04,418 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-21 23:41:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:04,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 23:41:04,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 134 proven. 52 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-21 23:41:06,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 63 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:41:09,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540751390] [2023-12-21 23:41:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540751390] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:09,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-12-21 23:41:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040962549] [2023-12-21 23:41:09,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-21 23:41:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:09,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-21 23:41:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 23:41:09,858 INFO L87 Difference]: Start difference. First operand 14290 states and 17539 transitions. Second operand has 39 states, 39 states have (on average 6.128205128205129) internal successors, (239), 39 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:41:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:53,296 INFO L93 Difference]: Finished difference Result 25175 states and 30505 transitions. [2023-12-21 23:41:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-21 23:41:53,298 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 6.128205128205129) internal successors, (239), 39 states have internal predecessors, (239), 0 states have call successors, (0), 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 137 [2023-12-21 23:41:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:53,314 INFO L225 Difference]: With dead ends: 25175 [2023-12-21 23:41:53,315 INFO L226 Difference]: Without dead ends: 19314 [2023-12-21 23:41:53,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12547 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=4990, Invalid=30166, Unknown=0, NotChecked=0, Total=35156 [2023-12-21 23:41:53,321 INFO L413 NwaCegarLoop]: 1555 mSDtfsCounter, 23830 mSDsluCounter, 16079 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23830 SdHoareTripleChecker+Valid, 17634 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:53,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23830 Valid, 17634 Invalid, 2152 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [164 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-21 23:41:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19314 states. [2023-12-21 23:41:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19314 to 16945. [2023-12-21 23:41:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16945 states, 16943 states have (on average 1.2176710145782919) internal successors, (20631), 16944 states have internal predecessors, (20631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:41:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 20631 transitions. [2023-12-21 23:41:54,152 INFO L78 Accepts]: Start accepts. Automaton has 16945 states and 20631 transitions. Word has length 137 [2023-12-21 23:41:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:54,152 INFO L495 AbstractCegarLoop]: Abstraction has 16945 states and 20631 transitions. [2023-12-21 23:41:54,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.128205128205129) internal successors, (239), 39 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:41:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 16945 states and 20631 transitions. [2023-12-21 23:41:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 23:41:54,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:54,157 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:54,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-21 23:41:54,360 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-21 23:41:54,360 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:54,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1799661513, now seen corresponding path program 1 times [2023-12-21 23:41:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603900258] [2023-12-21 23:41:54,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:54,361 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-21 23:41:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:54,362 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-21 23:41:54,363 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-21 23:41:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:54,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:41:54,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 131 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:41:56,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 131 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:41:57,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603900258] [2023-12-21 23:41:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603900258] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:57,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:57,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:41:57,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765582822] [2023-12-21 23:41:57,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:57,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:41:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:57,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:41:57,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:41:57,610 INFO L87 Difference]: Start difference. First operand 16945 states and 20631 transitions. Second operand has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 34 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:42:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:42:24,370 INFO L93 Difference]: Finished difference Result 26987 states and 32561 transitions. [2023-12-21 23:42:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:42:24,371 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 34 states have internal predecessors, (215), 0 states have call successors, (0), 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-21 23:42:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:42:24,386 INFO L225 Difference]: With dead ends: 26987 [2023-12-21 23:42:24,386 INFO L226 Difference]: Without dead ends: 19261 [2023-12-21 23:42:24,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7208 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=3210, Invalid=17382, Unknown=0, NotChecked=0, Total=20592 [2023-12-21 23:42:24,393 INFO L413 NwaCegarLoop]: 1544 mSDtfsCounter, 21645 mSDsluCounter, 16144 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21645 SdHoareTripleChecker+Valid, 17688 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-21 23:42:24,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21645 Valid, 17688 Invalid, 1900 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-21 23:42:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19261 states. [2023-12-21 23:42:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19261 to 17942. [2023-12-21 23:42:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17942 states, 17940 states have (on average 1.2130992196209587) internal successors, (21763), 17941 states have internal predecessors, (21763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:42:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 21763 transitions. [2023-12-21 23:42:25,281 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 21763 transitions. Word has length 138 [2023-12-21 23:42:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:42:25,281 INFO L495 AbstractCegarLoop]: Abstraction has 17942 states and 21763 transitions. [2023-12-21 23:42:25,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 34 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:42:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 21763 transitions. [2023-12-21 23:42:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 23:42:25,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:42:25,285 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:42:25,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-12-21 23:42:25,485 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-21 23:42:25,486 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:42:25,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:42:25,486 INFO L85 PathProgramCache]: Analyzing trace with hash -257748441, now seen corresponding path program 1 times [2023-12-21 23:42:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:42:25,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665274147] [2023-12-21 23:42:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:42:25,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-21 23:42:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:42:25,487 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-21 23:42:25,491 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-21 23:42:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:42:25,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:42:25,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:42:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 133 proven. 61 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:42:27,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:42:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 133 proven. 61 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:42:28,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:42:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665274147] [2023-12-21 23:42:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665274147] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:42:28,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:42:28,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:42:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474864799] [2023-12-21 23:42:28,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:42:28,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:42:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:42:28,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:42:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:42:28,588 INFO L87 Difference]: Start difference. First operand 17942 states and 21763 transitions. Second operand has 34 states, 34 states have (on average 6.0588235294117645) internal successors, (206), 34 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:42:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:42:58,709 INFO L93 Difference]: Finished difference Result 33591 states and 40405 transitions. [2023-12-21 23:42:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-12-21 23:42:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.0588235294117645) internal successors, (206), 34 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2023-12-21 23:42:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:42:58,737 INFO L225 Difference]: With dead ends: 33591 [2023-12-21 23:42:58,737 INFO L226 Difference]: Without dead ends: 26424 [2023-12-21 23:42:58,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10750 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=4570, Invalid=24842, Unknown=0, NotChecked=0, Total=29412 [2023-12-21 23:42:58,744 INFO L413 NwaCegarLoop]: 1586 mSDtfsCounter, 25008 mSDsluCounter, 15324 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25008 SdHoareTripleChecker+Valid, 16910 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:42:58,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25008 Valid, 16910 Invalid, 1976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-21 23:42:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26424 states. [2023-12-21 23:42:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26424 to 19621. [2023-12-21 23:42:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19621 states, 19619 states have (on average 1.2121922626025792) internal successors, (23782), 19620 states have internal predecessors, (23782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:42:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19621 states to 19621 states and 23782 transitions. [2023-12-21 23:42:59,775 INFO L78 Accepts]: Start accepts. Automaton has 19621 states and 23782 transitions. Word has length 138 [2023-12-21 23:42:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:42:59,776 INFO L495 AbstractCegarLoop]: Abstraction has 19621 states and 23782 transitions. [2023-12-21 23:42:59,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.0588235294117645) internal successors, (206), 34 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:42:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 19621 states and 23782 transitions. [2023-12-21 23:42:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-21 23:42:59,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:42:59,778 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:42:59,782 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-21 23:42:59,982 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-21 23:42:59,982 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:42:59,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:42:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash -194330830, now seen corresponding path program 1 times [2023-12-21 23:42:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:42:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258817159] [2023-12-21 23:42:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:42:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:42:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:42:59,984 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-21 23:42:59,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-21 23:43:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:43:00,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 23:43:00,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:43:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 136 proven. 52 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-21 23:43:02,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:43:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 132 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:43:04,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:43:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258817159] [2023-12-21 23:43:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258817159] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:43:04,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:43:04,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2023-12-21 23:43:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697438677] [2023-12-21 23:43:04,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:43:04,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 23:43:04,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:43:04,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 23:43:04,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 23:43:04,233 INFO L87 Difference]: Start difference. First operand 19621 states and 23782 transitions. Second operand has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 36 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:43:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:43:28,349 INFO L93 Difference]: Finished difference Result 39167 states and 47162 transitions. [2023-12-21 23:43:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:43:28,352 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 36 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2023-12-21 23:43:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:43:28,380 INFO L225 Difference]: With dead ends: 39167 [2023-12-21 23:43:28,380 INFO L226 Difference]: Without dead ends: 25433 [2023-12-21 23:43:28,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7111 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=4005, Invalid=16875, Unknown=0, NotChecked=0, Total=20880 [2023-12-21 23:43:28,391 INFO L413 NwaCegarLoop]: 1551 mSDtfsCounter, 15426 mSDsluCounter, 16203 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15426 SdHoareTripleChecker+Valid, 17754 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-21 23:43:28,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15426 Valid, 17754 Invalid, 2461 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-21 23:43:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25433 states. [2023-12-21 23:43:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25433 to 23058. [2023-12-21 23:43:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23058 states, 23056 states have (on average 1.2103573907009022) internal successors, (27906), 23057 states have internal predecessors, (27906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:43:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23058 states to 23058 states and 27906 transitions. [2023-12-21 23:43:29,791 INFO L78 Accepts]: Start accepts. Automaton has 23058 states and 27906 transitions. Word has length 139 [2023-12-21 23:43:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:43:29,791 INFO L495 AbstractCegarLoop]: Abstraction has 23058 states and 27906 transitions. [2023-12-21 23:43:29,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.777777777777778) internal successors, (208), 36 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:43:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 23058 states and 27906 transitions. [2023-12-21 23:43:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-21 23:43:29,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:43:29,794 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-12-21 23:43:29,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-21 23:43:29,995 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-21 23:43:29,995 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:43:29,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:43:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1992865647, now seen corresponding path program 1 times [2023-12-21 23:43:29,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:43:29,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577671827] [2023-12-21 23:43:29,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:43:29,996 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-21 23:43:29,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:43:29,997 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-21 23:43:30,001 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-21 23:43:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:43:30,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:43:30,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:43:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:43:30,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:43:30,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:43:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577671827] [2023-12-21 23:43:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577671827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:43:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:43:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:43:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154765761] [2023-12-21 23:43:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:43:30,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:43:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:43:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:43:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:43:30,165 INFO L87 Difference]: Start difference. First operand 23058 states and 27906 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:44:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:44:04,406 INFO L93 Difference]: Finished difference Result 29070 states and 36150 transitions. [2023-12-21 23:44:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:44:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2023-12-21 23:44:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:44:04,431 INFO L225 Difference]: With dead ends: 29070 [2023-12-21 23:44:04,431 INFO L226 Difference]: Without dead ends: 26064 [2023-12-21 23:44:04,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 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-21 23:44:04,437 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 980 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2023-12-21 23:44:04,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 415 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 32.9s Time] [2023-12-21 23:44:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26064 states. [2023-12-21 23:44:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26064 to 26062. [2023-12-21 23:44:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26062 states, 26060 states have (on average 1.2061780506523407) internal successors, (31433), 26061 states have internal predecessors, (31433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:44:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26062 states to 26062 states and 31433 transitions. [2023-12-21 23:44:05,795 INFO L78 Accepts]: Start accepts. Automaton has 26062 states and 31433 transitions. Word has length 139 [2023-12-21 23:44:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:44:05,795 INFO L495 AbstractCegarLoop]: Abstraction has 26062 states and 31433 transitions. [2023-12-21 23:44:05,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:44:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 26062 states and 31433 transitions. [2023-12-21 23:44:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 23:44:05,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:44:05,798 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:44:05,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-21 23:44:06,000 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-21 23:44:06,000 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:44:06,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:44:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1380241961, now seen corresponding path program 1 times [2023-12-21 23:44:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:44:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776259001] [2023-12-21 23:44:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:44:06,001 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-21 23:44:06,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:44:06,002 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-21 23:44:06,003 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-21 23:44:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:44:06,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 23:44:06,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:44:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 15 proven. 191 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:44:06,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:44:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 15 proven. 191 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:44:06,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:44:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776259001] [2023-12-21 23:44:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776259001] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:44:06,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:44:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-21 23:44:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013330487] [2023-12-21 23:44:06,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:44:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 23:44:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:44:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 23:44:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 23:44:06,596 INFO L87 Difference]: Start difference. First operand 26062 states and 31433 transitions. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:44:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:44:09,783 INFO L93 Difference]: Finished difference Result 92095 states and 113366 transitions. [2023-12-21 23:44:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 23:44:09,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2023-12-21 23:44:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:44:09,851 INFO L225 Difference]: With dead ends: 92095 [2023-12-21 23:44:09,852 INFO L226 Difference]: Without dead ends: 72488 [2023-12-21 23:44:09,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-21 23:44:09,865 INFO L413 NwaCegarLoop]: 1563 mSDtfsCounter, 3200 mSDsluCounter, 4827 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3200 SdHoareTripleChecker+Valid, 6390 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:44:09,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3200 Valid, 6390 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:44:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72488 states. [2023-12-21 23:44:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72488 to 72480. [2023-12-21 23:44:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72480 states, 72478 states have (on average 1.1548469880515466) internal successors, (83701), 72479 states have internal predecessors, (83701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:44:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72480 states to 72480 states and 83701 transitions. [2023-12-21 23:44:13,807 INFO L78 Accepts]: Start accepts. Automaton has 72480 states and 83701 transitions. Word has length 140 [2023-12-21 23:44:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:44:13,808 INFO L495 AbstractCegarLoop]: Abstraction has 72480 states and 83701 transitions. [2023-12-21 23:44:13,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 23:44:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 72480 states and 83701 transitions. [2023-12-21 23:44:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-21 23:44:13,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:44:13,811 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:44:13,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-21 23:44:14,011 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-21 23:44:14,011 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:44:14,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:44:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash -416660785, now seen corresponding path program 1 times [2023-12-21 23:44:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:44:14,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409097260] [2023-12-21 23:44:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:44:14,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 23:44:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:44:14,013 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-21 23:44:14,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-21 23:44:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:44:14,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 23:44:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:44:14,223 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 23:44:14,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 23:44:14,224 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 23:44:14,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 23:44:14,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 (34)] Forceful destruction successful, exit code 0 [2023-12-21 23:44:14,432 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-21 23:44:14,435 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] [2023-12-21 23:44:14,437 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 23:44:14,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:44:14 BoogieIcfgContainer [2023-12-21 23:44:14,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 23:44:14,531 INFO L158 Benchmark]: Toolchain (without parser) took 362560.75ms. Allocated memory was 317.7MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 247.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-21 23:44:14,532 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 216.0MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 23:44:14,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1377.84ms. Allocated memory is still 317.7MB. Free memory was 247.8MB in the beginning and 246.0MB in the end (delta: 1.8MB). Peak memory consumption was 144.5MB. Max. memory is 8.0GB. [2023-12-21 23:44:14,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 182.27ms. Allocated memory was 317.7MB in the beginning and 440.4MB in the end (delta: 122.7MB). Free memory was 246.0MB in the beginning and 361.5MB in the end (delta: -115.6MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2023-12-21 23:44:14,533 INFO L158 Benchmark]: Boogie Preprocessor took 222.17ms. Allocated memory is still 440.4MB. Free memory was 361.5MB in the beginning and 323.3MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-21 23:44:14,534 INFO L158 Benchmark]: RCFGBuilder took 24409.83ms. Allocated memory was 440.4MB in the beginning and 744.5MB in the end (delta: 304.1MB). Free memory was 322.7MB in the beginning and 538.6MB in the end (delta: -215.9MB). Peak memory consumption was 184.2MB. Max. memory is 8.0GB. [2023-12-21 23:44:14,534 INFO L158 Benchmark]: TraceAbstraction took 336362.27ms. Allocated memory was 744.5MB in the beginning and 2.5GB in the end (delta: 1.8GB). Free memory was 538.1MB in the beginning and 1.3GB in the end (delta: -774.5MB). Peak memory consumption was 981.9MB. Max. memory is 8.0GB. [2023-12-21 23:44:14,534 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.42ms. Allocated memory is still 216.0MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1377.84ms. Allocated memory is still 317.7MB. Free memory was 247.8MB in the beginning and 246.0MB in the end (delta: 1.8MB). Peak memory consumption was 144.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 182.27ms. Allocated memory was 317.7MB in the beginning and 440.4MB in the end (delta: 122.7MB). Free memory was 246.0MB in the beginning and 361.5MB in the end (delta: -115.6MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 222.17ms. Allocated memory is still 440.4MB. Free memory was 361.5MB in the beginning and 323.3MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * RCFGBuilder took 24409.83ms. Allocated memory was 440.4MB in the beginning and 744.5MB in the end (delta: 304.1MB). Free memory was 322.7MB in the beginning and 538.6MB in the end (delta: -215.9MB). Peak memory consumption was 184.2MB. Max. memory is 8.0GB. * TraceAbstraction took 336362.27ms. Allocated memory was 744.5MB in the beginning and 2.5GB in the end (delta: 1.8GB). Free memory was 538.1MB in the beginning and 1.3GB in the end (delta: -774.5MB). Peak memory consumption was 981.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: 297]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] msg_t nomsg = (msg_t )-1; [L39] unsigned char r1 ; [L40] port_t p1 ; [L41] char p1_old ; [L42] char p1_new ; [L43] char id1 ; [L44] char st1 ; [L45] msg_t send1 ; [L46] _Bool mode1 ; [L47] port_t p2 ; [L48] char p2_old ; [L49] char p2_new ; [L50] char id2 ; [L51] char st2 ; [L52] msg_t send2 ; [L53] _Bool mode2 ; [L54] port_t p3 ; [L55] char p3_old ; [L56] char p3_new ; [L57] char id3 ; [L58] char st3 ; [L59] msg_t send3 ; [L60] _Bool mode3 ; [L313] int inputC = 3; [L314] int inputF = 6; [L315] int inputA = 1; [L316] int inputB = 2; [L317] int inputD = 4; [L318] int inputE = 5; [L321] int a17 = -124; [L322] int a5 = 4; [L323] int a24 = 15; [L324] int a2 = 170; [L325] int a7 = 13; [L5133] COND TRUE __VERIFIER_nondet_int() [L5134] CALL main1() [L245] int c1 ; [L246] int i2 ; [L249] c1 = 0 [L250] r1 = __VERIFIER_nondet_uchar() [L251] id1 = __VERIFIER_nondet_char() [L252] st1 = __VERIFIER_nondet_char() [L253] send1 = __VERIFIER_nondet_char() [L254] mode1 = __VERIFIER_nondet_bool() [L255] id2 = __VERIFIER_nondet_char() [L256] st2 = __VERIFIER_nondet_char() [L257] send2 = __VERIFIER_nondet_char() [L258] mode2 = __VERIFIER_nondet_bool() [L259] id3 = __VERIFIER_nondet_char() [L260] st3 = __VERIFIER_nondet_char() [L261] send3 = __VERIFIER_nondet_char() [L262] mode3 = __VERIFIER_nondet_bool() [L263] CALL, EXPR init() [L144] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L147] COND TRUE (int )r1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L148] COND TRUE (int )id1 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L149] COND TRUE (int )st1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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] [L150] COND TRUE (int )send1 == (int )id1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L151] COND TRUE (int )mode1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L152] COND TRUE (int )id2 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L153] COND TRUE (int )st2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0, st2=0] [L154] COND TRUE (int )send2 == (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L155] COND TRUE (int )mode2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L156] COND TRUE (int )id3 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L157] COND TRUE (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0, st3=0] [L158] COND TRUE (int )send3 == (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L159] COND TRUE (int )mode3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L160] COND TRUE (int )id1 != (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L161] COND TRUE (int )id1 != (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L162] COND TRUE (int )id2 != (int )id3 [L163] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L212] return (tmp); [L263] RET, EXPR init() [L263] i2 = init() [L264] CALL assume_abort_if_not(i2) [L32] COND FALSE !(!cond) VAL [\old(cond)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, cond=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L264] RET assume_abort_if_not(i2) [L265] p1_old = nomsg [L266] p1_new = nomsg [L267] p2_old = nomsg [L268] p2_new = nomsg [L269] p3_old = nomsg [L270] p3_new = nomsg [L271] i2 = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L272] COND TRUE 1 [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L272] COND TRUE 1 [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L78] COND FALSE !((int )m1 == (int )id1) [L81] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L102] COND TRUE (int )m2 > (int )id2 [L103] send2 = m2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, mode1=0, mode2=0, mode3=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=0, st1=0, st2=0, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, mode1=0, mode2=0, mode3=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=0, st1=0, st2=0, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, mode1=0, mode2=0, mode3=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=32, st1=0, st2=0, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L272] COND TRUE 1 [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, 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=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=32, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L272] COND TRUE 1 [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L78] COND FALSE !((int )m1 == (int )id1) [L81] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L102] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L105] COND FALSE !((int )m2 == (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=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=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=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=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L272] COND TRUE 1 [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, 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=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L67] COND FALSE !(\read(mode1)) [L86] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L87] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L98] COND FALSE !(\read(mode2)) [L111] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L112] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L123] COND FALSE !(\read(mode3)) [L136] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L137] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L220] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L221] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L224] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L226] COND TRUE (int )r1 < 3 [L227] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L240] return (tmp); [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L284] RET assert(c1) [L272] COND TRUE 1 [L274] CALL node1() [L63] msg_t m1 ; [L66] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L67] COND TRUE \read(mode1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L68] COND FALSE !(r1 == 255) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L71] r1 = r1 + 1 [L72] m1 = p3_old [L73] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L74] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L75] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L78] COND TRUE (int )m1 == (int )id1 [L79] st1 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L84] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L274] RET node1() [L275] CALL node2() [L94] msg_t m2 ; [L97] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L98] COND TRUE \read(mode2) [L99] m2 = p1_old [L100] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L101] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L102] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L105] COND TRUE (int )m2 == (int )id2 [L106] st2 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L109] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L275] RET node2() [L276] CALL node3() [L119] msg_t m3 ; [L122] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L123] COND TRUE \read(mode3) [L124] m3 = p2_old [L125] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L126] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L127] COND TRUE (int )m3 > (int )id3 [L128] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=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=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L134] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, 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=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L276] RET node3() [L277] p1_old = p1_new [L278] p1_new = nomsg [L279] p2_old = p2_new [L280] p2_new = nomsg [L281] p3_old = p3_new [L282] p3_new = nomsg [L283] CALL, EXPR check() [L217] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L220] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L238] tmp = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0, tmp=0] [L240] return (tmp); [L283] RET, EXPR check() [L283] c1 = check() [L284] CALL assert(c1) [L295] COND TRUE ! arg VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L297] reach_error() VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, 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=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] - UnprovableResult [Line: 501]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 809 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 336.2s, OverallIterations: 33, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 283.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195498 SdHoareTripleChecker+Valid, 135.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195498 mSDsluCounter, 264050 SdHoareTripleChecker+Invalid, 114.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217853 mSDsCounter, 2184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27531 IncrementalHoareTripleChecker+Invalid, 29715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2184 mSolverCounterUnsat, 46197 mSDtfsCounter, 27531 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5128 GetRequests, 3807 SyntacticMatches, 1 SemanticMatches, 1320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74951 ImplicationChecksByTransitivity, 146.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72480occurred in iteration=32, InterpolantAutomatonStates: 1094, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 16021 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2545 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4170 ConstructedInterpolants, 855 QuantifiedInterpolants, 49525 SizeOfPredicates, 134 NumberOfNonLiveVariables, 5562 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 2497/4439 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-21 23:44:14,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...