/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:39:13,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:39:13,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 07:39:13,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:39:13,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:39:13,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:39:13,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:39:13,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:39:13,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:39:13,757 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:39:13,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:39:13,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:39:13,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:39:13,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:39:13,759 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:39:13,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:39:13,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:39:13,759 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:39:13,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:39:13,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:39:13,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:39:13,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:39:13,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:39:13,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:39:13,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:39:13,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:39:13,768 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:39:13,768 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:39:13,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:39:13,768 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:39:13,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:39:13,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:39:13,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:39:13,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:39:13,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:39:13,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:39:13,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:39:13,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:39:13,770 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:39:13,770 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:39:13,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:39:13,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:39:13,770 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:39:13,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:39:13,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:39:13,771 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:39:13,771 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 07:39:13,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:39:13,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:39:13,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:39:13,949 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:39:13,949 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:39:13,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2023-12-25 07:39:15,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:39:15,200 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:39:15,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2023-12-25 07:39:15,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928ca0042/d9f0b5905c5f4566a45d8a5e5362dede/FLAG8379afd65 [2023-12-25 07:39:15,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928ca0042/d9f0b5905c5f4566a45d8a5e5362dede [2023-12-25 07:39:15,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:39:15,218 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:39:15,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:39:15,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:39:15,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:39:15,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75343afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15, skipping insertion in model container [2023-12-25 07:39:15,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,246 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:39:15,418 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c[5947,5960] [2023-12-25 07:39:15,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:39:15,429 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:39:15,452 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c[5947,5960] [2023-12-25 07:39:15,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:39:15,462 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:39:15,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15 WrapperNode [2023-12-25 07:39:15,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:39:15,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:39:15,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:39:15,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:39:15,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,492 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2023-12-25 07:39:15,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:39:15,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:39:15,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:39:15,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:39:15,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,515 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 07:39:15,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:39:15,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:39:15,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:39:15,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:39:15,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:39:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:39:15,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 07:39:15,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 07:39:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:39:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:39:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:39:15,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:39:15,674 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:39:15,675 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:39:15,938 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:39:15,981 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:39:15,981 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:39:15,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:39:15 BoogieIcfgContainer [2023-12-25 07:39:15,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:39:15,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:39:15,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:39:15,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:39:15,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:39:15" (1/3) ... [2023-12-25 07:39:15,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17deb483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:39:15, skipping insertion in model container [2023-12-25 07:39:15,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (2/3) ... [2023-12-25 07:39:15,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17deb483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:39:15, skipping insertion in model container [2023-12-25 07:39:15,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:39:15" (3/3) ... [2023-12-25 07:39:15,989 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2023-12-25 07:39:16,001 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:39:16,001 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:39:16,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:39:16,037 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;@245b9696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:39:16,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:39:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:16,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 07:39:16,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:16,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:16,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:16,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash -417268953, now seen corresponding path program 1 times [2023-12-25 07:39:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635619951] [2023-12-25 07:39:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:16,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:16,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:16,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:16,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 07:39:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:16,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 07:39:16,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:16,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:16,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635619951] [2023-12-25 07:39:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635619951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:39:16,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822756887] [2023-12-25 07:39:16,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:16,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 07:39:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 07:39:16,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:39:16,164 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 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.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:16,198 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2023-12-25 07:39:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 07:39:16,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-12-25 07:39:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:16,207 INFO L225 Difference]: With dead ends: 83 [2023-12-25 07:39:16,208 INFO L226 Difference]: Without dead ends: 49 [2023-12-25 07:39:16,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-25 07:39:16,212 INFO L413 NwaCegarLoop]: 80 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, 80 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-25 07:39:16,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-25 07:39:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-25 07:39:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2023-12-25 07:39:16,237 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 16 [2023-12-25 07:39:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:16,237 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2023-12-25 07:39:16,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2023-12-25 07:39:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 07:39:16,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:16,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:16,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:16,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:16,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:16,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:16,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1004074967, now seen corresponding path program 1 times [2023-12-25 07:39:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:16,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708903123] [2023-12-25 07:39:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:16,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:16,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:16,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:16,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 07:39:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:16,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:16,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:16,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:16,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708903123] [2023-12-25 07:39:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708903123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:39:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366198856] [2023-12-25 07:39:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:16,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:39:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:39:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:39:16,520 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:16,564 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2023-12-25 07:39:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:39:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-12-25 07:39:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:16,566 INFO L225 Difference]: With dead ends: 110 [2023-12-25 07:39:16,566 INFO L226 Difference]: Without dead ends: 78 [2023-12-25 07:39:16,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:39:16,567 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:16,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-25 07:39:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2023-12-25 07:39:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-12-25 07:39:16,571 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2023-12-25 07:39:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:16,571 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-12-25 07:39:16,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-12-25 07:39:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 07:39:16,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:16,572 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] [2023-12-25 07:39:16,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:16,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:16,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:16,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash 871528204, now seen corresponding path program 1 times [2023-12-25 07:39:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:16,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321935755] [2023-12-25 07:39:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:16,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:16,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:16,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 07:39:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:16,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:16,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:16,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:16,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321935755] [2023-12-25 07:39:16,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321935755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:16,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748320946] [2023-12-25 07:39:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:16,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:16,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:16,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:16,967 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:17,041 INFO L93 Difference]: Finished difference Result 165 states and 250 transitions. [2023-12-25 07:39:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:17,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-12-25 07:39:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:17,044 INFO L225 Difference]: With dead ends: 165 [2023-12-25 07:39:17,044 INFO L226 Difference]: Without dead ends: 136 [2023-12-25 07:39:17,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:17,045 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:17,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 253 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:39:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-25 07:39:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2023-12-25 07:39:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.5) internal successors, (153), 102 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2023-12-25 07:39:17,054 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 153 transitions. Word has length 31 [2023-12-25 07:39:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:17,054 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 153 transitions. [2023-12-25 07:39:17,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 153 transitions. [2023-12-25 07:39:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:39:17,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:17,055 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] [2023-12-25 07:39:17,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:17,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:17,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:17,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash -739726020, now seen corresponding path program 1 times [2023-12-25 07:39:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:17,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991910934] [2023-12-25 07:39:17,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:17,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:17,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:17,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:17,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 07:39:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:17,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:17,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:17,375 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:17,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991910934] [2023-12-25 07:39:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991910934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811397265] [2023-12-25 07:39:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:17,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:17,376 INFO L87 Difference]: Start difference. First operand 103 states and 153 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:17,392 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2023-12-25 07:39:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-12-25 07:39:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:17,393 INFO L225 Difference]: With dead ends: 253 [2023-12-25 07:39:17,393 INFO L226 Difference]: Without dead ends: 170 [2023-12-25 07:39:17,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:17,394 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:17,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-25 07:39:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2023-12-25 07:39:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5089820359281436) internal successors, (252), 167 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2023-12-25 07:39:17,404 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 33 [2023-12-25 07:39:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:17,404 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2023-12-25 07:39:17,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2023-12-25 07:39:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 07:39:17,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:17,405 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-25 07:39:17,409 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 (5)] Ended with exit code 0 [2023-12-25 07:39:17,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:17,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:17,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1404220512, now seen corresponding path program 1 times [2023-12-25 07:39:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935931599] [2023-12-25 07:39:17,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:17,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:17,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:17,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:17,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 07:39:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:17,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:39:17,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:17,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:17,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:17,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935931599] [2023-12-25 07:39:17,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935931599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:17,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:39:17,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056856371] [2023-12-25 07:39:17,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:17,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:39:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:17,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:39:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:39:17,716 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-25 07:39:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:17,734 INFO L93 Difference]: Finished difference Result 182 states and 269 transitions. [2023-12-25 07:39:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:39:17,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-25 07:39:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:17,735 INFO L225 Difference]: With dead ends: 182 [2023-12-25 07:39:17,735 INFO L226 Difference]: Without dead ends: 180 [2023-12-25 07:39:17,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:39:17,736 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:17,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-25 07:39:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2023-12-25 07:39:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.48) internal successors, (259), 175 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 259 transitions. [2023-12-25 07:39:17,742 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 259 transitions. Word has length 34 [2023-12-25 07:39:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:17,743 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 259 transitions. [2023-12-25 07:39:17,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-25 07:39:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 259 transitions. [2023-12-25 07:39:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:39:17,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:17,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:17,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:17,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:17,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:17,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1768252524, now seen corresponding path program 1 times [2023-12-25 07:39:17,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:17,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265056655] [2023-12-25 07:39:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:17,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:17,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:17,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 07:39:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:17,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:17,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:18,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:18,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265056655] [2023-12-25 07:39:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265056655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218009439] [2023-12-25 07:39:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:18,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,023 INFO L87 Difference]: Start difference. First operand 176 states and 259 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:18,034 INFO L93 Difference]: Finished difference Result 344 states and 519 transitions. [2023-12-25 07:39:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-25 07:39:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:18,035 INFO L225 Difference]: With dead ends: 344 [2023-12-25 07:39:18,036 INFO L226 Difference]: Without dead ends: 255 [2023-12-25 07:39:18,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,036 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:18,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-12-25 07:39:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2023-12-25 07:39:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4880952380952381) internal successors, (375), 252 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 375 transitions. [2023-12-25 07:39:18,043 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 375 transitions. Word has length 35 [2023-12-25 07:39:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:18,044 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 375 transitions. [2023-12-25 07:39:18,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 375 transitions. [2023-12-25 07:39:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:39:18,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:18,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:18,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:18,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:18,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:18,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1901058708, now seen corresponding path program 1 times [2023-12-25 07:39:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255269267] [2023-12-25 07:39:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:18,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-25 07:39:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:18,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:18,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 07:39:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:18,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:18,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:18,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:18,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255269267] [2023-12-25 07:39:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255269267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:18,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:18,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112591947] [2023-12-25 07:39:18,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:18,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:18,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:18,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,308 INFO L87 Difference]: Start difference. First operand 253 states and 375 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:18,321 INFO L93 Difference]: Finished difference Result 679 states and 1018 transitions. [2023-12-25 07:39:18,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-25 07:39:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:18,323 INFO L225 Difference]: With dead ends: 679 [2023-12-25 07:39:18,323 INFO L226 Difference]: Without dead ends: 448 [2023-12-25 07:39:18,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,324 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:18,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-12-25 07:39:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2023-12-25 07:39:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4719101123595506) internal successors, (655), 445 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 655 transitions. [2023-12-25 07:39:18,332 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 655 transitions. Word has length 35 [2023-12-25 07:39:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:18,333 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 655 transitions. [2023-12-25 07:39:18,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 655 transitions. [2023-12-25 07:39:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:39:18,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:18,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:18,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:18,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:18,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:18,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1505175148, now seen corresponding path program 1 times [2023-12-25 07:39:18,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:18,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656390318] [2023-12-25 07:39:18,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:18,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:18,538 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:18,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 07:39:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:18,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:18,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:18,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:18,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:18,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656390318] [2023-12-25 07:39:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656390318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:18,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236508679] [2023-12-25 07:39:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:18,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,590 INFO L87 Difference]: Start difference. First operand 446 states and 655 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:18,607 INFO L93 Difference]: Finished difference Result 1222 states and 1795 transitions. [2023-12-25 07:39:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:18,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-25 07:39:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:18,610 INFO L225 Difference]: With dead ends: 1222 [2023-12-25 07:39:18,610 INFO L226 Difference]: Without dead ends: 798 [2023-12-25 07:39:18,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,611 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:18,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2023-12-25 07:39:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2023-12-25 07:39:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 1.4377358490566037) internal successors, (1143), 795 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1143 transitions. [2023-12-25 07:39:18,626 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1143 transitions. Word has length 35 [2023-12-25 07:39:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:18,626 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1143 transitions. [2023-12-25 07:39:18,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1143 transitions. [2023-12-25 07:39:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 07:39:18,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:18,627 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] [2023-12-25 07:39:18,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:18,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:18,830 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:18,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -217205247, now seen corresponding path program 1 times [2023-12-25 07:39:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:18,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561842539] [2023-12-25 07:39:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:18,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:18,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:18,833 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 07:39:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:18,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:39:18,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:19,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:19,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561842539] [2023-12-25 07:39:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561842539] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:19,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:19,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:39:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551597697] [2023-12-25 07:39:19,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:19,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:39:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:19,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:39:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:39:19,595 INFO L87 Difference]: Start difference. First operand 796 states and 1143 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:20,559 INFO L93 Difference]: Finished difference Result 2514 states and 3588 transitions. [2023-12-25 07:39:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 07:39:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-25 07:39:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:20,570 INFO L225 Difference]: With dead ends: 2514 [2023-12-25 07:39:20,570 INFO L226 Difference]: Without dead ends: 1960 [2023-12-25 07:39:20,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-25 07:39:20,573 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 668 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:20,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 542 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:39:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2023-12-25 07:39:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1568. [2023-12-25 07:39:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.4365028717294193) internal successors, (2251), 1567 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2251 transitions. [2023-12-25 07:39:20,620 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2251 transitions. Word has length 49 [2023-12-25 07:39:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:20,620 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2251 transitions. [2023-12-25 07:39:20,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2251 transitions. [2023-12-25 07:39:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 07:39:20,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:20,622 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] [2023-12-25 07:39:20,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:20,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:20,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:20,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash -842861311, now seen corresponding path program 1 times [2023-12-25 07:39:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461281066] [2023-12-25 07:39:20,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:20,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:20,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:20,827 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:20,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 07:39:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:20,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:20,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:20,900 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:20,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461281066] [2023-12-25 07:39:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461281066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:20,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:20,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598139402] [2023-12-25 07:39:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:20,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:20,902 INFO L87 Difference]: Start difference. First operand 1568 states and 2251 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:20,946 INFO L93 Difference]: Finished difference Result 2690 states and 3888 transitions. [2023-12-25 07:39:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-25 07:39:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:20,950 INFO L225 Difference]: With dead ends: 2690 [2023-12-25 07:39:20,950 INFO L226 Difference]: Without dead ends: 1144 [2023-12-25 07:39:20,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:20,952 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:20,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2023-12-25 07:39:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1137. [2023-12-25 07:39:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.4330985915492958) internal successors, (1628), 1136 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1628 transitions. [2023-12-25 07:39:20,991 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1628 transitions. Word has length 49 [2023-12-25 07:39:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:20,991 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1628 transitions. [2023-12-25 07:39:20,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1628 transitions. [2023-12-25 07:39:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 07:39:20,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:20,996 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] [2023-12-25 07:39:21,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:21,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:21,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:21,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1927076031, now seen corresponding path program 1 times [2023-12-25 07:39:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:21,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25920734] [2023-12-25 07:39:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:21,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:21,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:21,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 07:39:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:21,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:21,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:21,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:21,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25920734] [2023-12-25 07:39:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25920734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:21,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:21,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876455352] [2023-12-25 07:39:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:21,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:21,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:21,270 INFO L87 Difference]: Start difference. First operand 1137 states and 1628 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:21,304 INFO L93 Difference]: Finished difference Result 1693 states and 2428 transitions. [2023-12-25 07:39:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:21,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-25 07:39:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:21,312 INFO L225 Difference]: With dead ends: 1693 [2023-12-25 07:39:21,312 INFO L226 Difference]: Without dead ends: 587 [2023-12-25 07:39:21,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:21,314 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:21,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-12-25 07:39:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2023-12-25 07:39:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4006849315068493) internal successors, (818), 584 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 818 transitions. [2023-12-25 07:39:21,328 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 818 transitions. Word has length 51 [2023-12-25 07:39:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:21,328 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 818 transitions. [2023-12-25 07:39:21,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 818 transitions. [2023-12-25 07:39:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:39:21,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:21,329 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] [2023-12-25 07:39:21,334 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 (12)] Ended with exit code 0 [2023-12-25 07:39:21,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:21,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:21,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash 174207316, now seen corresponding path program 1 times [2023-12-25 07:39:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688377810] [2023-12-25 07:39:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:21,540 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:21,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 07:39:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:21,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:39:21,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:22,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:22,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688377810] [2023-12-25 07:39:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688377810] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:22,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:22,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:39:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639986747] [2023-12-25 07:39:22,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:22,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:39:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:22,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:39:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:39:22,258 INFO L87 Difference]: Start difference. First operand 585 states and 818 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:23,043 INFO L93 Difference]: Finished difference Result 2117 states and 2958 transitions. [2023-12-25 07:39:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 07:39:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-25 07:39:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:23,048 INFO L225 Difference]: With dead ends: 2117 [2023-12-25 07:39:23,048 INFO L226 Difference]: Without dead ends: 1563 [2023-12-25 07:39:23,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2023-12-25 07:39:23,050 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 466 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:23,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 513 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:39:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2023-12-25 07:39:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1209. [2023-12-25 07:39:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.3774834437086092) internal successors, (1664), 1208 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1664 transitions. [2023-12-25 07:39:23,110 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1664 transitions. Word has length 52 [2023-12-25 07:39:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:23,110 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1664 transitions. [2023-12-25 07:39:23,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1664 transitions. [2023-12-25 07:39:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 07:39:23,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:23,111 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] [2023-12-25 07:39:23,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:23,314 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:23,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1009209312, now seen corresponding path program 1 times [2023-12-25 07:39:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:23,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492517706] [2023-12-25 07:39:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:23,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:23,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:23,316 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:23,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 07:39:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:23,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:23,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:23,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:23,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:23,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492517706] [2023-12-25 07:39:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492517706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:23,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:23,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378499330] [2023-12-25 07:39:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:23,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:23,389 INFO L87 Difference]: Start difference. First operand 1209 states and 1664 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:23,411 INFO L93 Difference]: Finished difference Result 1749 states and 2405 transitions. [2023-12-25 07:39:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:23,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-25 07:39:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:23,414 INFO L225 Difference]: With dead ends: 1749 [2023-12-25 07:39:23,414 INFO L226 Difference]: Without dead ends: 571 [2023-12-25 07:39:23,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:23,416 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:23,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2023-12-25 07:39:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2023-12-25 07:39:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.3380281690140845) internal successors, (760), 568 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 760 transitions. [2023-12-25 07:39:23,434 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 760 transitions. Word has length 54 [2023-12-25 07:39:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:23,434 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 760 transitions. [2023-12-25 07:39:23,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 760 transitions. [2023-12-25 07:39:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 07:39:23,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:23,434 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] [2023-12-25 07:39:23,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:23,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:23,637 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:23,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash -547962027, now seen corresponding path program 1 times [2023-12-25 07:39:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:23,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053006453] [2023-12-25 07:39:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:23,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:23,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:23,639 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:23,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 07:39:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:23,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:39:23,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:24,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:24,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053006453] [2023-12-25 07:39:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053006453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:24,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:39:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918924599] [2023-12-25 07:39:24,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:24,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:39:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:39:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:39:24,365 INFO L87 Difference]: Start difference. First operand 569 states and 760 transitions. Second operand has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:25,027 INFO L93 Difference]: Finished difference Result 1607 states and 2139 transitions. [2023-12-25 07:39:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 07:39:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-25 07:39:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:25,030 INFO L225 Difference]: With dead ends: 1607 [2023-12-25 07:39:25,030 INFO L226 Difference]: Without dead ends: 1069 [2023-12-25 07:39:25,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-25 07:39:25,031 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 333 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:25,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 470 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:39:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2023-12-25 07:39:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 951. [2023-12-25 07:39:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 950 states have (on average 1.3147368421052632) internal successors, (1249), 950 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1249 transitions. [2023-12-25 07:39:25,058 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1249 transitions. Word has length 55 [2023-12-25 07:39:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:25,058 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1249 transitions. [2023-12-25 07:39:25,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1249 transitions. [2023-12-25 07:39:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 07:39:25,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:25,059 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] [2023-12-25 07:39:25,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:25,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:25,261 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:25,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash 143425325, now seen corresponding path program 1 times [2023-12-25 07:39:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007322334] [2023-12-25 07:39:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:25,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:25,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:25,263 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:25,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 07:39:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:25,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:39:25,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:39:25,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:39:25,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007322334] [2023-12-25 07:39:25,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007322334] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:25,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:25,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 07:39:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101638210] [2023-12-25 07:39:25,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:39:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:25,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:39:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:39:25,447 INFO L87 Difference]: Start difference. First operand 951 states and 1249 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:25,527 INFO L93 Difference]: Finished difference Result 2771 states and 3587 transitions. [2023-12-25 07:39:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-25 07:39:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:25,531 INFO L225 Difference]: With dead ends: 2771 [2023-12-25 07:39:25,531 INFO L226 Difference]: Without dead ends: 1851 [2023-12-25 07:39:25,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:39:25,532 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 48 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:25,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 205 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2023-12-25 07:39:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1755. [2023-12-25 07:39:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.2360319270239453) internal successors, (2168), 1754 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2168 transitions. [2023-12-25 07:39:25,592 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2168 transitions. Word has length 57 [2023-12-25 07:39:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:25,593 INFO L495 AbstractCegarLoop]: Abstraction has 1755 states and 2168 transitions. [2023-12-25 07:39:25,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2168 transitions. [2023-12-25 07:39:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-25 07:39:25,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:25,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:25,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-25 07:39:25,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:25,798 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:25,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -187964122, now seen corresponding path program 1 times [2023-12-25 07:39:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:25,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405127176] [2023-12-25 07:39:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:25,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:25,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:25,800 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:25,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 07:39:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:25,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:39:25,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:26,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:27,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405127176] [2023-12-25 07:39:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405127176] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:27,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:27,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 07:39:27,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334480570] [2023-12-25 07:39:27,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:27,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:27,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:27,028 INFO L87 Difference]: Start difference. First operand 1755 states and 2168 transitions. Second operand has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:27,969 INFO L93 Difference]: Finished difference Result 2875 states and 3588 transitions. [2023-12-25 07:39:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 07:39:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 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 90 [2023-12-25 07:39:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:27,975 INFO L225 Difference]: With dead ends: 2875 [2023-12-25 07:39:27,975 INFO L226 Difference]: Without dead ends: 1789 [2023-12-25 07:39:27,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2023-12-25 07:39:27,977 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 510 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:27,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 408 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:39:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2023-12-25 07:39:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1755. [2023-12-25 07:39:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.217787913340935) internal successors, (2136), 1754 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2136 transitions. [2023-12-25 07:39:28,073 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2136 transitions. Word has length 90 [2023-12-25 07:39:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:28,073 INFO L495 AbstractCegarLoop]: Abstraction has 1755 states and 2136 transitions. [2023-12-25 07:39:28,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2136 transitions. [2023-12-25 07:39:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-25 07:39:28,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:28,075 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] [2023-12-25 07:39:28,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:28,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:28,278 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:28,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1686625031, now seen corresponding path program 1 times [2023-12-25 07:39:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164843684] [2023-12-25 07:39:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:28,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:28,280 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:28,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 07:39:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:28,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:39:28,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:29,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:29,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164843684] [2023-12-25 07:39:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164843684] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:29,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:39:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772870216] [2023-12-25 07:39:29,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:29,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:29,632 INFO L87 Difference]: Start difference. First operand 1755 states and 2136 transitions. Second operand has 26 states, 26 states have (on average 6.423076923076923) internal successors, (167), 26 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:33,773 INFO L93 Difference]: Finished difference Result 2958 states and 3598 transitions. [2023-12-25 07:39:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-25 07:39:33,774 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.423076923076923) internal successors, (167), 26 states have internal predecessors, (167), 0 states have call successors, (0), 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 91 [2023-12-25 07:39:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:33,779 INFO L225 Difference]: With dead ends: 2958 [2023-12-25 07:39:33,779 INFO L226 Difference]: Without dead ends: 2608 [2023-12-25 07:39:33,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1011, Invalid=4995, Unknown=0, NotChecked=0, Total=6006 [2023-12-25 07:39:33,782 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 759 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:33,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1838 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:39:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2023-12-25 07:39:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 1207. [2023-12-25 07:39:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.2230514096185738) internal successors, (1475), 1206 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1475 transitions. [2023-12-25 07:39:33,836 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1475 transitions. Word has length 91 [2023-12-25 07:39:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:33,836 INFO L495 AbstractCegarLoop]: Abstraction has 1207 states and 1475 transitions. [2023-12-25 07:39:33,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.423076923076923) internal successors, (167), 26 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1475 transitions. [2023-12-25 07:39:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-25 07:39:33,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:33,837 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] [2023-12-25 07:39:33,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:34,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:34,040 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:34,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash 362660805, now seen corresponding path program 1 times [2023-12-25 07:39:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119043760] [2023-12-25 07:39:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:34,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:34,042 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:34,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 07:39:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:34,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:39:34,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:34,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:35,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:35,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119043760] [2023-12-25 07:39:35,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119043760] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:35,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:35,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 07:39:35,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45084632] [2023-12-25 07:39:35,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:35,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:35,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:35,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:35,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:35,023 INFO L87 Difference]: Start difference. First operand 1207 states and 1475 transitions. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 25 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:36,081 INFO L93 Difference]: Finished difference Result 1815 states and 2238 transitions. [2023-12-25 07:39:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 07:39:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 25 states have internal predecessors, (170), 0 states have call successors, (0), 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 91 [2023-12-25 07:39:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:36,085 INFO L225 Difference]: With dead ends: 1815 [2023-12-25 07:39:36,085 INFO L226 Difference]: Without dead ends: 1293 [2023-12-25 07:39:36,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 07:39:36,086 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 622 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:36,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 511 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:39:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2023-12-25 07:39:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1207. [2023-12-25 07:39:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.214759535655058) internal successors, (1465), 1206 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1465 transitions. [2023-12-25 07:39:36,137 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1465 transitions. Word has length 91 [2023-12-25 07:39:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:36,137 INFO L495 AbstractCegarLoop]: Abstraction has 1207 states and 1465 transitions. [2023-12-25 07:39:36,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 25 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1465 transitions. [2023-12-25 07:39:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 07:39:36,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:36,138 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] [2023-12-25 07:39:36,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:36,341 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:36,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1672655722, now seen corresponding path program 1 times [2023-12-25 07:39:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:36,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800444304] [2023-12-25 07:39:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:36,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:36,343 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:36,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 07:39:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:36,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:39:36,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:37,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:37,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800444304] [2023-12-25 07:39:37,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800444304] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:37,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:37,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:39:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340776717] [2023-12-25 07:39:37,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:37,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:37,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:37,715 INFO L87 Difference]: Start difference. First operand 1207 states and 1465 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-25 07:39:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:40,995 INFO L93 Difference]: Finished difference Result 2289 states and 2783 transitions. [2023-12-25 07:39:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-25 07:39:40,996 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 92 [2023-12-25 07:39:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:40,999 INFO L225 Difference]: With dead ends: 2289 [2023-12-25 07:39:40,999 INFO L226 Difference]: Without dead ends: 1587 [2023-12-25 07:39:41,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=760, Invalid=3796, Unknown=0, NotChecked=0, Total=4556 [2023-12-25 07:39:41,001 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 565 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:41,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1650 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-25 07:39:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2023-12-25 07:39:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1350. [2023-12-25 07:39:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.2053372868791699) internal successors, (1626), 1349 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1626 transitions. [2023-12-25 07:39:41,063 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1626 transitions. Word has length 92 [2023-12-25 07:39:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:41,064 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1626 transitions. [2023-12-25 07:39:41,064 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-25 07:39:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1626 transitions. [2023-12-25 07:39:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-25 07:39:41,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:41,064 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] [2023-12-25 07:39:41,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:41,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:41,267 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:41,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1317950150, now seen corresponding path program 1 times [2023-12-25 07:39:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:41,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424469602] [2023-12-25 07:39:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:41,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:41,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:41,269 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:41,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 07:39:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:41,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:39:41,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:42,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:42,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424469602] [2023-12-25 07:39:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424469602] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:42,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:39:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307387183] [2023-12-25 07:39:42,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:42,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:42,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:42,547 INFO L87 Difference]: Start difference. First operand 1350 states and 1626 transitions. Second operand has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:46,593 INFO L93 Difference]: Finished difference Result 3557 states and 4262 transitions. [2023-12-25 07:39:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-25 07:39:46,593 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 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 92 [2023-12-25 07:39:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:46,607 INFO L225 Difference]: With dead ends: 3557 [2023-12-25 07:39:46,607 INFO L226 Difference]: Without dead ends: 3204 [2023-12-25 07:39:46,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=881, Invalid=4089, Unknown=0, NotChecked=0, Total=4970 [2023-12-25 07:39:46,610 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 579 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:46,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 2053 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 07:39:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2023-12-25 07:39:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2578. [2023-12-25 07:39:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2577 states have (on average 1.194024058983314) internal successors, (3077), 2577 states have internal predecessors, (3077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3077 transitions. [2023-12-25 07:39:46,774 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3077 transitions. Word has length 92 [2023-12-25 07:39:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:46,774 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 3077 transitions. [2023-12-25 07:39:46,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.653846153846154) internal successors, (173), 26 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3077 transitions. [2023-12-25 07:39:46,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 07:39:46,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:46,777 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:46,780 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-25 07:39:46,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:46,980 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:46,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1282993781, now seen corresponding path program 1 times [2023-12-25 07:39:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:46,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147504892] [2023-12-25 07:39:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:46,981 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:46,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-25 07:39:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:47,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:47,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-12-25 07:39:47,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:47,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147504892] [2023-12-25 07:39:47,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147504892] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:47,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:47,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:47,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305872545] [2023-12-25 07:39:47,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:47,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:47,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:47,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:47,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:47,381 INFO L87 Difference]: Start difference. First operand 2578 states and 3077 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:47,533 INFO L93 Difference]: Finished difference Result 3467 states and 4192 transitions. [2023-12-25 07:39:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:47,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2023-12-25 07:39:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:47,540 INFO L225 Difference]: With dead ends: 3467 [2023-12-25 07:39:47,540 INFO L226 Difference]: Without dead ends: 3126 [2023-12-25 07:39:47,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:47,541 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 78 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:47,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 231 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2023-12-25 07:39:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3058. [2023-12-25 07:39:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 1.1884200196270853) internal successors, (3633), 3057 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 3633 transitions. [2023-12-25 07:39:47,708 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 3633 transitions. Word has length 129 [2023-12-25 07:39:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:47,708 INFO L495 AbstractCegarLoop]: Abstraction has 3058 states and 3633 transitions. [2023-12-25 07:39:47,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 3633 transitions. [2023-12-25 07:39:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 07:39:47,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:47,711 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:47,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:47,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:47,913 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:47,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash -857593867, now seen corresponding path program 2 times [2023-12-25 07:39:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:47,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865841148] [2023-12-25 07:39:47,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:39:47,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:47,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:47,915 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:47,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 07:39:47,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 07:39:47,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:39:47,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:47,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-25 07:39:48,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:48,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865841148] [2023-12-25 07:39:48,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865841148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:48,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:48,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:48,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050769941] [2023-12-25 07:39:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:48,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:48,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:48,218 INFO L87 Difference]: Start difference. First operand 3058 states and 3633 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:48,407 INFO L93 Difference]: Finished difference Result 3690 states and 4451 transitions. [2023-12-25 07:39:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:48,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 129 [2023-12-25 07:39:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:48,418 INFO L225 Difference]: With dead ends: 3690 [2023-12-25 07:39:48,419 INFO L226 Difference]: Without dead ends: 2882 [2023-12-25 07:39:48,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:48,420 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 96 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:48,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 218 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2023-12-25 07:39:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2746. [2023-12-25 07:39:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 1.174863387978142) internal successors, (3225), 2745 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 3225 transitions. [2023-12-25 07:39:48,559 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 3225 transitions. Word has length 129 [2023-12-25 07:39:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:48,559 INFO L495 AbstractCegarLoop]: Abstraction has 2746 states and 3225 transitions. [2023-12-25 07:39:48,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 3225 transitions. [2023-12-25 07:39:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 07:39:48,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:48,562 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:48,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:48,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:48,764 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:48,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -502888295, now seen corresponding path program 2 times [2023-12-25 07:39:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259967993] [2023-12-25 07:39:48,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:39:48,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-25 07:39:48,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:48,769 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:48,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 07:39:48,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 07:39:48,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:39:48,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:48,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-12-25 07:39:49,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:49,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259967993] [2023-12-25 07:39:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259967993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:49,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239770820] [2023-12-25 07:39:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:49,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:49,106 INFO L87 Difference]: Start difference. First operand 2746 states and 3225 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:49,271 INFO L93 Difference]: Finished difference Result 3315 states and 3961 transitions. [2023-12-25 07:39:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:49,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2023-12-25 07:39:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:49,275 INFO L225 Difference]: With dead ends: 3315 [2023-12-25 07:39:49,275 INFO L226 Difference]: Without dead ends: 2986 [2023-12-25 07:39:49,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:49,276 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 93 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:49,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 215 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2023-12-25 07:39:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2918. [2023-12-25 07:39:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2917 states have (on average 1.1710661638669866) internal successors, (3416), 2917 states have internal predecessors, (3416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 3416 transitions. [2023-12-25 07:39:49,396 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 3416 transitions. Word has length 129 [2023-12-25 07:39:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:49,396 INFO L495 AbstractCegarLoop]: Abstraction has 2918 states and 3416 transitions. [2023-12-25 07:39:49,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:39:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 3416 transitions. [2023-12-25 07:39:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-25 07:39:49,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:49,398 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:49,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:49,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:49,600 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:49,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1778535200, now seen corresponding path program 1 times [2023-12-25 07:39:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593615789] [2023-12-25 07:39:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:49,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:39:49,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:49,602 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:39:49,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-25 07:39:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:49,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 07:39:49,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 130 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-25 07:39:51,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 61 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:52,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593615789] [2023-12-25 07:39:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593615789] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:52,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-12-25 07:39:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304328139] [2023-12-25 07:39:52,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:52,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 07:39:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:52,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 07:39:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 07:39:52,890 INFO L87 Difference]: Start difference. First operand 2918 states and 3416 transitions. Second operand has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:41:02,469 INFO L93 Difference]: Finished difference Result 10633 states and 12500 transitions. [2023-12-25 07:41:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2023-12-25 07:41:02,470 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2023-12-25 07:41:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:41:02,479 INFO L225 Difference]: With dead ends: 10633 [2023-12-25 07:41:02,479 INFO L226 Difference]: Without dead ends: 8575 [2023-12-25 07:41:02,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47713 ImplicationChecksByTransitivity, 63.4s TimeCoverageRelationStatistics Valid=12446, Invalid=100114, Unknown=0, NotChecked=0, Total=112560 [2023-12-25 07:41:02,490 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 3201 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3201 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 3865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:41:02,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3201 Valid, 3258 Invalid, 3865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-25 07:41:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8575 states. [2023-12-25 07:41:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8575 to 6763. [2023-12-25 07:41:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.1807157645666961) internal successors, (7984), 6762 states have internal predecessors, (7984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 7984 transitions. [2023-12-25 07:41:02,838 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 7984 transitions. Word has length 130 [2023-12-25 07:41:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:41:02,838 INFO L495 AbstractCegarLoop]: Abstraction has 6763 states and 7984 transitions. [2023-12-25 07:41:02,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.769230769230769) internal successors, (225), 39 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 7984 transitions. [2023-12-25 07:41:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 07:41:02,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:41:02,842 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:41:02,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 07:41:03,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:41:03,045 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:41:03,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:41:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1253905319, now seen corresponding path program 1 times [2023-12-25 07:41:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:41:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504907299] [2023-12-25 07:41:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:41:03,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:41:03,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:41:03,047 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:41:03,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-25 07:41:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:41:03,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:41:03,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:41:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:41:04,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:41:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:41:05,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:41:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504907299] [2023-12-25 07:41:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504907299] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:41:05,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:41:05,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:41:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497596176] [2023-12-25 07:41:05,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:41:05,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:41:05,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:41:05,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:41:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:41:05,618 INFO L87 Difference]: Start difference. First operand 6763 states and 7984 transitions. Second operand has 34 states, 34 states have (on average 5.970588235294118) internal successors, (203), 34 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:41:43,578 INFO L93 Difference]: Finished difference Result 13069 states and 15402 transitions. [2023-12-25 07:41:43,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2023-12-25 07:41:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.970588235294118) internal successors, (203), 34 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2023-12-25 07:41:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:41:43,591 INFO L225 Difference]: With dead ends: 13069 [2023-12-25 07:41:43,592 INFO L226 Difference]: Without dead ends: 10507 [2023-12-25 07:41:43,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14392 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=5718, Invalid=30954, Unknown=0, NotChecked=0, Total=36672 [2023-12-25 07:41:43,596 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 2111 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:41:43,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 2719 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-25 07:41:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2023-12-25 07:41:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 8679. [2023-12-25 07:41:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8679 states, 8678 states have (on average 1.1774602442959208) internal successors, (10218), 8678 states have internal predecessors, (10218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 10218 transitions. [2023-12-25 07:41:44,133 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 10218 transitions. Word has length 131 [2023-12-25 07:41:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:41:44,133 INFO L495 AbstractCegarLoop]: Abstraction has 8679 states and 10218 transitions. [2023-12-25 07:41:44,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.970588235294118) internal successors, (203), 34 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:41:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 10218 transitions. [2023-12-25 07:41:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-25 07:41:44,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:41:44,136 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:41:44,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-25 07:41:44,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:41:44,337 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:41:44,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:41:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash -261386733, now seen corresponding path program 1 times [2023-12-25 07:41:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:41:44,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694750676] [2023-12-25 07:41:44,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:41:44,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:41:44,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:41:44,338 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:41:44,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 07:41:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:41:44,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:41:44,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:41:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:41:45,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:41:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:41:46,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:41:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694750676] [2023-12-25 07:41:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694750676] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:41:46,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:41:46,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:41:46,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886790244] [2023-12-25 07:41:46,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:41:46,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:41:46,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:41:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:41:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:41:46,633 INFO L87 Difference]: Start difference. First operand 8679 states and 10218 transitions. Second operand has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:42:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:26,834 INFO L93 Difference]: Finished difference Result 13683 states and 16141 transitions. [2023-12-25 07:42:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2023-12-25 07:42:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2023-12-25 07:42:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:26,844 INFO L225 Difference]: With dead ends: 13683 [2023-12-25 07:42:26,844 INFO L226 Difference]: Without dead ends: 11612 [2023-12-25 07:42:26,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19268 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=7133, Invalid=41929, Unknown=0, NotChecked=0, Total=49062 [2023-12-25 07:42:26,849 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 2469 mSDsluCounter, 2358 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2469 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:26,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2469 Valid, 2510 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-25 07:42:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11612 states. [2023-12-25 07:42:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11612 to 9734. [2023-12-25 07:42:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9734 states, 9733 states have (on average 1.1784650159252028) internal successors, (11470), 9733 states have internal predecessors, (11470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:42:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9734 states to 9734 states and 11470 transitions. [2023-12-25 07:42:27,417 INFO L78 Accepts]: Start accepts. Automaton has 9734 states and 11470 transitions. Word has length 131 [2023-12-25 07:42:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:27,417 INFO L495 AbstractCegarLoop]: Abstraction has 9734 states and 11470 transitions. [2023-12-25 07:42:27,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:42:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9734 states and 11470 transitions. [2023-12-25 07:42:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 07:42:27,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:27,421 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:27,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-25 07:42:27,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:42:27,623 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:27,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1761007469, now seen corresponding path program 1 times [2023-12-25 07:42:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:27,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484656646] [2023-12-25 07:42:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:27,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:42:27,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:27,626 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:42:27,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 07:42:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:27,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:42:27,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 15 proven. 185 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:42:27,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 15 proven. 185 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:42:28,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484656646] [2023-12-25 07:42:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484656646] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:28,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:28,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 07:42:28,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319044932] [2023-12-25 07:42:28,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:28,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 07:42:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 07:42:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 07:42:28,007 INFO L87 Difference]: Start difference. First operand 9734 states and 11470 transitions. Second operand has 10 states, 10 states have (on average 21.5) internal successors, (215), 10 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-25 07:42:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:29,908 INFO L93 Difference]: Finished difference Result 43928 states and 52754 transitions. [2023-12-25 07:42:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:42:29,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.5) internal successors, (215), 10 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 133 [2023-12-25 07:42:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:29,939 INFO L225 Difference]: With dead ends: 43928 [2023-12-25 07:42:29,939 INFO L226 Difference]: Without dead ends: 34802 [2023-12-25 07:42:29,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:42:29,948 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 260 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:29,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 659 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:42:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34802 states. [2023-12-25 07:42:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34802 to 34285. [2023-12-25 07:42:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34285 states, 34284 states have (on average 1.135777622214444) internal successors, (38939), 34284 states have internal predecessors, (38939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:42:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34285 states to 34285 states and 38939 transitions. [2023-12-25 07:42:32,100 INFO L78 Accepts]: Start accepts. Automaton has 34285 states and 38939 transitions. Word has length 133 [2023-12-25 07:42:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:32,101 INFO L495 AbstractCegarLoop]: Abstraction has 34285 states and 38939 transitions. [2023-12-25 07:42:32,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.5) internal successors, (215), 10 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-25 07:42:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 34285 states and 38939 transitions. [2023-12-25 07:42:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 07:42:32,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:32,104 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:32,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-25 07:42:32,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:42:32,307 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:32,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1157130781, now seen corresponding path program 1 times [2023-12-25 07:42:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833838854] [2023-12-25 07:42:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:32,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:42:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:32,309 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:42:32,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-25 07:42:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:32,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:42:32,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 64 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:33,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 64 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:34,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833838854] [2023-12-25 07:42:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833838854] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:34,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:42:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955678722] [2023-12-25 07:42:34,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:42:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:42:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:42:34,126 INFO L87 Difference]: Start difference. First operand 34285 states and 38939 transitions. Second operand has 34 states, 34 states have (on average 7.264705882352941) internal successors, (247), 34 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:42:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:45,770 INFO L93 Difference]: Finished difference Result 43162 states and 49051 transitions. [2023-12-25 07:42:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-12-25 07:42:45,771 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.264705882352941) internal successors, (247), 34 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2023-12-25 07:42:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:45,793 INFO L225 Difference]: With dead ends: 43162 [2023-12-25 07:42:45,794 INFO L226 Difference]: Without dead ends: 27126 [2023-12-25 07:42:45,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7493 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3215, Invalid=20655, Unknown=0, NotChecked=0, Total=23870 [2023-12-25 07:42:45,805 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 1273 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:45,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1984 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-25 07:42:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27126 states. [2023-12-25 07:42:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27126 to 24162. [2023-12-25 07:42:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24162 states, 24161 states have (on average 1.1268573320640702) internal successors, (27226), 24161 states have internal predecessors, (27226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:42:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24162 states to 24162 states and 27226 transitions. [2023-12-25 07:42:47,252 INFO L78 Accepts]: Start accepts. Automaton has 24162 states and 27226 transitions. Word has length 133 [2023-12-25 07:42:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:47,252 INFO L495 AbstractCegarLoop]: Abstraction has 24162 states and 27226 transitions. [2023-12-25 07:42:47,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.264705882352941) internal successors, (247), 34 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:42:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 24162 states and 27226 transitions. [2023-12-25 07:42:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 07:42:47,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:47,255 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:47,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-25 07:42:47,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:42:47,457 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:47,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1615736426, now seen corresponding path program 1 times [2023-12-25 07:42:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251086220] [2023-12-25 07:42:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:47,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:42:47,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:47,459 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:42:47,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 07:42:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:47,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:42:47,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:48,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:49,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251086220] [2023-12-25 07:42:49,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251086220] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:49,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:42:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234031672] [2023-12-25 07:42:49,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:42:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:42:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:42:49,201 INFO L87 Difference]: Start difference. First operand 24162 states and 27226 transitions. Second operand has 34 states, 34 states have (on average 7.617647058823529) internal successors, (259), 34 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:43:00,558 INFO L93 Difference]: Finished difference Result 33928 states and 38444 transitions. [2023-12-25 07:43:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2023-12-25 07:43:00,559 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.617647058823529) internal successors, (259), 34 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2023-12-25 07:43:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:43:00,577 INFO L225 Difference]: With dead ends: 33928 [2023-12-25 07:43:00,578 INFO L226 Difference]: Without dead ends: 20800 [2023-12-25 07:43:00,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8148 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3451, Invalid=21989, Unknown=0, NotChecked=0, Total=25440 [2023-12-25 07:43:00,585 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1557 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:43:00,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1848 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 07:43:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20800 states. [2023-12-25 07:43:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20800 to 15963. [2023-12-25 07:43:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15963 states, 15962 states have (on average 1.1115774965543166) internal successors, (17743), 15962 states have internal predecessors, (17743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15963 states to 15963 states and 17743 transitions. [2023-12-25 07:43:01,654 INFO L78 Accepts]: Start accepts. Automaton has 15963 states and 17743 transitions. Word has length 134 [2023-12-25 07:43:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:43:01,654 INFO L495 AbstractCegarLoop]: Abstraction has 15963 states and 17743 transitions. [2023-12-25 07:43:01,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.617647058823529) internal successors, (259), 34 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 15963 states and 17743 transitions. [2023-12-25 07:43:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 07:43:01,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:43:01,656 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:43:01,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-25 07:43:01,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:43:01,859 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:43:01,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:43:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1667466298, now seen corresponding path program 1 times [2023-12-25 07:43:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:43:01,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024886192] [2023-12-25 07:43:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:43:01,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:43:01,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:43:01,860 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:43:01,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-25 07:43:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:43:01,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:43:01,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:43:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 48 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:43:02,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:43:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 48 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:43:03,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:43:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024886192] [2023-12-25 07:43:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024886192] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:43:03,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:43:03,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:43:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838634727] [2023-12-25 07:43:03,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:43:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:43:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:43:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:43:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:43:03,437 INFO L87 Difference]: Start difference. First operand 15963 states and 17743 transitions. Second operand has 34 states, 34 states have (on average 7.470588235294118) internal successors, (254), 34 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:43:06,857 INFO L93 Difference]: Finished difference Result 18714 states and 20826 transitions. [2023-12-25 07:43:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-25 07:43:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.470588235294118) internal successors, (254), 34 states have internal predecessors, (254), 0 states have call successors, (0), 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 134 [2023-12-25 07:43:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:43:06,867 INFO L225 Difference]: With dead ends: 18714 [2023-12-25 07:43:06,867 INFO L226 Difference]: Without dead ends: 12006 [2023-12-25 07:43:06,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=854, Invalid=4696, Unknown=0, NotChecked=0, Total=5550 [2023-12-25 07:43:06,873 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 537 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:43:06,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2013 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 07:43:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12006 states. [2023-12-25 07:43:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12006 to 7054. [2023-12-25 07:43:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7053 states have (on average 1.0826598610520346) internal successors, (7636), 7053 states have internal predecessors, (7636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 7636 transitions. [2023-12-25 07:43:07,477 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 7636 transitions. Word has length 134 [2023-12-25 07:43:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:43:07,477 INFO L495 AbstractCegarLoop]: Abstraction has 7054 states and 7636 transitions. [2023-12-25 07:43:07,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.470588235294118) internal successors, (254), 34 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 7636 transitions. [2023-12-25 07:43:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 07:43:07,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:43:07,479 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:43:07,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-25 07:43:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:43:07,682 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:43:07,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:43:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -119990771, now seen corresponding path program 1 times [2023-12-25 07:43:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:43:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389534879] [2023-12-25 07:43:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:43:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:43:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:43:07,684 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:43:07,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-25 07:43:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:43:07,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 07:43:07,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:43:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 134 proven. 69 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 07:43:09,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:43:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 32 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:43:11,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:43:11,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389534879] [2023-12-25 07:43:11,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389534879] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:43:11,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:43:11,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2023-12-25 07:43:11,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828123770] [2023-12-25 07:43:11,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:43:11,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-25 07:43:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:43:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-25 07:43:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 07:43:11,336 INFO L87 Difference]: Start difference. First operand 7054 states and 7636 transitions. Second operand has 44 states, 44 states have (on average 5.590909090909091) internal successors, (246), 44 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:43:53,417 INFO L93 Difference]: Finished difference Result 14004 states and 15062 transitions. [2023-12-25 07:43:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2023-12-25 07:43:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.590909090909091) internal successors, (246), 44 states have internal predecessors, (246), 0 states have call successors, (0), 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 135 [2023-12-25 07:43:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:43:53,426 INFO L225 Difference]: With dead ends: 14004 [2023-12-25 07:43:53,427 INFO L226 Difference]: Without dead ends: 10571 [2023-12-25 07:43:53,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24489 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=7617, Invalid=58689, Unknown=0, NotChecked=0, Total=66306 [2023-12-25 07:43:53,431 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 2613 mSDsluCounter, 3752 mSDsCounter, 0 mSdLazyCounter, 4481 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 4654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 4481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:43:53,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 3931 Invalid, 4654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 4481 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-25 07:43:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10571 states. [2023-12-25 07:43:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10571 to 5275. [2023-12-25 07:43:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5275 states, 5274 states have (on average 1.075085324232082) internal successors, (5670), 5274 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 5670 transitions. [2023-12-25 07:43:53,874 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 5670 transitions. Word has length 135 [2023-12-25 07:43:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:43:53,874 INFO L495 AbstractCegarLoop]: Abstraction has 5275 states and 5670 transitions. [2023-12-25 07:43:53,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.590909090909091) internal successors, (246), 44 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:43:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 5670 transitions. [2023-12-25 07:43:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 07:43:53,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:43:53,876 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:43:53,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-25 07:43:54,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:43:54,079 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:43:54,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:43:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -301422867, now seen corresponding path program 1 times [2023-12-25 07:43:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:43:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498034069] [2023-12-25 07:43:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:43:54,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:43:54,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:43:54,081 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:43:54,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-25 07:43:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:43:54,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 07:43:54,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:43:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 134 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 07:43:57,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:43:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 134 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 07:43:58,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:43:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498034069] [2023-12-25 07:43:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498034069] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:43:58,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:43:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 41 [2023-12-25 07:43:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023969615] [2023-12-25 07:43:58,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:43:58,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 07:43:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:43:58,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 07:43:58,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 07:43:58,792 INFO L87 Difference]: Start difference. First operand 5275 states and 5670 transitions. Second operand has 41 states, 41 states have (on average 5.024390243902439) internal successors, (206), 41 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:44:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:44:51,237 INFO L93 Difference]: Finished difference Result 10049 states and 10757 transitions. [2023-12-25 07:44:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2023-12-25 07:44:51,239 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.024390243902439) internal successors, (206), 41 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 135 [2023-12-25 07:44:51,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:44:51,245 INFO L225 Difference]: With dead ends: 10049 [2023-12-25 07:44:51,246 INFO L226 Difference]: Without dead ends: 7267 [2023-12-25 07:44:51,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11097 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=4411, Invalid=28531, Unknown=0, NotChecked=0, Total=32942 [2023-12-25 07:44:51,249 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2372 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 3217 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 3217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-12-25 07:44:51,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 2364 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 3217 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-12-25 07:44:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states. [2023-12-25 07:44:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 5634. [2023-12-25 07:44:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5634 states, 5633 states have (on average 1.07686845375466) internal successors, (6066), 5633 states have internal predecessors, (6066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:44:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5634 states to 5634 states and 6066 transitions. [2023-12-25 07:44:51,794 INFO L78 Accepts]: Start accepts. Automaton has 5634 states and 6066 transitions. Word has length 135 [2023-12-25 07:44:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:44:51,794 INFO L495 AbstractCegarLoop]: Abstraction has 5634 states and 6066 transitions. [2023-12-25 07:44:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.024390243902439) internal successors, (206), 41 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:44:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5634 states and 6066 transitions. [2023-12-25 07:44:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 07:44:51,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:44:51,796 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:44:51,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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 07:44:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:44:51,999 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:44:52,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:44:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 48689453, now seen corresponding path program 1 times [2023-12-25 07:44:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:44:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662707344] [2023-12-25 07:44:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:44:52,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:44:52,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:44:52,001 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:44:52,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 (34)] Waiting until timeout for monitored process [2023-12-25 07:44:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:44:52,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 07:44:52,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:44:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 138 proven. 50 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-25 07:44:53,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:44:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 66 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:44:55,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:44:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662707344] [2023-12-25 07:44:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662707344] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:44:55,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:44:55,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2023-12-25 07:44:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951639470] [2023-12-25 07:44:55,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:44:55,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 07:44:55,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:44:55,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 07:44:55,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1607, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 07:44:55,436 INFO L87 Difference]: Start difference. First operand 5634 states and 6066 transitions. Second operand has 43 states, 43 states have (on average 5.209302325581396) internal successors, (224), 43 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:45:24,495 INFO L93 Difference]: Finished difference Result 10919 states and 11697 transitions. [2023-12-25 07:45:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2023-12-25 07:45:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.209302325581396) internal successors, (224), 43 states have internal predecessors, (224), 0 states have call successors, (0), 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 135 [2023-12-25 07:45:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:45:24,503 INFO L225 Difference]: With dead ends: 10919 [2023-12-25 07:45:24,503 INFO L226 Difference]: Without dead ends: 9788 [2023-12-25 07:45:24,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19209 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=5434, Invalid=48158, Unknown=0, NotChecked=0, Total=53592 [2023-12-25 07:45:24,506 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 2600 mSDsluCounter, 2598 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:45:24,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2600 Valid, 2731 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 07:45:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9788 states. [2023-12-25 07:45:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9788 to 7853. [2023-12-25 07:45:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7853 states, 7852 states have (on average 1.0728476821192052) internal successors, (8424), 7852 states have internal predecessors, (8424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 8424 transitions. [2023-12-25 07:45:25,241 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 8424 transitions. Word has length 135 [2023-12-25 07:45:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:45:25,241 INFO L495 AbstractCegarLoop]: Abstraction has 7853 states and 8424 transitions. [2023-12-25 07:45:25,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.209302325581396) internal successors, (224), 43 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 8424 transitions. [2023-12-25 07:45:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 07:45:25,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:45:25,242 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-25 07:45:25,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-25 07:45:25,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:45:25,445 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:45:25,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:45:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -962227763, now seen corresponding path program 1 times [2023-12-25 07:45:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:45:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394918244] [2023-12-25 07:45:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:45:25,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:45:25,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:45:25,447 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:45:25,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-25 07:45:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:45:25,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:45:25,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:45:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 147 proven. 40 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-25 07:45:26,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:45:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 142 proven. 45 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-25 07:45:26,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:45:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394918244] [2023-12-25 07:45:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394918244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:45:26,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:45:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2023-12-25 07:45:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748069227] [2023-12-25 07:45:26,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:45:26,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 07:45:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:45:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 07:45:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2023-12-25 07:45:26,543 INFO L87 Difference]: Start difference. First operand 7853 states and 8424 transitions. Second operand has 25 states, 25 states have (on average 7.52) internal successors, (188), 25 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:45:28,229 INFO L93 Difference]: Finished difference Result 11634 states and 12475 transitions. [2023-12-25 07:45:28,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 07:45:28,230 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.52) internal successors, (188), 25 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 135 [2023-12-25 07:45:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:45:28,235 INFO L225 Difference]: With dead ends: 11634 [2023-12-25 07:45:28,236 INFO L226 Difference]: Without dead ends: 6379 [2023-12-25 07:45:28,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=486, Invalid=1584, Unknown=0, NotChecked=0, Total=2070 [2023-12-25 07:45:28,239 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 549 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:45:28,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 866 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:45:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6379 states. [2023-12-25 07:45:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6379 to 5465. [2023-12-25 07:45:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5465 states, 5464 states have (on average 1.0600292825768667) internal successors, (5792), 5464 states have internal predecessors, (5792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 5792 transitions. [2023-12-25 07:45:28,835 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 5792 transitions. Word has length 135 [2023-12-25 07:45:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:45:28,835 INFO L495 AbstractCegarLoop]: Abstraction has 5465 states and 5792 transitions. [2023-12-25 07:45:28,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.52) internal successors, (188), 25 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 5792 transitions. [2023-12-25 07:45:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 07:45:28,836 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:45:28,837 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:45:28,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-12-25 07:45:29,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:45:29,040 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:45:29,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:45:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -177997827, now seen corresponding path program 1 times [2023-12-25 07:45:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:45:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131039478] [2023-12-25 07:45:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:45:29,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:45:29,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:45:29,049 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:45:29,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-25 07:45:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:45:29,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:45:29,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:45:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 138 proven. 65 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 07:45:29,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:45:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 135 proven. 68 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 07:45:30,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:45:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131039478] [2023-12-25 07:45:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131039478] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:45:30,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:45:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2023-12-25 07:45:30,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185540460] [2023-12-25 07:45:30,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:45:30,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 07:45:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:45:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 07:45:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2023-12-25 07:45:30,295 INFO L87 Difference]: Start difference. First operand 5465 states and 5792 transitions. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:45:31,959 INFO L93 Difference]: Finished difference Result 7061 states and 7458 transitions. [2023-12-25 07:45:31,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 07:45:31,960 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 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 135 [2023-12-25 07:45:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:45:31,964 INFO L225 Difference]: With dead ends: 7061 [2023-12-25 07:45:31,964 INFO L226 Difference]: Without dead ends: 4428 [2023-12-25 07:45:31,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=456, Invalid=1524, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 07:45:31,965 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 350 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:45:31,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 738 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 07:45:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2023-12-25 07:45:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 3750. [2023-12-25 07:45:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3750 states, 3749 states have (on average 1.042411309682582) internal successors, (3908), 3749 states have internal predecessors, (3908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 3908 transitions. [2023-12-25 07:45:32,340 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 3908 transitions. Word has length 135 [2023-12-25 07:45:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:45:32,340 INFO L495 AbstractCegarLoop]: Abstraction has 3750 states and 3908 transitions. [2023-12-25 07:45:32,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:45:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 3908 transitions. [2023-12-25 07:45:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-25 07:45:32,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:45:32,341 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:45:32,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-25 07:45:32,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:45:32,544 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:45:32,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:45:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1250895478, now seen corresponding path program 2 times [2023-12-25 07:45:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:45:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712906574] [2023-12-25 07:45:32,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:45:32,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:45:32,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:45:32,546 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:45:32,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-25 07:45:32,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:45:32,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:45:32,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-25 07:45:32,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:45:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 137 proven. 59 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-25 07:45:34,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:45:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 39 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:45:36,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:45:36,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712906574] [2023-12-25 07:45:36,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712906574] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:45:36,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:45:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 47 [2023-12-25 07:45:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368642480] [2023-12-25 07:45:36,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:45:36,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-25 07:45:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:45:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-25 07:45:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1903, Unknown=0, NotChecked=0, Total=2162 [2023-12-25 07:45:36,481 INFO L87 Difference]: Start difference. First operand 3750 states and 3908 transitions. Second operand has 47 states, 47 states have (on average 5.127659574468085) internal successors, (241), 47 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:46:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:46:01,059 INFO L93 Difference]: Finished difference Result 5094 states and 5272 transitions. [2023-12-25 07:46:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2023-12-25 07:46:01,060 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.127659574468085) internal successors, (241), 47 states have internal predecessors, (241), 0 states have call successors, (0), 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-25 07:46:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:46:01,063 INFO L225 Difference]: With dead ends: 5094 [2023-12-25 07:46:01,063 INFO L226 Difference]: Without dead ends: 4472 [2023-12-25 07:46:01,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14012 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=4473, Invalid=34929, Unknown=0, NotChecked=0, Total=39402 [2023-12-25 07:46:01,065 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1835 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:46:01,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 2152 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-25 07:46:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2023-12-25 07:46:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 3323. [2023-12-25 07:46:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3323 states, 3322 states have (on average 1.0376279349789284) internal successors, (3447), 3322 states have internal predecessors, (3447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:46:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 3447 transitions. [2023-12-25 07:46:01,397 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 3447 transitions. Word has length 136 [2023-12-25 07:46:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:46:01,397 INFO L495 AbstractCegarLoop]: Abstraction has 3323 states and 3447 transitions. [2023-12-25 07:46:01,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.127659574468085) internal successors, (241), 47 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:46:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 3447 transitions. [2023-12-25 07:46:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-25 07:46:01,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:46:01,398 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:46:01,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-25 07:46:01,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:46:01,602 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:46:01,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:46:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash -904468691, now seen corresponding path program 1 times [2023-12-25 07:46:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:46:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006057160] [2023-12-25 07:46:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:46:01,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:46:01,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:46:01,604 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:46:01,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 (38)] Waiting until timeout for monitored process [2023-12-25 07:46:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:46:01,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:46:01,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:46:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 40 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-25 07:46:02,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:46:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-25 07:46:02,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:46:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006057160] [2023-12-25 07:46:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006057160] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:46:02,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:46:02,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2023-12-25 07:46:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663159795] [2023-12-25 07:46:02,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:46:02,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 07:46:02,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:46:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 07:46:02,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2023-12-25 07:46:02,980 INFO L87 Difference]: Start difference. First operand 3323 states and 3447 transitions. Second operand has 25 states, 25 states have (on average 7.6) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:46:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:46:04,711 INFO L93 Difference]: Finished difference Result 3725 states and 3852 transitions. [2023-12-25 07:46:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-25 07:46:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.6) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 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-25 07:46:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:46:04,714 INFO L225 Difference]: With dead ends: 3725 [2023-12-25 07:46:04,714 INFO L226 Difference]: Without dead ends: 2837 [2023-12-25 07:46:04,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=493, Invalid=1669, Unknown=0, NotChecked=0, Total=2162 [2023-12-25 07:46:04,715 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 598 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:46:04,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 956 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 07:46:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2023-12-25 07:46:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2612. [2023-12-25 07:46:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2611 states have (on average 1.0329375718115665) internal successors, (2697), 2611 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:46:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 2697 transitions. [2023-12-25 07:46:04,973 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 2697 transitions. Word has length 137 [2023-12-25 07:46:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:46:04,973 INFO L495 AbstractCegarLoop]: Abstraction has 2612 states and 2697 transitions. [2023-12-25 07:46:04,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.6) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:46:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 2697 transitions. [2023-12-25 07:46:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-25 07:46:04,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:46:04,974 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:46:04,977 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 (38)] Ended with exit code 0 [2023-12-25 07:46:05,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:46:05,177 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:46:05,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:46:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1863489626, now seen corresponding path program 1 times [2023-12-25 07:46:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:46:05,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576857000] [2023-12-25 07:46:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:46:05,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:46:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:46:05,178 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:46:05,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-25 07:46:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:46:05,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 07:46:05,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:46:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 106 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 07:46:07,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:46:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 106 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 07:46:09,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:46:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576857000] [2023-12-25 07:46:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576857000] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:46:09,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:46:09,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2023-12-25 07:46:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611332063] [2023-12-25 07:46:09,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:46:09,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 07:46:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:46:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 07:46:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 07:46:09,533 INFO L87 Difference]: Start difference. First operand 2612 states and 2697 transitions. Second operand has 38 states, 38 states have (on average 3.526315789473684) internal successors, (134), 38 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:47:50,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-25 07:48:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:48:03,757 INFO L93 Difference]: Finished difference Result 2843 states and 2926 transitions. [2023-12-25 07:48:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-25 07:48:03,758 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.526315789473684) internal successors, (134), 38 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2023-12-25 07:48:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:48:03,760 INFO L225 Difference]: With dead ends: 2843 [2023-12-25 07:48:03,761 INFO L226 Difference]: Without dead ends: 2538 [2023-12-25 07:48:03,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 97.2s TimeCoverageRelationStatistics Valid=1423, Invalid=6058, Unknown=1, NotChecked=0, Total=7482 [2023-12-25 07:48:03,763 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1241 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:48:03,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 787 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2023-12-25 07:48:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2023-12-25 07:48:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2309. [2023-12-25 07:48:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.0320623916811091) internal successors, (2382), 2308 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:48:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2382 transitions. [2023-12-25 07:48:04,021 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2382 transitions. Word has length 140 [2023-12-25 07:48:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:48:04,022 INFO L495 AbstractCegarLoop]: Abstraction has 2309 states and 2382 transitions. [2023-12-25 07:48:04,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.526315789473684) internal successors, (134), 38 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:48:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2382 transitions. [2023-12-25 07:48:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-25 07:48:04,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:48:04,024 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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-25 07:48:04,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-12-25 07:48:04,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:48:04,227 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:48:04,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:48:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash 864274909, now seen corresponding path program 1 times [2023-12-25 07:48:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:48:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233200320] [2023-12-25 07:48:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:48:04,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:48:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:48:04,230 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:48:04,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-25 07:48:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:48:04,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:48:04,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:48:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 935 proven. 241 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2023-12-25 07:48:04,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:48:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 935 proven. 241 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2023-12-25 07:48:04,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:48:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233200320] [2023-12-25 07:48:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233200320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:48:04,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:48:04,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 07:48:04,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768543049] [2023-12-25 07:48:04,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:48:04,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:48:04,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:48:04,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:48:04,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:48:04,810 INFO L87 Difference]: Start difference. First operand 2309 states and 2382 transitions. Second operand has 16 states, 16 states have (on average 17.625) internal successors, (282), 16 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:48:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:48:04,985 INFO L93 Difference]: Finished difference Result 2309 states and 2382 transitions. [2023-12-25 07:48:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:48:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 17.625) internal successors, (282), 16 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2023-12-25 07:48:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:48:04,986 INFO L225 Difference]: With dead ends: 2309 [2023-12-25 07:48:04,986 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 07:48:04,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:48:04,988 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 74 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:48:04,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1137 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:48:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 07:48:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 07:48:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:48:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 07:48:04,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2023-12-25 07:48:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:48:04,988 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 07:48:04,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 17.625) internal successors, (282), 16 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:48:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 07:48:04,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 07:48:04,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:48:05,003 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 (40)] Forceful destruction successful, exit code 0 [2023-12-25 07:48:05,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:48:05,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 07:49:57,654 WARN L293 SmtUtils]: Spent 1.87m on a formula simplification. DAG size of input: 3608 DAG size of output: 3699 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-25 07:53:16,027 WARN L293 SmtUtils]: Spent 3.31m on a formula simplification. DAG size of input: 3699 DAG size of output: 889 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 175) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 221) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L202-1(lines 202 221) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 172) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 89) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 70) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 48 73) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 218) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 169) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 166) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 120) no Hoare annotation was computed. [2023-12-25 07:53:16,034 INFO L899 garLoopResultBuilder]: For program point L105-2(lines 99 123) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L895 garLoopResultBuilder]: At program point L254-2(lines 254 269) the Hoare annotation is: (let ((.cse57 ((_ sign_extend 24) ~send2~0)) (.cse48 ((_ sign_extend 24) ~send3~0))) (let ((.cse164 ((_ sign_extend 24) ~p3_old~0)) (.cse200 ((_ extract 7 0) .cse48)) (.cse192 ((_ extract 7 0) .cse57)) (.cse79 ((_ sign_extend 24) ~send1~0))) (let ((.cse89 ((_ extract 7 0) .cse79)) (.cse168 ((_ sign_extend 24) ~p2_old~0)) (.cse64 ((_ sign_extend 24) .cse192)) (.cse22 ((_ sign_extend 24) ~id3~0)) (.cse159 ((_ sign_extend 24) .cse200)) (.cse28 ((_ sign_extend 24) ~id1~0)) (.cse184 ((_ sign_extend 24) ((_ extract 7 0) .cse164))) (.cse14 ((_ sign_extend 24) ~id2~0)) (.cse220 ((_ sign_extend 24) ~p1_old~0))) (let ((.cse172 ((_ extract 7 0) (bvadd ((_ sign_extend 24) (_ bv1 8)) (_ bv1 32)))) (.cse174 ((_ sign_extend 24) ((_ extract 7 0) .cse220))) (.cse62 (not (bvsgt .cse184 .cse14))) (.cse55 (bvsgt .cse159 .cse28)) (.cse163 (bvsgt .cse64 .cse22)) (.cse160 (bvsgt .cse220 .cse14)) (.cse177 (bvsgt .cse168 .cse22)) (.cse21 ((_ sign_extend 24) .cse89))) (let ((.cse50 (exists ((v_subst_1692 (_ BitVec 8))) (let ((.cse219 ((_ sign_extend 24) v_subst_1692))) (and (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse219))) ~send2~0) (= .cse22 .cse219))))) (.cse54 (exists ((v_subst_1691 (_ BitVec 8))) (let ((.cse218 ((_ sign_extend 24) v_subst_1691))) (and (= .cse22 .cse218) (= ((_ extract 7 0) .cse218) ~send1~0))))) (.cse97 (exists ((v_subst_187 (_ BitVec 8)) (v_subst_186 (_ BitVec 8))) (let ((.cse216 ((_ sign_extend 24) v_subst_186)) (.cse217 ((_ sign_extend 24) v_subst_187))) (and (= .cse216 .cse217) (bvsge .cse216 (_ bv0 32)) (not (= .cse216 .cse28)) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse217))) ~p3_old~0))))) (.cse63 (= ~send1~0 .cse200)) (.cse101 (exists ((v_subst_188 (_ BitVec 8))) (let ((.cse215 ((_ sign_extend 24) v_subst_188))) (and (not (= .cse215 .cse28)) (= .cse57 .cse215))))) (.cse49 (exists ((v_subst_162 (_ BitVec 8)) (~send2~0 (_ BitVec 8))) (let ((.cse214 ((_ sign_extend 24) ~send2~0)) (.cse213 ((_ sign_extend 24) v_subst_162))) (and (bvsge .cse213 (_ bv0 32)) (= ((_ extract 7 0) .cse214) ~send3~0) (= .cse214 .cse213) (not (= .cse213 .cse28)))))) (.cse66 (exists ((v_subst_1654 (_ BitVec 8))) (let ((.cse212 ((_ sign_extend 24) v_subst_1654))) (and (= .cse22 .cse212) (= ((_ extract 7 0) .cse212) ~send1~0))))) (.cse98 (forall ((v_subst_2480 (_ BitVec 8))) (let ((.cse209 ((_ sign_extend 24) v_subst_2480))) (or (forall ((v_subst_2482 (_ BitVec 8)) (v_subst_2481 (_ BitVec 8)) (v_subst_2483 (_ BitVec 8))) (let ((.cse211 ((_ sign_extend 24) v_subst_2482)) (.cse210 ((_ sign_extend 24) v_subst_2481)) (.cse208 ((_ sign_extend 24) v_subst_2483))) (or (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse208)) .cse28) (= .cse209 .cse210) (not (= .cse209 .cse211)) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse211)) .cse210) (= .cse210 .cse28) (not (= .cse210 .cse208))))) (bvsgt .cse21 .cse209) (not (bvsge .cse209 (_ bv0 32))))))) (.cse81 (exists ((v_subst_165 (_ BitVec 8))) (let ((.cse207 ((_ sign_extend 24) v_subst_165))) (and (= .cse57 .cse207) (not (= .cse207 .cse28)))))) (.cse102 (exists ((~send3~0 (_ BitVec 8))) (let ((.cse206 ((_ sign_extend 24) ~send3~0))) (and (= .cse22 .cse206) (= ~send1~0 ((_ extract 7 0) .cse206)))))) (.cse56 (exists ((v_subst_100 (_ BitVec 8))) (let ((.cse205 ((_ sign_extend 24) v_subst_100))) (and (= .cse57 .cse205) (bvsge .cse205 (_ bv0 32)))))) (.cse108 (exists ((~send1~0 (_ BitVec 8))) (let ((.cse204 ((_ sign_extend 24) ~send1~0))) (and (= .cse28 .cse204) (= ((_ extract 7 0) .cse204) ~send2~0))))) (.cse105 (exists ((v_subst_1668 (_ BitVec 8))) (let ((.cse203 ((_ sign_extend 24) v_subst_1668))) (and (= ~p3_old~0 ((_ extract 7 0) .cse203)) (= .cse22 .cse203))))) (.cse60 (exists ((v_subst_2 (_ BitVec 8))) (let ((.cse202 ((_ sign_extend 24) v_subst_2))) (and (not (= .cse28 .cse202)) (= .cse48 .cse202))))) (.cse23 (exists ((v_subst_1551 (_ BitVec 8))) (let ((.cse201 ((_ sign_extend 24) v_subst_1551))) (and (= .cse28 .cse201) (= ((_ extract 7 0) .cse201) ~send2~0))))) (.cse26 (= (_ bv2 32) |ULTIMATE.start_main_~i2~0#1|)) (.cse32 (or .cse160 .cse177)) (.cse35 (= (_ bv5 32) |ULTIMATE.start_main_~i2~0#1|)) (.cse71 (= ~p3_old~0 .cse200)) (.cse100 (exists ((v_subst_1756 (_ BitVec 8))) (let ((.cse199 ((_ sign_extend 24) v_subst_1756))) (and (= .cse14 .cse199) (= ((_ extract 7 0) .cse199) ~p2_old~0))))) (.cse103 (= .cse192 ~send3~0)) (.cse92 (exists ((v_subst_55 (_ BitVec 8)) (v_subst_54 (_ BitVec 8))) (let ((.cse198 ((_ sign_extend 24) v_subst_55)) (.cse197 ((_ sign_extend 24) v_subst_54))) (and (not (= .cse22 .cse197)) (= ~p2_old~0 ((_ extract 7 0) .cse198)) (= .cse197 .cse198) (bvsge .cse197 (_ bv0 32)))))) (.cse104 (exists ((v_subst_185 (_ BitVec 8)) (v_subst_184 (_ BitVec 8))) (let ((.cse196 ((_ sign_extend 24) v_subst_185)) (.cse195 ((_ sign_extend 24) v_subst_184))) (and (bvsge .cse195 (_ bv0 32)) (= .cse196 .cse195) (= ((_ extract 7 0) .cse196) ~send3~0) (not (= .cse195 .cse28)))))) (.cse88 (or (bvsgt .cse21 .cse14) .cse163)) (.cse67 (exists ((v_subst_173 (_ BitVec 8)) (~send2~0 (_ BitVec 8))) (let ((.cse193 ((_ sign_extend 24) ~send2~0)) (.cse194 ((_ sign_extend 24) v_subst_173))) (and (= .cse193 .cse194) (bvsge .cse194 (_ bv0 32)) (= ~p3_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse193)))) (not (= .cse194 .cse28)))))) (.cse68 (= (_ bv3 32) |ULTIMATE.start_main_~i2~0#1|)) (.cse34 (= (_ bv1 8) ~mode3~0)) (.cse11 (= (_ bv1 8) ~r1~0)) (.cse37 (= (_ bv1 8) ~mode1~0)) (.cse16 (not .cse55)) (.cse39 (= (_ bv1 8) ~mode2~0)) (.cse73 (= .cse192 ~p2_old~0)) (.cse74 (exists ((v_subst_174 (_ BitVec 8)) (~send2~0 (_ BitVec 8))) (let ((.cse190 ((_ sign_extend 24) v_subst_174)) (.cse191 ((_ sign_extend 24) ~send2~0))) (and (not (= .cse28 .cse190)) (= .cse191 .cse190) (bvsge .cse190 (_ bv0 32)) (= ((_ extract 7 0) .cse191) ~send3~0))))) (.cse41 (exists ((v_subst_409 (_ BitVec 8)) (v_subst_408 (_ BitVec 8))) (let ((.cse189 ((_ sign_extend 24) v_subst_409)) (.cse188 ((_ sign_extend 24) v_subst_408))) (and (= .cse188 .cse189) (= ~send2~0 ((_ extract 7 0) .cse189)) (not (= .cse22 .cse188)) (bvsge .cse188 (_ bv0 32)))))) (.cse76 (exists ((v_subst_35 (_ BitVec 8))) (let ((.cse187 ((_ sign_extend 24) v_subst_35))) (and (not (= .cse187 .cse14)) (= .cse187 .cse79))))) (.cse42 (exists ((v_subst_33 (_ BitVec 8)) (v_subst_34 (_ BitVec 8))) (let ((.cse185 ((_ sign_extend 24) v_subst_33)) (.cse186 ((_ sign_extend 24) v_subst_34))) (and (bvsge .cse185 (_ bv0 32)) (not (= .cse14 .cse185)) (= .cse185 .cse186) (= ~p1_old~0 ((_ extract 7 0) .cse186)))))) (.cse45 (= .cse22 .cse48)) (.cse90 (= ((_ sign_extend 24) ~r1~0) (_ bv0 32))) (.cse17 (= .cse89 ~send2~0)) (.cse0 (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse184)) .cse22))) (.cse59 (= .cse57 .cse14)) (.cse87 (= (_ bv4 32) |ULTIMATE.start_main_~i2~0#1|)) (.cse80 (exists ((v_subst_1775 (_ BitVec 8))) (let ((.cse183 ((_ sign_extend 24) v_subst_1775))) (and (= .cse14 .cse183) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse183))) ~send1~0))))) (.cse82 (or .cse163 .cse62)) (.cse83 (forall ((v_subst_2552 (_ BitVec 8))) (let ((.cse179 ((_ sign_extend 24) v_subst_2552))) (or (not (bvsge .cse179 (_ bv0 32))) (bvsgt .cse21 .cse179) (forall ((~id3~0 (_ BitVec 8)) (~send2~0 (_ BitVec 8)) (~send3~0 (_ BitVec 8))) (let ((.cse180 ((_ sign_extend 24) ~id3~0)) (.cse181 ((_ sign_extend 24) ~send2~0)) (.cse182 ((_ sign_extend 24) ~send3~0))) (or (= .cse180 .cse28) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse181)) .cse180) (= .cse180 .cse179) (not (= .cse180 .cse182)) (not (= .cse181 .cse179)) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse182)) .cse28)))))))) (.cse9 (not (bvsgt .cse174 .cse22))) (.cse84 (exists ((v_subst_1774 (_ BitVec 8))) (let ((.cse178 ((_ sign_extend 24) v_subst_1774))) (and (= ~send3~0 ((_ extract 7 0) .cse178)) (= .cse14 .cse178))))) (.cse40 (= ~r1~0 .cse172)) (.cse18 (bvsge .cse22 (_ bv0 32))) (.cse19 (= ((_ sign_extend 24) ~st1~0) (_ bv0 32))) (.cse20 (not .cse177)) (.cse85 (exists ((v_subst_163 (_ BitVec 8)) (v_subst_164 (_ BitVec 8))) (let ((.cse175 ((_ sign_extend 24) v_subst_163)) (.cse176 ((_ sign_extend 24) v_subst_164))) (and (not (= .cse175 .cse28)) (bvsge .cse175 (_ bv0 32)) (= ~send3~0 ((_ extract 7 0) .cse176)) (= .cse175 .cse176))))) (.cse52 (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse174)) .cse28))) (.cse86 (exists ((v_subst_50 (_ BitVec 8))) (let ((.cse173 ((_ sign_extend 24) v_subst_50))) (and (= .cse57 .cse173) (not (= .cse22 .cse173)))))) (.cse53 (bvsge .cse28 (_ bv0 32))) (.cse43 (= ~r1~0 ((_ extract 7 0) (bvadd ((_ sign_extend 24) .cse172) (_ bv1 32))))) (.cse154 (exists ((v_subst_385 (_ BitVec 8)) (v_subst_384 (_ BitVec 8))) (let ((.cse170 ((_ sign_extend 24) v_subst_385)) (.cse171 ((_ sign_extend 24) v_subst_384))) (and (= ((_ extract 7 0) .cse170) ~send2~0) (not (= .cse22 .cse171)) (bvsge .cse171 (_ bv0 32)) (= .cse170 .cse171))))) (.cse1 (= ((_ zero_extend 24) ~mode3~0) (_ bv0 32))) (.cse2 (= (_ bv0 32) ((_ zero_extend 24) ~mode1~0))) (.cse3 (= (bvadd ~p1_new~0 (_ bv1 8)) (_ bv0 8))) (.cse4 (= ((_ zero_extend 24) ~mode2~0) (_ bv0 32))) (.cse138 (exists ((v_subst_1592 (_ BitVec 8))) (let ((.cse169 ((_ sign_extend 24) v_subst_1592))) (and (= .cse28 .cse169) (= ~send3~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse169)))))))) (.cse5 (= ((_ sign_extend 24) ~st3~0) (_ bv0 32))) (.cse44 (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse168)) .cse28))) (.cse30 (= .cse28 .cse79)) (.cse6 (= ((_ sign_extend 24) ~st2~0) (_ bv0 32))) (.cse46 (= (_ bv6 32) |ULTIMATE.start_main_~i2~0#1|)) (.cse33 (bvsge .cse14 (_ bv0 32))) (.cse7 (= (bvadd (_ bv1 8) ~p3_new~0) (_ bv0 8))) (.cse8 (= (bvadd (_ bv1 8) ~p2_new~0) (_ bv0 8))) (.cse10 (exists ((v_subst_29 (_ BitVec 8))) (let ((.cse167 ((_ sign_extend 24) v_subst_29))) (and (= .cse167 .cse79) (not (= .cse14 .cse167)))))) (.cse139 (exists ((v_subst_1591 (_ BitVec 8))) (let ((.cse166 ((_ sign_extend 24) v_subst_1591))) (and (= ((_ extract 7 0) .cse166) ~send2~0) (= .cse166 .cse28))))) (.cse140 (exists ((v_subst_386 (_ BitVec 8))) (let ((.cse165 ((_ sign_extend 24) v_subst_386))) (and (not (= .cse165 .cse22)) (= .cse165 .cse79))))) (.cse51 (not (bvsgt .cse164 .cse28))) (.cse65 (not .cse163)) (.cse157 (exists ((v_subst_101 (_ BitVec 8)) (v_subst_102 (_ BitVec 8))) (let ((.cse161 ((_ sign_extend 24) v_subst_102)) (.cse162 ((_ sign_extend 24) v_subst_101))) (and (= ~send3~0 ((_ extract 7 0) .cse161)) (= .cse162 .cse161) (bvsge .cse162 (_ bv0 32)))))) (.cse24 (= (bvadd (_ bv1 8) ~nomsg~0) (_ bv0 8))) (.cse158 (= (_ bv1 8) ~st1~0)) (.cse25 (not .cse160))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((v_subst_679 (_ BitVec 8)) (v_subst_678 (_ BitVec 8))) (let ((.cse15 ((_ sign_extend 24) v_subst_679))) (let ((.cse12 ((_ sign_extend 24) v_subst_678)) (.cse13 ((_ extract 7 0) .cse15))) (and (bvsge .cse12 (_ bv0 32)) (bvsgt ((_ sign_extend 24) .cse13) .cse12) (= .cse14 .cse15) (= .cse13 ~send3~0))))) .cse16 .cse17 .cse18 .cse19 .cse20 (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse21)) .cse22) .cse23 .cse24 .cse25 .cse26) (and .cse3 (exists ((v_subst_1617 (_ BitVec 8))) (let ((.cse27 ((_ sign_extend 24) v_subst_1617))) (and (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse27))) ~send3~0) (= .cse27 .cse28)))) .cse5 (exists ((v_subst_1618 (_ BitVec 8))) (let ((.cse29 ((_ sign_extend 24) v_subst_1618))) (and (= ~p2_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse29)))) (= .cse29 .cse28)))) .cse30 (exists ((v_subst_1615 (_ BitVec 8))) (let ((.cse31 ((_ sign_extend 24) v_subst_1615))) (and (= .cse28 .cse31) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse31))))) ~p3_old~0)))) .cse6 .cse32 .cse33 .cse7 .cse34 .cse8 .cse35 (exists ((v_subst_1616 (_ BitVec 8))) (let ((.cse36 ((_ sign_extend 24) v_subst_1616))) (and (= ~send2~0 ((_ extract 7 0) .cse36)) (= .cse28 .cse36)))) .cse37 (exists ((v_subst_1614 (_ BitVec 8))) (let ((.cse38 ((_ sign_extend 24) v_subst_1614))) (and (= .cse28 .cse38) (= ~p1_old~0 ((_ extract 7 0) .cse38))))) .cse39 .cse40 .cse18 .cse19 .cse41 .cse42 .cse24) (and .cse43 .cse1 .cse2 .cse3 .cse4 .cse44 .cse45 .cse6 .cse46 (exists ((v_subst_505 (_ BitVec 8))) (let ((.cse47 ((_ sign_extend 24) v_subst_505))) (and (not (= .cse14 .cse47)) (= .cse47 .cse48)))) .cse33 .cse7 .cse49 .cse8 .cse50 .cse51 .cse19 .cse52 (= (_ bv1 8) ~st3~0) .cse53 .cse24 .cse25 .cse54 .cse55 .cse56) (and (exists ((v_subst_140 (_ BitVec 8))) (let ((.cse58 ((_ sign_extend 24) v_subst_140))) (and (= .cse57 .cse58) (not (= .cse58 .cse28))))) .cse1 .cse2 .cse59 .cse3 .cse4 .cse60 .cse5 .cse44 (exists ((v_subst_82 (_ BitVec 8))) (let ((.cse61 ((_ sign_extend 24) v_subst_82))) (and (= .cse57 .cse61) (bvsge .cse61 (_ bv0 32))))) .cse62 .cse6 .cse7 .cse63 .cse8 .cse11 (not (= .cse22 .cse64)) .cse51 .cse65 .cse19 .cse66 .cse52 .cse53 .cse24 .cse25 .cse55 .cse26) (and .cse3 .cse5 .cse67 .cse68 .cse6 (exists ((v_subst_1644 (_ BitVec 8))) (let ((.cse69 ((_ sign_extend 24) v_subst_1644))) (and (= ((_ extract 7 0) .cse69) ~p3_old~0) (= .cse22 .cse69)))) .cse33 .cse7 .cse34 .cse8 (exists ((v_subst_1568 (_ BitVec 8))) (let ((.cse70 ((_ sign_extend 24) v_subst_1568))) (and (= ((_ extract 7 0) .cse70) ~send2~0) (= .cse70 .cse28)))) .cse11 .cse37 .cse71 .cse39 (exists ((v_subst_935 (_ BitVec 8))) (let ((.cse72 ((_ sign_extend 24) v_subst_935))) (and (= .cse28 .cse72) (= ~p1_old~0 ((_ extract 7 0) .cse72))))) .cse17 .cse73 .cse19 .cse74 (exists ((v_subst_485 (_ BitVec 8))) (let ((.cse75 ((_ sign_extend 24) v_subst_485))) (and (not (= .cse14 .cse75)) (= .cse75 .cse48)))) .cse76 .cse42 (exists ((v_subst_1880 (_ BitVec 8)) (v_subst_1881 (_ BitVec 8))) (let ((.cse77 ((_ sign_extend 24) v_subst_1881)) (.cse78 ((_ sign_extend 24) v_subst_1880))) (and (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse77)) .cse78)) (= .cse22 .cse77) (= .cse78 .cse79)))) .cse24) (and .cse43 .cse0 .cse1 .cse2 .cse59 .cse3 .cse4 .cse5 .cse44 (= (_ bv1 8) ~st2~0) .cse80 .cse81 .cse82 .cse46 .cse7 .cse8 .cse83 .cse9 .cse84 .cse51 .cse18 .cse19 .cse20 .cse85 .cse52 .cse86 .cse53 .cse24 .cse25 .cse56) (and .cse1 .cse2 .cse3 .cse87 .cse4 .cse5 .cse88 .cse44 .cse45 .cse6 .cse33 .cse7 .cse8 .cse50 .cse51 .cse40 .cse19 .cse52 .cse53 .cse24 .cse25 .cse54 .cse55) (and .cse3 .cse5 .cse6 (= (_ bv1 32) |ULTIMATE.start_main_~i2~0#1|) .cse7 .cse34 .cse8 (= ~p1_old~0 .cse89) .cse37 .cse71 .cse90 .cse39 .cse73 .cse18 .cse19 (exists ((v_subst_2361 (_ BitVec 8))) (let ((.cse91 ((_ sign_extend 24) v_subst_2361))) (and (= ((_ extract 7 0) .cse91) ~p2_old~0) (= .cse14 .cse91)))) .cse92 .cse42 .cse24 (exists ((v_subst_359 (_ BitVec 8)) (v_subst_360 (_ BitVec 8))) (let ((.cse93 ((_ sign_extend 24) v_subst_360)) (.cse94 ((_ sign_extend 24) v_subst_359))) (and (= ~p1_old~0 ((_ extract 7 0) .cse93)) (= .cse93 .cse94) (bvsge .cse94 (_ bv0 32)) (not (= .cse22 .cse94))))) (exists ((v_subst_2360 (_ BitVec 8))) (let ((.cse95 ((_ sign_extend 24) v_subst_2360))) (and (= .cse95 .cse28) (= ~p1_old~0 ((_ extract 7 0) .cse95))))) (exists ((v_subst_2015 (_ BitVec 8))) (let ((.cse96 ((_ sign_extend 24) v_subst_2015))) (and (= .cse22 .cse96) (= ((_ extract 7 0) .cse96) ~p3_old~0))))) (and .cse3 .cse97 .cse98 .cse5 .cse68 .cse6 .cse7 .cse34 (exists ((~send3~0 (_ BitVec 8))) (let ((.cse99 ((_ sign_extend 24) ~send3~0))) (and (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse99)))) (= .cse22 .cse99)))) .cse100 .cse8 .cse101 .cse11 .cse37 .cse71 .cse102 .cse39 .cse103 .cse73 .cse18 .cse19 .cse92 .cse53 .cse24 .cse25 .cse104) (and .cse3 .cse97 .cse5 .cse68 .cse6 .cse7 .cse34 .cse63 .cse8 .cse105 .cse101 .cse11 .cse37 (exists ((v_subst_1667 (_ BitVec 8))) (let ((.cse106 ((_ sign_extend 24) v_subst_1667))) (and (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse106)))) (= .cse22 .cse106)))) .cse71 .cse39 .cse65 (exists ((v_subst_1222 (_ BitVec 8))) (let ((.cse107 ((_ sign_extend 24) v_subst_1222))) (and (= ~p2_old~0 ((_ extract 7 0) .cse107)) (= .cse14 .cse107)))) .cse73 .cse19 .cse92 .cse53 .cse24 .cse55 .cse104) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse44 .cse45 .cse108 .cse62 .cse6 .cse33 .cse7 .cse49 .cse8 (exists ((v_~send1~0_35 (_ BitVec 8)) (v_subst_2057 (_ BitVec 8))) (let ((.cse109 ((_ sign_extend 24) v_~send1~0_35))) (let ((.cse110 ((_ sign_extend 24) v_subst_2057)) (.cse111 ((_ extract 7 0) .cse109))) (and (= .cse109 .cse110) (not (= .cse22 .cse110)) (bvsgt ((_ sign_extend 24) .cse111) .cse14) (= .cse111 ~send2~0))))) .cse11 .cse19 .cse66 .cse24 .cse25 .cse55 .cse56 .cse26) (and .cse98 .cse44 .cse7 .cse8 .cse51 (let ((.cse112 (exists ((v_subst_1748 (_ BitVec 8))) (let ((.cse116 ((_ sign_extend 24) v_subst_1748))) (and (= ((_ extract 7 0) .cse116) ~send3~0) (= .cse14 .cse116)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse112 .cse4 .cse5 .cse30 .cse6 .cse9 .cse10 .cse11 .cse19 .cse52 .cse86) (and .cse0 .cse1 .cse2 .cse3 .cse112 .cse4 .cse5 .cse81 .cse6 (exists ((v_subst_1257 (_ BitVec 8)) (v_subst_1258 (_ BitVec 8)) (v_subst_1259 (_ BitVec 8))) (let ((.cse113 ((_ sign_extend 24) v_subst_1259)) (.cse115 ((_ sign_extend 24) v_subst_1258)) (.cse114 ((_ sign_extend 24) v_subst_1257))) (and (= ((_ extract 7 0) .cse113) ~send1~0) (= .cse113 .cse114) (= .cse14 .cse115) (bvsge .cse114 (_ bv0 32)) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse115)) .cse114)))) .cse9 .cse11 .cse102 .cse19 .cse85 .cse52 .cse86 .cse56))) .cse103 .cse18 .cse20 .cse53 .cse24 .cse55 .cse26) (and .cse3 .cse5 .cse68 .cse108 .cse6 .cse33 .cse7 .cse34 .cse8 .cse105 (exists ((v_subst_2085 (_ BitVec 8)) (v_~send1~0_35 (_ BitVec 8))) (let ((.cse118 ((_ sign_extend 24) v_~send1~0_35))) (let ((.cse117 ((_ sign_extend 24) v_subst_2085)) (.cse119 ((_ extract 7 0) .cse118))) (and (= .cse117 .cse118) (bvsgt ((_ sign_extend 24) .cse119) .cse14) (not (= .cse22 .cse117)) (= .cse119 ~send2~0))))) .cse11 .cse37 .cse71 (exists ((v_subst_2086 (_ BitVec 8))) (let ((.cse120 ((_ sign_extend 24) v_subst_2086))) (and (= .cse22 .cse120) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse120))))))) .cse39 .cse73 .cse19 (exists ((v_subst_2083 (_ BitVec 8))) (let ((.cse121 ((_ sign_extend 24) v_subst_2083))) (and (= ~send1~0 ((_ extract 7 0) .cse121)) (= .cse22 .cse121)))) .cse24 .cse55) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse60 .cse5 .cse45 .cse6 .cse33 .cse7 .cse8 .cse9 .cse10 (exists ((v_subst_479 (_ BitVec 8))) (let ((.cse122 ((_ sign_extend 24) v_subst_479))) (and (not (= .cse14 .cse122)) (= .cse48 .cse122)))) .cse11 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 .cse26) (and (exists ((v_subst_1789 (_ BitVec 8))) (let ((.cse123 ((_ sign_extend 24) v_subst_1789))) (and (= ((_ extract 7 0) .cse123) ~p2_old~0) (= .cse14 .cse123)))) .cse3 .cse5 .cse6 .cse7 .cse34 .cse8 .cse83 .cse35 .cse37 (exists ((v_subst_1792 (_ BitVec 8))) (let ((.cse124 ((_ sign_extend 24) v_subst_1792))) (and (= ((_ extract 7 0) .cse124) ~send3~0) (= .cse14 .cse124)))) .cse39 (exists ((v_subst_1790 (_ BitVec 8))) (let ((.cse125 ((_ sign_extend 24) v_subst_1790))) (and (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse125)))))) (= .cse14 .cse125)))) .cse40 .cse73 .cse18 .cse19 .cse92 .cse53 .cse24 (exists ((v_subst_1791 (_ BitVec 8))) (let ((.cse126 ((_ sign_extend 24) v_subst_1791))) (and (= .cse14 .cse126) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse126))) ~send1~0)))) .cse104 (exists ((v_subst_1788 (_ BitVec 8))) (let ((.cse127 ((_ sign_extend 24) v_subst_1788))) (and (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse127))) ~p3_old~0) (= .cse14 .cse127))))) (and .cse3 .cse5 (exists ((v_subst_1718 (_ BitVec 8))) (let ((.cse128 ((_ sign_extend 24) v_subst_1718))) (and (= ~p2_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse128)))))) (= .cse22 .cse128)))) (exists ((v_subst_1715 (_ BitVec 8))) (let ((.cse129 ((_ sign_extend 24) v_subst_1715))) (and (= .cse22 .cse129) (= ~p3_old~0 ((_ extract 7 0) .cse129))))) .cse6 .cse32 .cse33 .cse7 .cse34 .cse8 (exists ((v_subst_1714 (_ BitVec 8))) (let ((.cse130 ((_ sign_extend 24) v_subst_1714))) (and (= ~send2~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse130)))) (= .cse22 .cse130)))) .cse35 .cse37 .cse71 .cse39 (exists ((v_subst_1716 (_ BitVec 8))) (let ((.cse131 ((_ sign_extend 24) v_subst_1716))) (and (= .cse22 .cse131) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse131))))))) .cse40 .cse19 (exists ((v_subst_1717 (_ BitVec 8))) (let ((.cse132 ((_ sign_extend 24) v_subst_1717))) (and (= .cse22 .cse132) (= ~send1~0 ((_ extract 7 0) .cse132))))) .cse53 .cse24 .cse55) (and .cse3 .cse5 .cse68 .cse30 .cse6 (exists ((v_subst_2236 (_ BitVec 8))) (let ((.cse133 ((_ sign_extend 24) v_subst_2236))) (and (= .cse28 .cse133) (= ~p1_old~0 ((_ extract 7 0) .cse133))))) .cse7 .cse34 .cse100 .cse8 .cse11 .cse37 .cse39 (exists ((v_subst_2237 (_ BitVec 8)) (v_subst_2238 (_ BitVec 8))) (let ((.cse134 ((_ sign_extend 24) v_subst_2238)) (.cse135 ((_ sign_extend 24) v_subst_2237))) (and (= .cse28 .cse134) (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse134)) .cse135)) (= .cse57 .cse135)))) .cse103 .cse73 .cse18 .cse19 .cse92 .cse53 .cse24 (exists ((v_subst_2235 (_ BitVec 8)) (v_subst_2234 (_ BitVec 8)) (v_subst_2233 (_ BitVec 8))) (let ((.cse137 ((_ sign_extend 24) v_subst_2235))) (let ((.cse136 ((_ extract 7 0) .cse137))) (and (= ((_ sign_extend 24) v_subst_2234) .cse28) (= ~p3_old~0 ((_ extract 7 0) ((_ sign_extend 24) .cse136))) (= ((_ sign_extend 24) v_subst_2233) .cse137) (= ~p2_old~0 .cse136))))) .cse104) (and .cse0 .cse1 .cse2 .cse3 .cse87 .cse4 .cse138 .cse5 .cse88 .cse44 .cse30 .cse6 .cse33 .cse7 .cse8 .cse9 .cse10 .cse139 .cse140 .cse51 .cse40 .cse18 .cse19 .cse20 .cse24 .cse25) (and .cse3 .cse5 .cse67 .cse68 .cse6 .cse7 .cse34 .cse8 .cse11 (exists ((v_subst_1867 (_ BitVec 8)) (v_subst_1868 (_ BitVec 8)) (~send3~0 (_ BitVec 8))) (let ((.cse143 ((_ sign_extend 24) v_subst_1868))) (let ((.cse141 ((_ sign_extend 24) ~send3~0)) (.cse142 ((_ sign_extend 24) v_subst_1867)) (.cse144 ((_ extract 7 0) .cse143))) (and (= .cse22 .cse141) (= .cse142 .cse143) (= ~p1_old~0 .cse144) (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse141)) .cse142)) (= ~p2_old~0 ((_ extract 7 0) ((_ sign_extend 24) .cse144))))))) .cse37 .cse16 .cse39 (exists ((v_subst_1566 (_ BitVec 8))) (let ((.cse145 ((_ sign_extend 24) v_subst_1566))) (and (= .cse145 .cse28) (= ~p1_old~0 ((_ extract 7 0) .cse145))))) .cse17 .cse73 .cse18 .cse19 .cse74 .cse41 .cse76 (exists ((v_subst_763 (_ BitVec 8)) (v_subst_762 (_ BitVec 8))) (let ((.cse148 ((_ sign_extend 24) v_subst_763))) (let ((.cse146 ((_ sign_extend 24) v_subst_762)) (.cse147 ((_ extract 7 0) .cse148))) (and (bvsge .cse146 (_ bv0 32)) (bvsgt ((_ sign_extend 24) .cse147) .cse146) (= .cse147 ~send3~0) (= .cse14 .cse148))))) .cse42 (exists ((v_subst_758 (_ BitVec 8)) (v_subst_759 (_ BitVec 8))) (let ((.cse151 ((_ sign_extend 24) v_subst_759))) (let ((.cse149 ((_ sign_extend 24) v_subst_758)) (.cse150 ((_ sign_extend 24) ((_ extract 7 0) .cse151)))) (and (bvsge .cse149 (_ bv0 32)) (bvsgt .cse150 .cse149) (= ~p3_old~0 ((_ extract 7 0) .cse150)) (= .cse14 .cse151))))) .cse24) (and .cse0 .cse1 .cse2 .cse59 .cse3 .cse4 .cse5 .cse44 .cse30 .cse45 .cse82 .cse6 (= (_ bv0 32) |ULTIMATE.start_main_~i2~0#1|) .cse7 .cse8 .cse9 .cse51 .cse90 .cse18 .cse19 .cse20 (exists ((v_subst_2003 (_ BitVec 8))) (let ((.cse152 ((_ sign_extend 24) v_subst_2003))) (and (= .cse79 .cse152) (not (= .cse22 .cse152))))) (not (= .cse14 .cse28)) .cse52 .cse86 .cse53 .cse24 (exists ((v_subst_2291 (_ BitVec 8))) (let ((.cse153 ((_ sign_extend 24) v_subst_2291))) (and (= .cse57 .cse153) (bvsge .cse153 (_ bv0 32))))) .cse25) (and .cse43 .cse154 .cse0 .cse1 .cse2 .cse3 .cse4 .cse138 .cse5 (exists ((v_subst_1832 (_ BitVec 8)) (~send3~0 (_ BitVec 8))) (let ((.cse155 ((_ sign_extend 24) ~send3~0)) (.cse156 ((_ sign_extend 24) v_subst_1832))) (and (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse155)) .cse156)) (= .cse22 .cse155) (= .cse156 .cse79)))) .cse6 .cse46 .cse33 .cse7 .cse8 .cse9 .cse10 .cse139 .cse140 .cse17 .cse18 .cse157 .cse20 .cse24 .cse158 .cse25) (and .cse0 .cse1 .cse2 .cse59 .cse3 .cse87 .cse4 .cse5 .cse44 .cse80 .cse82 .cse6 .cse7 .cse8 .cse83 .cse9 .cse84 .cse51 .cse40 .cse18 .cse19 .cse20 .cse85 .cse52 .cse86 .cse53 .cse24 .cse25) (and .cse43 .cse154 .cse1 .cse2 .cse3 .cse4 .cse138 .cse5 (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse159)) .cse14) .cse44 .cse30 .cse6 .cse46 .cse33 .cse7 .cse8 .cse10 .cse139 .cse140 .cse51 .cse65 .cse157 .cse24 .cse158 .cse25))))))) [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L254-3(lines 254 269) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 163) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 160) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 65) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L58-1(lines 58 65) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 284) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 157) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 115) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 108 115) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 64) no Hoare annotation was computed. [2023-12-25 07:53:16,036 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 154) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 151) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 64) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 215) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 114) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 193) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 129 193) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 95) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L80-2(lines 74 98) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 190) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L246(line 246) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L246-2(line 246) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 187) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L280(line 280) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 280) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 184) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point $Ultimate##101(lines 208 215) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 90) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 83 90) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 181) no Hoare annotation was computed. [2023-12-25 07:53:16,037 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 89) no Hoare annotation was computed. [2023-12-25 07:53:16,038 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 178) no Hoare annotation was computed. [2023-12-25 07:53:16,040 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:53:16,041 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:53:16,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:53:16,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_679 : bv8, v_subst_678 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_678), 0bv32) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_679)[7:0]), ~sign_extend~32~8(v_subst_678))) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_679)) && ~sign_extend~32~8(v_subst_679)[7:0] == ~send3~0) could not be translated [2023-12-25 07:53:16,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1551 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1551) && ~sign_extend~32~8(v_subst_1551)[7:0] == ~send2~0) could not be translated [2023-12-25 07:53:16,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1617 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1617)[7:0])[7:0] == ~send3~0 && ~sign_extend~32~8(v_subst_1617) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:53:16,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1618 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1618)[7:0])[7:0] && ~sign_extend~32~8(v_subst_1618) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:53:16,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1615 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1615) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1615)[7:0])[7:0])[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:53:16,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1616 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_1616)[7:0] && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1616)) could not be translated [2023-12-25 07:53:16,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1614 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1614) && ~p1_old~0 == ~sign_extend~32~8(v_subst_1614)[7:0]) could not be translated [2023-12-25 07:53:16,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_409 : bv8, v_subst_408 : bv8 :: ((~sign_extend~32~8(v_subst_408) == ~sign_extend~32~8(v_subst_409) && ~send2~0 == ~sign_extend~32~8(v_subst_409)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_408))) && ~bvsge~32(~sign_extend~32~8(v_subst_408), 0bv32)) could not be translated [2023-12-25 07:53:16,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:53:16,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_505 : bv8 :: !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_505)) && ~sign_extend~32~8(v_subst_505) == ~sign_extend~32~8(~send3~0)) could not be translated [2023-12-25 07:53:16,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_162 : bv8, ~send2~0 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_162), 0bv32) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_162)) && !(~sign_extend~32~8(v_subst_162) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1692 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1692)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1692)) could not be translated [2023-12-25 07:53:16,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1691 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1691) && ~sign_extend~32~8(v_subst_1691)[7:0] == ~send1~0) could not be translated [2023-12-25 07:53:16,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated [2023-12-25 07:53:16,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_140 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_140) && !(~sign_extend~32~8(v_subst_140) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated [2023-12-25 07:53:16,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_82 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_82) && ~bvsge~32(~sign_extend~32~8(v_subst_82), 0bv32)) could not be translated [2023-12-25 07:53:16,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1654 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1654) && ~sign_extend~32~8(v_subst_1654)[7:0] == ~send1~0) could not be translated [2023-12-25 07:53:16,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_173 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_173) && ~bvsge~32(~sign_extend~32~8(v_subst_173), 0bv32)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && !(~sign_extend~32~8(v_subst_173) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1644 : bv8 :: ~sign_extend~32~8(v_subst_1644)[7:0] == ~p3_old~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1644)) could not be translated [2023-12-25 07:53:16,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1568 : bv8 :: ~sign_extend~32~8(v_subst_1568)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1568) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:53:16,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated [2023-12-25 07:53:16,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_174 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_174)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_174)) && ~bvsge~32(~sign_extend~32~8(v_subst_174), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated [2023-12-25 07:53:16,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_485 : bv8 :: !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_485)) && ~sign_extend~32~8(v_subst_485) == ~sign_extend~32~8(~send3~0)) could not be translated [2023-12-25 07:53:16,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_35 : bv8 :: !(~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~id2~0)) && ~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:53:16,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:53:16,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8, v_subst_1881 : bv8 :: (!~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1881)[7:0]), ~sign_extend~32~8(v_subst_1880)) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1881)) && ~sign_extend~32~8(v_subst_1880) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:53:16,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1775 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1775) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1775)[7:0])[7:0] == ~send1~0) could not be translated [2023-12-25 07:53:16,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_165 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_165) && !(~sign_extend~32~8(v_subst_165) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_2552 : bv8 :: (!~bvsge~32(~sign_extend~32~8(v_subst_2552), 0bv32) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2552))) || (forall ~id3~0 : bv8, ~send2~0 : bv8, ~send3~0 : bv8 :: ((((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~id1~0) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0]), ~sign_extend~32~8(~id3~0))) || ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2552)) || !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0))) || !(~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2552))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0)))) could not be translated [2023-12-25 07:53:16,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1774 : bv8 :: ~send3~0 == ~sign_extend~32~8(v_subst_1774)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1774)) could not be translated [2023-12-25 07:53:16,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_163 : bv8, v_subst_164 : bv8 :: ((!(~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(~id1~0)) && ~bvsge~32(~sign_extend~32~8(v_subst_163), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_164)[7:0]) && ~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(v_subst_164)) could not be translated [2023-12-25 07:53:16,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:53:16,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated [2023-12-25 07:53:16,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1692 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1692)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1692)) could not be translated [2023-12-25 07:53:16,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1691 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1691) && ~sign_extend~32~8(v_subst_1691)[7:0] == ~send1~0) could not be translated [2023-12-25 07:53:16,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2361 : bv8 :: ~sign_extend~32~8(v_subst_2361)[7:0] == ~p2_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_2361)) could not be translated [2023-12-25 07:53:16,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:53:16,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:53:16,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_359 : bv8, v_subst_360 : bv8 :: ((~p1_old~0 == ~sign_extend~32~8(v_subst_360)[7:0] && ~sign_extend~32~8(v_subst_360) == ~sign_extend~32~8(v_subst_359)) && ~bvsge~32(~sign_extend~32~8(v_subst_359), 0bv32)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_359))) could not be translated [2023-12-25 07:53:16,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2360 : bv8 :: ~sign_extend~32~8(v_subst_2360) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_2360)[7:0]) could not be translated [2023-12-25 07:53:16,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2015 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2015) && ~sign_extend~32~8(v_subst_2015)[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:53:16,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_187 : bv8, v_subst_186 : bv8 :: ((~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(v_subst_187) && ~bvsge~32(~sign_extend~32~8(v_subst_186), 0bv32)) && !(~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_187)[7:0])[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:53:16,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_2480 : bv8 :: ((forall v_subst_2482 : bv8, v_subst_2481 : bv8, v_subst_2483 : bv8 :: ((((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2483)[7:0]), ~sign_extend~32~8(~id1~0)) || ~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2481)) || !(~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2482))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2482)[7:0]), ~sign_extend~32~8(v_subst_2481))) || ~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(~id1~0)) || !(~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(v_subst_2483))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2480))) || !~bvsge~32(~sign_extend~32~8(v_subst_2480), 0bv32)) could not be translated [2023-12-25 07:53:16,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send3~0 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) could not be translated [2023-12-25 07:53:16,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1756 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1756) && ~sign_extend~32~8(v_subst_1756)[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:53:16,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_188 : bv8 :: !(~sign_extend~32~8(v_subst_188) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_188)) could not be translated [2023-12-25 07:53:16,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send3~0 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0) && ~send1~0 == ~sign_extend~32~8(~send3~0)[7:0]) could not be translated [2023-12-25 07:53:16,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:53:16,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_187 : bv8, v_subst_186 : bv8 :: ((~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(v_subst_187) && ~bvsge~32(~sign_extend~32~8(v_subst_186), 0bv32)) && !(~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_187)[7:0])[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:53:16,077 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1668 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1668)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1668)) could not be translated [2023-12-25 07:53:16,077 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_188 : bv8 :: !(~sign_extend~32~8(v_subst_188) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_188)) could not be translated [2023-12-25 07:53:16,077 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1667 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1667)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1667)) could not be translated [2023-12-25 07:53:16,077 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1222 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1222)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1222)) could not be translated [2023-12-25 07:53:16,077 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:53:16,077 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,078 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated [2023-12-25 07:53:16,078 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_162 : bv8, ~send2~0 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_162), 0bv32) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_162)) && !(~sign_extend~32~8(v_subst_162) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,078 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_~send1~0_35 : bv8, v_subst_2057 : bv8 :: ((~sign_extend~32~8(v_~send1~0_35) == ~sign_extend~32~8(v_subst_2057) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2057))) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_35)[7:0]), ~sign_extend~32~8(~id2~0))) && ~sign_extend~32~8(v_~send1~0_35)[7:0] == ~send2~0) could not be translated [2023-12-25 07:53:16,078 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1654 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1654) && ~sign_extend~32~8(v_subst_1654)[7:0] == ~send1~0) could not be translated [2023-12-25 07:53:16,078 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated [2023-12-25 07:53:16,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_2480 : bv8 :: ((forall v_subst_2482 : bv8, v_subst_2481 : bv8, v_subst_2483 : bv8 :: ((((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2483)[7:0]), ~sign_extend~32~8(~id1~0)) || ~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2481)) || !(~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2482))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2482)[7:0]), ~sign_extend~32~8(v_subst_2481))) || ~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(~id1~0)) || !(~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(v_subst_2483))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2480))) || !~bvsge~32(~sign_extend~32~8(v_subst_2480), 0bv32)) could not be translated [2023-12-25 07:53:16,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1748 : bv8 :: ~sign_extend~32~8(v_subst_1748)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1748)) could not be translated [2023-12-25 07:53:16,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:53:16,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:53:16,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1748 : bv8 :: ~sign_extend~32~8(v_subst_1748)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1748)) could not be translated [2023-12-25 07:53:16,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_165 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_165) && !(~sign_extend~32~8(v_subst_165) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1257 : bv8, v_subst_1258 : bv8, v_subst_1259 : bv8 :: (((~sign_extend~32~8(v_subst_1259)[7:0] == ~send1~0 && ~sign_extend~32~8(v_subst_1259) == ~sign_extend~32~8(v_subst_1257)) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1258)) && ~bvsge~32(~sign_extend~32~8(v_subst_1257), 0bv32)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1258)[7:0]), ~sign_extend~32~8(v_subst_1257))) could not be translated [2023-12-25 07:53:16,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send3~0 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0) && ~send1~0 == ~sign_extend~32~8(~send3~0)[7:0]) could not be translated [2023-12-25 07:53:16,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_163 : bv8, v_subst_164 : bv8 :: ((!(~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(~id1~0)) && ~bvsge~32(~sign_extend~32~8(v_subst_163), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_164)[7:0]) && ~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(v_subst_164)) could not be translated [2023-12-25 07:53:16,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:53:16,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated [2023-12-25 07:53:16,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated [2023-12-25 07:53:16,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1668 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1668)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1668)) could not be translated [2023-12-25 07:53:16,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2085 : bv8, v_~send1~0_35 : bv8 :: ((~sign_extend~32~8(v_subst_2085) == ~sign_extend~32~8(v_~send1~0_35) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_35)[7:0]), ~sign_extend~32~8(~id2~0))) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2085))) && ~sign_extend~32~8(v_~send1~0_35)[7:0] == ~send2~0) could not be translated [2023-12-25 07:53:16,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2086 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2086) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2086)[7:0])[7:0]) could not be translated [2023-12-25 07:53:16,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2083 : bv8 :: ~send1~0 == ~sign_extend~32~8(v_subst_2083)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2083)) could not be translated [2023-12-25 07:53:16,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated [2023-12-25 07:53:16,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:53:16,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_479 : bv8 :: !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_479)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_479)) could not be translated [2023-12-25 07:53:16,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1551 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1551) && ~sign_extend~32~8(v_subst_1551)[7:0] == ~send2~0) could not be translated [2023-12-25 07:53:16,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1789 : bv8 :: ~sign_extend~32~8(v_subst_1789)[7:0] == ~p2_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1789)) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_2552 : bv8 :: (!~bvsge~32(~sign_extend~32~8(v_subst_2552), 0bv32) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2552))) || (forall ~id3~0 : bv8, ~send2~0 : bv8, ~send3~0 : bv8 :: ((((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~id1~0) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0]), ~sign_extend~32~8(~id3~0))) || ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2552)) || !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0))) || !(~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2552))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0)))) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1792 : bv8 :: ~sign_extend~32~8(v_subst_1792)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1792)) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1790 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1790)[7:0])[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1790)) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1791 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1791) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1791)[7:0])[7:0] == ~send1~0) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1788 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1788)[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1788)) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1718 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1718)[7:0])[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1718)) could not be translated [2023-12-25 07:53:16,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1715 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1715) && ~p3_old~0 == ~sign_extend~32~8(v_subst_1715)[7:0]) could not be translated [2023-12-25 07:53:16,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1714 : bv8 :: ~send2~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1714)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1714)) could not be translated [2023-12-25 07:53:16,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1716 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1716) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1716)[7:0])[7:0]) could not be translated [2023-12-25 07:53:16,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1717 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1717) && ~send1~0 == ~sign_extend~32~8(v_subst_1717)[7:0]) could not be translated [2023-12-25 07:53:16,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2236 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2236) && ~p1_old~0 == ~sign_extend~32~8(v_subst_2236)[7:0]) could not be translated [2023-12-25 07:53:16,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1756 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1756) && ~sign_extend~32~8(v_subst_1756)[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:53:16,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2237 : bv8, v_subst_2238 : bv8 :: (~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2238) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2238)[7:0]), ~sign_extend~32~8(v_subst_2237))) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2237)) could not be translated [2023-12-25 07:53:16,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:53:16,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2235 : bv8, v_subst_2234 : bv8, v_subst_2233 : bv8 :: ((~sign_extend~32~8(v_subst_2234) == ~sign_extend~32~8(~id1~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2235)[7:0])[7:0]) && ~sign_extend~32~8(v_subst_2233) == ~sign_extend~32~8(v_subst_2235)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_2235)[7:0]) could not be translated [2023-12-25 07:53:16,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1592 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1592) && ~send3~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1592)[7:0])[7:0]) could not be translated [2023-12-25 07:53:16,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:53:16,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1591 : bv8 :: ~sign_extend~32~8(v_subst_1591)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1591) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:53:16,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_386 : bv8 :: !(~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~id3~0)) && ~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:53:16,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_173 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_173) && ~bvsge~32(~sign_extend~32~8(v_subst_173), 0bv32)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && !(~sign_extend~32~8(v_subst_173) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:53:16,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1867 : bv8, v_subst_1868 : bv8, ~send3~0 : bv8 :: (((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0) && ~sign_extend~32~8(v_subst_1867) == ~sign_extend~32~8(v_subst_1868)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_1868)[7:0]) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(v_subst_1867))) && ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1868)[7:0])[7:0]) could not be translated [2023-12-25 07:53:16,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1566 : bv8 :: ~sign_extend~32~8(v_subst_1566) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_1566)[7:0]) could not be translated [2023-12-25 07:53:16,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_174 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_174)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_174)) && ~bvsge~32(~sign_extend~32~8(v_subst_174), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated [2023-12-25 07:53:16,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_409 : bv8, v_subst_408 : bv8 :: ((~sign_extend~32~8(v_subst_408) == ~sign_extend~32~8(v_subst_409) && ~send2~0 == ~sign_extend~32~8(v_subst_409)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_408))) && ~bvsge~32(~sign_extend~32~8(v_subst_408), 0bv32)) could not be translated [2023-12-25 07:53:16,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_35 : bv8 :: !(~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~id2~0)) && ~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:53:16,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_763 : bv8, v_subst_762 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_762), 0bv32) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_763)[7:0]), ~sign_extend~32~8(v_subst_762))) && ~sign_extend~32~8(v_subst_763)[7:0] == ~send3~0) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_763)) could not be translated [2023-12-25 07:53:16,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:53:16,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_758 : bv8, v_subst_759 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_758), 0bv32) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_759)[7:0]), ~sign_extend~32~8(v_subst_758))) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_759)[7:0])[7:0]) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_759)) could not be translated [2023-12-25 07:53:16,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2003 : bv8 :: ~sign_extend~32~8(~send1~0) == ~sign_extend~32~8(v_subst_2003) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2003))) could not be translated [2023-12-25 07:53:16,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:53:16,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2291 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2291) && ~bvsge~32(~sign_extend~32~8(v_subst_2291), 0bv32)) could not be translated [2023-12-25 07:53:16,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_385 : bv8, v_subst_384 : bv8 :: ((~sign_extend~32~8(v_subst_385)[7:0] == ~send2~0 && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_384))) && ~bvsge~32(~sign_extend~32~8(v_subst_384), 0bv32)) && ~sign_extend~32~8(v_subst_385) == ~sign_extend~32~8(v_subst_384)) could not be translated [2023-12-25 07:53:16,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1592 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1592) && ~send3~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1592)[7:0])[7:0]) could not be translated [2023-12-25 07:53:16,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1832 : bv8, ~send3~0 : bv8 :: (!~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(v_subst_1832)) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) && ~sign_extend~32~8(v_subst_1832) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:53:16,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:53:16,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1591 : bv8 :: ~sign_extend~32~8(v_subst_1591)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1591) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:53:16,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_386 : bv8 :: !(~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~id3~0)) && ~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:53:16,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_101 : bv8, v_subst_102 : bv8 :: (~send3~0 == ~sign_extend~32~8(v_subst_102)[7:0] && ~sign_extend~32~8(v_subst_101) == ~sign_extend~32~8(v_subst_102)) && ~bvsge~32(~sign_extend~32~8(v_subst_101), 0bv32)) could not be translated [2023-12-25 07:53:16,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1775 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1775) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1775)[7:0])[7:0] == ~send1~0) could not be translated [2023-12-25 07:53:16,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_2552 : bv8 :: (!~bvsge~32(~sign_extend~32~8(v_subst_2552), 0bv32) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2552))) || (forall ~id3~0 : bv8, ~send2~0 : bv8, ~send3~0 : bv8 :: ((((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~id1~0) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0]), ~sign_extend~32~8(~id3~0))) || ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2552)) || !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0))) || !(~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2552))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0)))) could not be translated [2023-12-25 07:53:16,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1774 : bv8 :: ~send3~0 == ~sign_extend~32~8(v_subst_1774)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1774)) could not be translated [2023-12-25 07:53:16,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_163 : bv8, v_subst_164 : bv8 :: ((!(~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(~id1~0)) && ~bvsge~32(~sign_extend~32~8(v_subst_163), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_164)[7:0]) && ~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(v_subst_164)) could not be translated [2023-12-25 07:53:16,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:53:16,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_385 : bv8, v_subst_384 : bv8 :: ((~sign_extend~32~8(v_subst_385)[7:0] == ~send2~0 && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_384))) && ~bvsge~32(~sign_extend~32~8(v_subst_384), 0bv32)) && ~sign_extend~32~8(v_subst_385) == ~sign_extend~32~8(v_subst_384)) could not be translated [2023-12-25 07:53:16,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1592 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1592) && ~send3~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1592)[7:0])[7:0]) could not be translated [2023-12-25 07:53:16,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:53:16,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1591 : bv8 :: ~sign_extend~32~8(v_subst_1591)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1591) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:53:16,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_386 : bv8 :: !(~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~id3~0)) && ~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:53:16,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_101 : bv8, v_subst_102 : bv8 :: (~send3~0 == ~sign_extend~32~8(v_subst_102)[7:0] && ~sign_extend~32~8(v_subst_101) == ~sign_extend~32~8(v_subst_102)) && ~bvsge~32(~sign_extend~32~8(v_subst_101), 0bv32)) could not be translated [2023-12-25 07:53:16,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:53:16 BoogieIcfgContainer [2023-12-25 07:53:16,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:53:16,093 INFO L158 Benchmark]: Toolchain (without parser) took 840874.84ms. Allocated memory was 194.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 149.8MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2023-12-25 07:53:16,093 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:53:16,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.07ms. Allocated memory is still 194.0MB. Free memory was 149.5MB in the beginning and 135.5MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 07:53:16,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.75ms. Allocated memory is still 194.0MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:53:16,093 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 194.0MB. Free memory was 133.4MB in the beginning and 131.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:53:16,093 INFO L158 Benchmark]: RCFGBuilder took 451.70ms. Allocated memory is still 194.0MB. Free memory was 130.6MB in the beginning and 169.1MB in the end (delta: -38.5MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2023-12-25 07:53:16,093 INFO L158 Benchmark]: TraceAbstraction took 840109.00ms. Allocated memory was 194.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 168.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-25 07:53:16,094 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.12ms. Allocated memory is still 194.0MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.07ms. Allocated memory is still 194.0MB. Free memory was 149.5MB in the beginning and 135.5MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.75ms. Allocated memory is still 194.0MB. Free memory was 135.5MB in the beginning and 133.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 194.0MB. Free memory was 133.4MB in the beginning and 131.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 451.70ms. Allocated memory is still 194.0MB. Free memory was 130.6MB in the beginning and 169.1MB in the end (delta: -38.5MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * TraceAbstraction took 840109.00ms. Allocated memory was 194.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 168.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_679 : bv8, v_subst_678 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_678), 0bv32) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_679)[7:0]), ~sign_extend~32~8(v_subst_678))) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_679)) && ~sign_extend~32~8(v_subst_679)[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1551 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1551) && ~sign_extend~32~8(v_subst_1551)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1617 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1617)[7:0])[7:0] == ~send3~0 && ~sign_extend~32~8(v_subst_1617) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1618 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1618)[7:0])[7:0] && ~sign_extend~32~8(v_subst_1618) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1615 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1615) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1615)[7:0])[7:0])[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1616 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_1616)[7:0] && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1616)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1614 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1614) && ~p1_old~0 == ~sign_extend~32~8(v_subst_1614)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_409 : bv8, v_subst_408 : bv8 :: ((~sign_extend~32~8(v_subst_408) == ~sign_extend~32~8(v_subst_409) && ~send2~0 == ~sign_extend~32~8(v_subst_409)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_408))) && ~bvsge~32(~sign_extend~32~8(v_subst_408), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_505 : bv8 :: !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_505)) && ~sign_extend~32~8(v_subst_505) == ~sign_extend~32~8(~send3~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_162 : bv8, ~send2~0 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_162), 0bv32) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_162)) && !(~sign_extend~32~8(v_subst_162) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1692 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1692)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1692)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1691 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1691) && ~sign_extend~32~8(v_subst_1691)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_140 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_140) && !(~sign_extend~32~8(v_subst_140) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_82 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_82) && ~bvsge~32(~sign_extend~32~8(v_subst_82), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1654 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1654) && ~sign_extend~32~8(v_subst_1654)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_173 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_173) && ~bvsge~32(~sign_extend~32~8(v_subst_173), 0bv32)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && !(~sign_extend~32~8(v_subst_173) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1644 : bv8 :: ~sign_extend~32~8(v_subst_1644)[7:0] == ~p3_old~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1644)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1568 : bv8 :: ~sign_extend~32~8(v_subst_1568)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1568) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_174 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_174)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_174)) && ~bvsge~32(~sign_extend~32~8(v_subst_174), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_485 : bv8 :: !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_485)) && ~sign_extend~32~8(v_subst_485) == ~sign_extend~32~8(~send3~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_35 : bv8 :: !(~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~id2~0)) && ~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8, v_subst_1881 : bv8 :: (!~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1881)[7:0]), ~sign_extend~32~8(v_subst_1880)) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1881)) && ~sign_extend~32~8(v_subst_1880) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1775 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1775) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1775)[7:0])[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_165 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_165) && !(~sign_extend~32~8(v_subst_165) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_2552 : bv8 :: (!~bvsge~32(~sign_extend~32~8(v_subst_2552), 0bv32) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2552))) || (forall ~id3~0 : bv8, ~send2~0 : bv8, ~send3~0 : bv8 :: ((((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~id1~0) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0]), ~sign_extend~32~8(~id3~0))) || ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2552)) || !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0))) || !(~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2552))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1774 : bv8 :: ~send3~0 == ~sign_extend~32~8(v_subst_1774)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1774)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_163 : bv8, v_subst_164 : bv8 :: ((!(~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(~id1~0)) && ~bvsge~32(~sign_extend~32~8(v_subst_163), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_164)[7:0]) && ~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(v_subst_164)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1692 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1692)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1692)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1691 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1691) && ~sign_extend~32~8(v_subst_1691)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2361 : bv8 :: ~sign_extend~32~8(v_subst_2361)[7:0] == ~p2_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_2361)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_359 : bv8, v_subst_360 : bv8 :: ((~p1_old~0 == ~sign_extend~32~8(v_subst_360)[7:0] && ~sign_extend~32~8(v_subst_360) == ~sign_extend~32~8(v_subst_359)) && ~bvsge~32(~sign_extend~32~8(v_subst_359), 0bv32)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_359))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2360 : bv8 :: ~sign_extend~32~8(v_subst_2360) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_2360)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2015 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2015) && ~sign_extend~32~8(v_subst_2015)[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_187 : bv8, v_subst_186 : bv8 :: ((~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(v_subst_187) && ~bvsge~32(~sign_extend~32~8(v_subst_186), 0bv32)) && !(~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_187)[7:0])[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_2480 : bv8 :: ((forall v_subst_2482 : bv8, v_subst_2481 : bv8, v_subst_2483 : bv8 :: ((((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2483)[7:0]), ~sign_extend~32~8(~id1~0)) || ~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2481)) || !(~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2482))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2482)[7:0]), ~sign_extend~32~8(v_subst_2481))) || ~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(~id1~0)) || !(~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(v_subst_2483))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2480))) || !~bvsge~32(~sign_extend~32~8(v_subst_2480), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send3~0 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1756 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1756) && ~sign_extend~32~8(v_subst_1756)[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_188 : bv8 :: !(~sign_extend~32~8(v_subst_188) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_188)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send3~0 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0) && ~send1~0 == ~sign_extend~32~8(~send3~0)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_187 : bv8, v_subst_186 : bv8 :: ((~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(v_subst_187) && ~bvsge~32(~sign_extend~32~8(v_subst_186), 0bv32)) && !(~sign_extend~32~8(v_subst_186) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_187)[7:0])[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1668 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1668)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1668)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_188 : bv8 :: !(~sign_extend~32~8(v_subst_188) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_188)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1667 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1667)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1667)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1222 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1222)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1222)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_162 : bv8, ~send2~0 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_162), 0bv32) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_162)) && !(~sign_extend~32~8(v_subst_162) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_~send1~0_35 : bv8, v_subst_2057 : bv8 :: ((~sign_extend~32~8(v_~send1~0_35) == ~sign_extend~32~8(v_subst_2057) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2057))) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_35)[7:0]), ~sign_extend~32~8(~id2~0))) && ~sign_extend~32~8(v_~send1~0_35)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1654 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1654) && ~sign_extend~32~8(v_subst_1654)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_2480 : bv8 :: ((forall v_subst_2482 : bv8, v_subst_2481 : bv8, v_subst_2483 : bv8 :: ((((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2483)[7:0]), ~sign_extend~32~8(~id1~0)) || ~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2481)) || !(~sign_extend~32~8(v_subst_2480) == ~sign_extend~32~8(v_subst_2482))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2482)[7:0]), ~sign_extend~32~8(v_subst_2481))) || ~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(~id1~0)) || !(~sign_extend~32~8(v_subst_2481) == ~sign_extend~32~8(v_subst_2483))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2480))) || !~bvsge~32(~sign_extend~32~8(v_subst_2480), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1748 : bv8 :: ~sign_extend~32~8(v_subst_1748)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1748)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1748 : bv8 :: ~sign_extend~32~8(v_subst_1748)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1748)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_165 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_165) && !(~sign_extend~32~8(v_subst_165) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1257 : bv8, v_subst_1258 : bv8, v_subst_1259 : bv8 :: (((~sign_extend~32~8(v_subst_1259)[7:0] == ~send1~0 && ~sign_extend~32~8(v_subst_1259) == ~sign_extend~32~8(v_subst_1257)) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1258)) && ~bvsge~32(~sign_extend~32~8(v_subst_1257), 0bv32)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1258)[7:0]), ~sign_extend~32~8(v_subst_1257))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send3~0 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0) && ~send1~0 == ~sign_extend~32~8(~send3~0)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_163 : bv8, v_subst_164 : bv8 :: ((!(~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(~id1~0)) && ~bvsge~32(~sign_extend~32~8(v_subst_163), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_164)[7:0]) && ~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(v_subst_164)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_100 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_100) && ~bvsge~32(~sign_extend~32~8(v_subst_100), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1668 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1668)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1668)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2085 : bv8, v_~send1~0_35 : bv8 :: ((~sign_extend~32~8(v_subst_2085) == ~sign_extend~32~8(v_~send1~0_35) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_35)[7:0]), ~sign_extend~32~8(~id2~0))) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2085))) && ~sign_extend~32~8(v_~send1~0_35)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2086 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2086) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2086)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2083 : bv8 :: ~send1~0 == ~sign_extend~32~8(v_subst_2083)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2083)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_479 : bv8 :: !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_479)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_479)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1551 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1551) && ~sign_extend~32~8(v_subst_1551)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1789 : bv8 :: ~sign_extend~32~8(v_subst_1789)[7:0] == ~p2_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1789)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_2552 : bv8 :: (!~bvsge~32(~sign_extend~32~8(v_subst_2552), 0bv32) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2552))) || (forall ~id3~0 : bv8, ~send2~0 : bv8, ~send3~0 : bv8 :: ((((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~id1~0) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0]), ~sign_extend~32~8(~id3~0))) || ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2552)) || !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0))) || !(~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2552))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1792 : bv8 :: ~sign_extend~32~8(v_subst_1792)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1792)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1790 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1790)[7:0])[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1790)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1791 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1791) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1791)[7:0])[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1788 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1788)[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1788)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1718 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1718)[7:0])[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1718)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1715 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1715) && ~p3_old~0 == ~sign_extend~32~8(v_subst_1715)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1714 : bv8 :: ~send2~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1714)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1714)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1716 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1716) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1716)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1717 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1717) && ~send1~0 == ~sign_extend~32~8(v_subst_1717)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2236 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2236) && ~p1_old~0 == ~sign_extend~32~8(v_subst_2236)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1756 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1756) && ~sign_extend~32~8(v_subst_1756)[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2237 : bv8, v_subst_2238 : bv8 :: (~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2238) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2238)[7:0]), ~sign_extend~32~8(v_subst_2237))) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2237)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2235 : bv8, v_subst_2234 : bv8, v_subst_2233 : bv8 :: ((~sign_extend~32~8(v_subst_2234) == ~sign_extend~32~8(~id1~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2235)[7:0])[7:0]) && ~sign_extend~32~8(v_subst_2233) == ~sign_extend~32~8(v_subst_2235)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_2235)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_185 : bv8, v_subst_184 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_184), 0bv32) && ~sign_extend~32~8(v_subst_185) == ~sign_extend~32~8(v_subst_184)) && ~sign_extend~32~8(v_subst_185)[7:0] == ~send3~0) && !(~sign_extend~32~8(v_subst_184) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1592 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1592) && ~send3~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1592)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1591 : bv8 :: ~sign_extend~32~8(v_subst_1591)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1591) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_386 : bv8 :: !(~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~id3~0)) && ~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_173 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_173) && ~bvsge~32(~sign_extend~32~8(v_subst_173), 0bv32)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && !(~sign_extend~32~8(v_subst_173) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1867 : bv8, v_subst_1868 : bv8, ~send3~0 : bv8 :: (((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0) && ~sign_extend~32~8(v_subst_1867) == ~sign_extend~32~8(v_subst_1868)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_1868)[7:0]) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(v_subst_1867))) && ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1868)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1566 : bv8 :: ~sign_extend~32~8(v_subst_1566) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_1566)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_174 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_174)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_174)) && ~bvsge~32(~sign_extend~32~8(v_subst_174), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_409 : bv8, v_subst_408 : bv8 :: ((~sign_extend~32~8(v_subst_408) == ~sign_extend~32~8(v_subst_409) && ~send2~0 == ~sign_extend~32~8(v_subst_409)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_408))) && ~bvsge~32(~sign_extend~32~8(v_subst_408), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_35 : bv8 :: !(~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~id2~0)) && ~sign_extend~32~8(v_subst_35) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_763 : bv8, v_subst_762 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_762), 0bv32) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_763)[7:0]), ~sign_extend~32~8(v_subst_762))) && ~sign_extend~32~8(v_subst_763)[7:0] == ~send3~0) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_763)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_758 : bv8, v_subst_759 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_758), 0bv32) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_759)[7:0]), ~sign_extend~32~8(v_subst_758))) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_759)[7:0])[7:0]) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_759)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2003 : bv8 :: ~sign_extend~32~8(~send1~0) == ~sign_extend~32~8(v_subst_2003) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2003))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2291 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2291) && ~bvsge~32(~sign_extend~32~8(v_subst_2291), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_385 : bv8, v_subst_384 : bv8 :: ((~sign_extend~32~8(v_subst_385)[7:0] == ~send2~0 && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_384))) && ~bvsge~32(~sign_extend~32~8(v_subst_384), 0bv32)) && ~sign_extend~32~8(v_subst_385) == ~sign_extend~32~8(v_subst_384)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1592 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1592) && ~send3~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1592)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1832 : bv8, ~send3~0 : bv8 :: (!~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(v_subst_1832)) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) && ~sign_extend~32~8(v_subst_1832) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1591 : bv8 :: ~sign_extend~32~8(v_subst_1591)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1591) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_386 : bv8 :: !(~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~id3~0)) && ~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_101 : bv8, v_subst_102 : bv8 :: (~send3~0 == ~sign_extend~32~8(v_subst_102)[7:0] && ~sign_extend~32~8(v_subst_101) == ~sign_extend~32~8(v_subst_102)) && ~bvsge~32(~sign_extend~32~8(v_subst_101), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1775 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1775) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1775)[7:0])[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_2552 : bv8 :: (!~bvsge~32(~sign_extend~32~8(v_subst_2552), 0bv32) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0]), ~sign_extend~32~8(v_subst_2552))) || (forall ~id3~0 : bv8, ~send2~0 : bv8, ~send3~0 : bv8 :: ((((~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~id1~0) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0]), ~sign_extend~32~8(~id3~0))) || ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2552)) || !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0))) || !(~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_2552))) || ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1774 : bv8 :: ~send3~0 == ~sign_extend~32~8(v_subst_1774)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1774)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_163 : bv8, v_subst_164 : bv8 :: ((!(~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(~id1~0)) && ~bvsge~32(~sign_extend~32~8(v_subst_163), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_164)[7:0]) && ~sign_extend~32~8(v_subst_163) == ~sign_extend~32~8(v_subst_164)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_385 : bv8, v_subst_384 : bv8 :: ((~sign_extend~32~8(v_subst_385)[7:0] == ~send2~0 && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_384))) && ~bvsge~32(~sign_extend~32~8(v_subst_384), 0bv32)) && ~sign_extend~32~8(v_subst_385) == ~sign_extend~32~8(v_subst_384)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1592 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1592) && ~send3~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1592)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1591 : bv8 :: ~sign_extend~32~8(v_subst_1591)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_1591) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_386 : bv8 :: !(~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~id3~0)) && ~sign_extend~32~8(v_subst_386) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_101 : bv8, v_subst_102 : bv8 :: (~send3~0 == ~sign_extend~32~8(v_subst_102)[7:0] && ~sign_extend~32~8(v_subst_101) == ~sign_extend~32~8(v_subst_102)) && ~bvsge~32(~sign_extend~32~8(v_subst_101), 0bv32)) could not be translated * 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 - PositiveResult [Line: 280]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 840.0s, OverallIterations: 39, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 461.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 310.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28837 SdHoareTripleChecker+Valid, 69.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28837 mSDsluCounter, 41138 SdHoareTripleChecker+Invalid, 65.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37341 mSDsCounter, 1495 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39295 IncrementalHoareTripleChecker+Invalid, 40790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1495 mSolverCounterUnsat, 3797 mSDtfsCounter, 39295 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8679 GetRequests, 6044 SyntacticMatches, 1 SemanticMatches, 2634 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174384 ImplicationChecksByTransitivity, 396.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34285occurred in iteration=27, InterpolantAutomatonStates: 2138, 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, 39 MinimizatonAttempts, 34548 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 78 NumberOfFragments, 4671 HoareAnnotationTreeSize, 1 FormulaSimplifications, 1158646 FormulaSimplificationTreeSizeReduction, 112.5s HoareSimplificationTime, 1 FormulaSimplificationsInter, 399671 FormulaSimplificationTreeSizeReductionInter, 198.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 45.9s InterpolantComputationTime, 3782 NumberOfCodeBlocks, 3606 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 6724 ConstructedInterpolants, 1389 QuantifiedInterpolants, 87535 SizeOfPredicates, 212 NumberOfNonLiveVariables, 7509 ConjunctsInSsa, 469 ConjunctsInUnsatCore, 64 InterpolantComputations, 14 PerfectInterpolantSequences, 7956/12141 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((!((((p3_old & 127) & 127) > id3)) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && (1 == r1)) && !(((send3 & 127) > id1))) && ((send1 & 127) == send2)) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && (((send1 & 127) & 127) > id3)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && (2 == i2)) || ((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (id1 == send1)) && (st2 == 0)) && ((p1_old > id2) || (p2_old > id3))) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (5 == i2)) && (1 == mode1)) && (1 == mode2)) && (r1 == (((1 + 1) % 4294967296) & 127))) && (id3 >= 0)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0))) || ((((((((((((((((((((r1 == ((((((1 + 1) % 4294967296) & 127) + 1) % 4294967296) & 127)) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && !(((p2_old & 127) > id1))) && (id3 == send3)) && (st2 == 0)) && (6 == i2)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) && (1 == st3)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1))) || (((((((((((((((((((((((mode3 == 0) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && !(((p3_old & 127) > id2))) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (send1 == (send3 & 127))) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && !((id3 == (send2 & 127)))) && !((p3_old > id1))) && !(((send2 & 127) > id3))) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1)) && (2 == i2))) || ((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (3 == i2)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && ((send1 & 127) == send2)) && ((send2 & 127) == p2_old)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((((((((r1 == ((((((1 + 1) % 4294967296) & 127) + 1) % 4294967296) & 127)) && !((((p3_old & 127) & 127) > id3))) && (mode3 == 0)) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (1 == st2)) && (((send2 & 127) > id3) || !(((p3_old & 127) > id2)))) && (6 == i2)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && !((p3_old > id1))) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || (((((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (4 == i2)) && (mode2 == 0)) && (st3 == 0)) && (((send1 & 127) > id2) || ((send2 & 127) > id3))) && !(((p2_old & 127) > id1))) && (id3 == send3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (r1 == (((1 + 1) % 4294967296) & 127))) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1))) || ((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (1 == i2)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (p1_old == (send1 & 127))) && (1 == mode1)) && (p3_old == (send3 & 127))) && (r1 == 0)) && (1 == mode2)) && ((send2 & 127) == p2_old)) && (id3 >= 0)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0))) || ((((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (3 == i2)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && ((send2 & 127) == send3)) && ((send2 & 127) == p2_old)) && (id3 >= 0)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || ((((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (3 == i2)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (send1 == (send3 & 127))) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && !(((send2 & 127) > id3))) && ((send2 & 127) == p2_old)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || ((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (id3 == send3)) && !(((p3_old & 127) > id2))) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1)) && (2 == i2))) || (((((((((((!(((p2_old & 127) > id1)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && ((((((((((((!((((p3_old & 127) & 127) > id3)) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (id1 == send1)) && (st2 == 0)) && !(((p1_old & 127) > id3))) && (1 == r1)) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) || ((((((((((!((((p3_old & 127) & 127) > id3)) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (st2 == 0)) && !(((p1_old & 127) > id3))) && (1 == r1)) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))))) && ((send2 & 127) == send3)) && (id3 >= 0)) && !((p2_old > id3))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1)) && (2 == i2))) || ((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (3 == i2)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && ((send2 & 127) == p2_old)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || ((((((((((((((((((((!((((p3_old & 127) & 127) > id3)) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (id3 == send3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && (1 == r1)) && !(((send3 & 127) > id1))) && ((send1 & 127) == send2)) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && (2 == i2))) || (((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (5 == i2)) && (1 == mode1)) && (1 == mode2)) && (r1 == (((1 + 1) % 4294967296) & 127))) && ((send2 & 127) == p2_old)) && (id3 >= 0)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && ((p1_old > id2) || (p2_old > id3))) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (5 == i2)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && (r1 == (((1 + 1) % 4294967296) & 127))) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || (((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (3 == i2)) && (id1 == send1)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && (1 == mode2)) && ((send2 & 127) == send3)) && ((send2 & 127) == p2_old)) && (id3 >= 0)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((((((!((((p3_old & 127) & 127) > id3)) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (4 == i2)) && (mode2 == 0)) && (st3 == 0)) && (((send1 & 127) > id2) || ((send2 & 127) > id3))) && !(((p2_old & 127) > id1))) && (id1 == send1)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && !((p3_old > id1))) && (r1 == (((1 + 1) % 4294967296) & 127))) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || ((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (3 == i2)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && !(((send3 & 127) > id1))) && (1 == mode2)) && ((send1 & 127) == send2)) && ((send2 & 127) == p2_old)) && (id3 >= 0)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((((((((((!((((p3_old & 127) & 127) > id3)) && (mode3 == 0)) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (id1 == send1)) && (id3 == send3)) && (((send2 & 127) > id3) || !(((p3_old & 127) > id2)))) && (st2 == 0)) && (0 == i2)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && !((p3_old > id1))) && (r1 == 0)) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && !((id2 == id1))) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || (((((((((((((((((((r1 == ((((((1 + 1) % 4294967296) & 127) + 1) % 4294967296) & 127)) && !((((p3_old & 127) & 127) > id3))) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (st2 == 0)) && (6 == i2)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && ((send1 & 127) == send2)) && (id3 >= 0)) && !((p2_old > id3))) && (((1 + nomsg) % 256) == 0)) && (1 == st1)) && !((p1_old > id2)))) || ((((((((((((((((((((((!((((p3_old & 127) & 127) > id3)) && (mode3 == 0)) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (4 == i2)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (((send2 & 127) > id3) || !(((p3_old & 127) > id2)))) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && !((p3_old > id1))) && (r1 == (((1 + 1) % 4294967296) & 127))) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || (((((((((((((((((((r1 == ((((((1 + 1) % 4294967296) & 127) + 1) % 4294967296) & 127)) && (mode3 == 0)) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (((send3 & 127) & 127) > id2)) && !(((p2_old & 127) > id1))) && (id1 == send1)) && (st2 == 0)) && (6 == i2)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && !(((send2 & 127) > id3))) && (((1 + nomsg) % 256) == 0)) && (1 == st1)) && !((p1_old > id2)))) RESULT: Ultimate proved your program to be correct! [2023-12-25 07:53:16,328 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 07:53:16,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...