/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/systemc/toy.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:19:44,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:19:44,320 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:19:44,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:19:44,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:19:44,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:19:44,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:19:44,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:19:44,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:19:44,338 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:19:44,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:19:44,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:19:44,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:19:44,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:19:44,340 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:19:44,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:19:44,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:19:44,341 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:19:44,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:19:44,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:19:44,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:19:44,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:19:44,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:19:44,342 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:19:44,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:19:44,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:19:44,343 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:19:44,343 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:19:44,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:19:44,344 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:19:44,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:19:44,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:19:44,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:19:44,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:19:44,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:19:44,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:19:44,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:19:44,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:19:44,346 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:19:44,346 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:19:44,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:19:44,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:19:44,346 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:19:44,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:19:44,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:19:44,347 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:19:44,347 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:19:44,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:19:44,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:19:44,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:19:44,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:19:44,546 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:19:44,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy.cil.c [2023-12-25 07:19:45,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:19:45,674 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:19:45,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy.cil.c [2023-12-25 07:19:45,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1332535cf/58f69d50bb5c40f0972061046f918db8/FLAGa366eed52 [2023-12-25 07:19:45,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1332535cf/58f69d50bb5c40f0972061046f918db8 [2023-12-25 07:19:45,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:19:45,699 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:19:45,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:19:45,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:19:45,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:19:45,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:45,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dfe8507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45, skipping insertion in model container [2023-12-25 07:19:45,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:45,738 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:19:45,862 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy.cil.c[697,710] [2023-12-25 07:19:45,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:19:45,916 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:19:45,924 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy.cil.c[697,710] [2023-12-25 07:19:45,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:19:45,966 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:19:45,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45 WrapperNode [2023-12-25 07:19:45,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:19:45,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:19:45,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:19:45,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:19:45,972 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:19:45" (1/1) ... [2023-12-25 07:19:45,980 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:19:45" (1/1) ... [2023-12-25 07:19:46,004 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 361 [2023-12-25 07:19:46,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:19:46,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:19:46,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:19:46,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:19:46,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,025 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:19:46,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:19:46,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:19:46,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:19:46,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:19:46,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (1/1) ... [2023-12-25 07:19:46,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:19:46,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:19:46,079 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:19:46,097 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:19:46,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:19:46,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:19:46,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:19:46,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:19:46,197 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:19:46,201 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:19:46,662 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:19:46,700 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:19:46,700 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-25 07:19:46,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:19:46 BoogieIcfgContainer [2023-12-25 07:19:46,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:19:46,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:19:46,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:19:46,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:19:46,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:19:45" (1/3) ... [2023-12-25 07:19:46,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799d2f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:19:46, skipping insertion in model container [2023-12-25 07:19:46,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:19:45" (2/3) ... [2023-12-25 07:19:46,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799d2f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:19:46, skipping insertion in model container [2023-12-25 07:19:46,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:19:46" (3/3) ... [2023-12-25 07:19:46,706 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2023-12-25 07:19:46,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:19:46,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:19:46,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:19:46,757 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;@2944dceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:19:46,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:19:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 118 states have (on average 1.923728813559322) internal successors, (227), 119 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have 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:19:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:46,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:46,769 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:19:46,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:46,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 429979365, now seen corresponding path program 1 times [2023-12-25 07:19:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256843123] [2023-12-25 07:19:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:46,785 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:19:46,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:46,787 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:19:46,791 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:19:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:46,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:19:46,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:46,931 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:19:46,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:46,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256843123] [2023-12-25 07:19:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256843123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:46,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:46,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:46,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138150662] [2023-12-25 07:19:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:46,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:19:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:46,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:19:46,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:19:46,976 INFO L87 Difference]: Start difference. First operand has 120 states, 118 states have (on average 1.923728813559322) internal successors, (227), 119 states have internal predecessors, (227), 0 states have call successors, (0), 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 4 states, 4 states have (on average 8.25) 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:19:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:47,098 INFO L93 Difference]: Finished difference Result 345 states and 655 transitions. [2023-12-25 07:19:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:19:47,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) 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:19:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:47,108 INFO L225 Difference]: With dead ends: 345 [2023-12-25 07:19:47,108 INFO L226 Difference]: Without dead ends: 229 [2023-12-25 07:19:47,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:19:47,112 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 612 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:47,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 400 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:19:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-25 07:19:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 119. [2023-12-25 07:19:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.805084745762712) internal successors, (213), 118 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have 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:19:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 213 transitions. [2023-12-25 07:19:47,153 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 213 transitions. Word has length 33 [2023-12-25 07:19:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:47,153 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 213 transitions. [2023-12-25 07:19:47,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) 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:19:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 213 transitions. [2023-12-25 07:19:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:47,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:47,155 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:19:47,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 07:19:47,355 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:19:47,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:47,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash -79493725, now seen corresponding path program 1 times [2023-12-25 07:19:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116397058] [2023-12-25 07:19:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:47,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:19:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:47,361 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:19:47,369 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:19:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:47,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:19:47,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:47,445 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:19:47,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:47,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116397058] [2023-12-25 07:19:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116397058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566960322] [2023-12-25 07:19:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:47,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:47,448 INFO L87 Difference]: Start difference. First operand 119 states and 213 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:47,471 INFO L93 Difference]: Finished difference Result 229 states and 411 transitions. [2023-12-25 07:19:47,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:47,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:47,472 INFO L225 Difference]: With dead ends: 229 [2023-12-25 07:19:47,472 INFO L226 Difference]: Without dead ends: 118 [2023-12-25 07:19:47,473 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:19:47,474 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:47,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-25 07:19:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-25 07:19:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.8034188034188035) internal successors, (211), 117 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 211 transitions. [2023-12-25 07:19:47,482 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 211 transitions. Word has length 33 [2023-12-25 07:19:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:47,482 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 211 transitions. [2023-12-25 07:19:47,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 211 transitions. [2023-12-25 07:19:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:47,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:47,483 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:19:47,500 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:19:47,688 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:19:47,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:47,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash -956224029, now seen corresponding path program 1 times [2023-12-25 07:19:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:47,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633086132] [2023-12-25 07:19:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:47,690 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:19:47,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:47,692 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:19:47,694 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:19:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:47,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:47,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:47,788 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:19:47,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:47,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:47,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633086132] [2023-12-25 07:19:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633086132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:47,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:47,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107383794] [2023-12-25 07:19:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:47,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:47,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:47,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:47,797 INFO L87 Difference]: Start difference. First operand 118 states and 211 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:47,820 INFO L93 Difference]: Finished difference Result 227 states and 407 transitions. [2023-12-25 07:19:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:47,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:47,822 INFO L225 Difference]: With dead ends: 227 [2023-12-25 07:19:47,823 INFO L226 Difference]: Without dead ends: 118 [2023-12-25 07:19:47,825 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:19:47,828 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 204 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:47,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 200 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-25 07:19:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-25 07:19:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.794871794871795) internal successors, (210), 117 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 210 transitions. [2023-12-25 07:19:47,852 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 210 transitions. Word has length 33 [2023-12-25 07:19:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:47,852 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 210 transitions. [2023-12-25 07:19:47,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 210 transitions. [2023-12-25 07:19:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:47,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:47,854 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:19:47,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 07:19:48,054 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:19:48,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:48,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash 967004005, now seen corresponding path program 1 times [2023-12-25 07:19:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459348599] [2023-12-25 07:19:48,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:48,059 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:19:48,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:48,072 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:19:48,095 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:19:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:48,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:19:48,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:48,173 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:19:48,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:48,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459348599] [2023-12-25 07:19:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459348599] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:48,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:48,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338375689] [2023-12-25 07:19:48,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:48,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:48,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:48,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:48,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:48,175 INFO L87 Difference]: Start difference. First operand 118 states and 210 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:48,211 INFO L93 Difference]: Finished difference Result 226 states and 404 transitions. [2023-12-25 07:19:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:48,212 INFO L225 Difference]: With dead ends: 226 [2023-12-25 07:19:48,213 INFO L226 Difference]: Without dead ends: 118 [2023-12-25 07:19:48,216 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:19:48,219 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 185 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:48,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-25 07:19:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-25 07:19:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 117 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 202 transitions. [2023-12-25 07:19:48,234 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 202 transitions. Word has length 33 [2023-12-25 07:19:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:48,234 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 202 transitions. [2023-12-25 07:19:48,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 202 transitions. [2023-12-25 07:19:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:48,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:48,235 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:19:48,243 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:19:48,443 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:19:48,443 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:48,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash 17926369, now seen corresponding path program 1 times [2023-12-25 07:19:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136021946] [2023-12-25 07:19:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:48,444 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:19:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:48,451 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:19:48,452 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:19:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:48,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:19:48,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:48,505 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:19:48,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:48,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:48,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136021946] [2023-12-25 07:19:48,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136021946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:48,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:48,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:48,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437682130] [2023-12-25 07:19:48,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:48,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:48,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:48,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:48,508 INFO L87 Difference]: Start difference. First operand 118 states and 202 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:48,538 INFO L93 Difference]: Finished difference Result 225 states and 387 transitions. [2023-12-25 07:19:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:48,540 INFO L225 Difference]: With dead ends: 225 [2023-12-25 07:19:48,540 INFO L226 Difference]: Without dead ends: 118 [2023-12-25 07:19:48,540 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:19:48,541 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 176 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:48,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 185 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-25 07:19:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-25 07:19:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.6752136752136753) internal successors, (196), 117 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:19:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 196 transitions. [2023-12-25 07:19:48,548 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 196 transitions. Word has length 33 [2023-12-25 07:19:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:48,548 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 196 transitions. [2023-12-25 07:19:48,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 196 transitions. [2023-12-25 07:19:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:48,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:48,549 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:19:48,563 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:19:48,751 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:19:48,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:48,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -428331035, now seen corresponding path program 1 times [2023-12-25 07:19:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936033059] [2023-12-25 07:19:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:48,753 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:19:48,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:48,754 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:19:48,756 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:19:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:48,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:19:48,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:48,814 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:19:48,815 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:48,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936033059] [2023-12-25 07:19:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936033059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:48,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:48,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285982974] [2023-12-25 07:19:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:48,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:48,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:48,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:48,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:48,836 INFO L87 Difference]: Start difference. First operand 118 states and 196 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:48,867 INFO L93 Difference]: Finished difference Result 224 states and 374 transitions. [2023-12-25 07:19:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:48,868 INFO L225 Difference]: With dead ends: 224 [2023-12-25 07:19:48,868 INFO L226 Difference]: Without dead ends: 118 [2023-12-25 07:19:48,868 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:19:48,871 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 171 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:48,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 181 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-25 07:19:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-25 07:19:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.623931623931624) internal successors, (190), 117 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:19:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 190 transitions. [2023-12-25 07:19:48,880 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 190 transitions. Word has length 33 [2023-12-25 07:19:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:48,880 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 190 transitions. [2023-12-25 07:19:48,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 190 transitions. [2023-12-25 07:19:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:48,883 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:48,883 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:19:48,888 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:19:49,085 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:19:49,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:49,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1842208219, now seen corresponding path program 1 times [2023-12-25 07:19:49,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:49,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255318586] [2023-12-25 07:19:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:49,087 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:19:49,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:49,088 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:19:49,111 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:19:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:49,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:19:49,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:49,142 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:19:49,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:49,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255318586] [2023-12-25 07:19:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255318586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:49,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:49,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328202280] [2023-12-25 07:19:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:49,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:49,144 INFO L87 Difference]: Start difference. First operand 118 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:49,187 INFO L93 Difference]: Finished difference Result 338 states and 546 transitions. [2023-12-25 07:19:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:49,189 INFO L225 Difference]: With dead ends: 338 [2023-12-25 07:19:49,189 INFO L226 Difference]: Without dead ends: 233 [2023-12-25 07:19:49,189 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:19:49,190 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 172 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:49,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 340 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-25 07:19:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2023-12-25 07:19:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.6) internal successors, (368), 230 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have 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:19:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 368 transitions. [2023-12-25 07:19:49,199 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 368 transitions. Word has length 33 [2023-12-25 07:19:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:49,199 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 368 transitions. [2023-12-25 07:19:49,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 368 transitions. [2023-12-25 07:19:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:49,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:49,205 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:19:49,209 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:19:49,407 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:19:49,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:49,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash -115582173, now seen corresponding path program 1 times [2023-12-25 07:19:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922196371] [2023-12-25 07:19:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:49,409 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:19:49,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:49,410 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:19:49,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 07:19:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:49,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:49,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:49,476 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:19:49,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:49,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922196371] [2023-12-25 07:19:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922196371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758185857] [2023-12-25 07:19:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:49,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:49,478 INFO L87 Difference]: Start difference. First operand 231 states and 368 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:49,536 INFO L93 Difference]: Finished difference Result 611 states and 984 transitions. [2023-12-25 07:19:49,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:49,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:49,538 INFO L225 Difference]: With dead ends: 611 [2023-12-25 07:19:49,538 INFO L226 Difference]: Without dead ends: 405 [2023-12-25 07:19:49,539 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:19:49,540 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 171 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:49,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 299 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-12-25 07:19:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 401. [2023-12-25 07:19:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.5875) internal successors, (635), 400 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have 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:19:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 635 transitions. [2023-12-25 07:19:49,561 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 635 transitions. Word has length 33 [2023-12-25 07:19:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:49,562 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 635 transitions. [2023-12-25 07:19:49,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 635 transitions. [2023-12-25 07:19:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:19:49,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:49,563 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:19:49,569 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:19:49,765 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:19:49,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:49,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash 804337123, now seen corresponding path program 1 times [2023-12-25 07:19:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831584284] [2023-12-25 07:19:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:49,767 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:19:49,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:49,768 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:19:49,768 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:19:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:49,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:49,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:49,844 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:19:49,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:49,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:49,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831584284] [2023-12-25 07:19:49,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831584284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:49,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:49,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424597864] [2023-12-25 07:19:49,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:49,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:49,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:49,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:49,846 INFO L87 Difference]: Start difference. First operand 401 states and 635 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:49,899 INFO L93 Difference]: Finished difference Result 913 states and 1455 transitions. [2023-12-25 07:19:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:49,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:49,901 INFO L225 Difference]: With dead ends: 913 [2023-12-25 07:19:49,901 INFO L226 Difference]: Without dead ends: 539 [2023-12-25 07:19:49,902 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:19:49,902 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:49,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 288 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2023-12-25 07:19:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2023-12-25 07:19:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.5708955223880596) internal successors, (842), 536 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have 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:19:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 842 transitions. [2023-12-25 07:19:49,923 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 842 transitions. Word has length 33 [2023-12-25 07:19:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:49,923 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 842 transitions. [2023-12-25 07:19:49,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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:19:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 842 transitions. [2023-12-25 07:19:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 07:19:49,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:49,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:19:49,932 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:19:50,126 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:19:50,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:50,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2120894212, now seen corresponding path program 1 times [2023-12-25 07:19:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:50,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411752427] [2023-12-25 07:19:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:50,127 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:19:50,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:50,128 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:19:50,132 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:19:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:50,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:50,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:19:50,196 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:50,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411752427] [2023-12-25 07:19:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411752427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:50,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356325719] [2023-12-25 07:19:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:50,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:50,197 INFO L87 Difference]: Start difference. First operand 537 states and 842 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:19:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:50,247 INFO L93 Difference]: Finished difference Result 1295 states and 2056 transitions. [2023-12-25 07:19:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2023-12-25 07:19:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:50,251 INFO L225 Difference]: With dead ends: 1295 [2023-12-25 07:19:50,251 INFO L226 Difference]: Without dead ends: 811 [2023-12-25 07:19:50,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:19:50,252 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 82 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:50,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 382 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-12-25 07:19:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2023-12-25 07:19:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.573019801980198) internal successors, (1271), 808 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have 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:19:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1271 transitions. [2023-12-25 07:19:50,285 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1271 transitions. Word has length 44 [2023-12-25 07:19:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:50,286 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1271 transitions. [2023-12-25 07:19:50,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:19:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1271 transitions. [2023-12-25 07:19:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 07:19:50,287 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:50,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:19:50,294 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:19:50,489 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:19:50,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:50,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1697247490, now seen corresponding path program 1 times [2023-12-25 07:19:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364512419] [2023-12-25 07:19:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:50,491 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:19:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:50,492 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:19:50,493 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:19:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:50,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:19:50,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:19:50,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:50,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364512419] [2023-12-25 07:19:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364512419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:50,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:50,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:50,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134171254] [2023-12-25 07:19:50,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:50,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:19:50,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:19:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:19:50,541 INFO L87 Difference]: Start difference. First operand 809 states and 1271 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:50,628 INFO L93 Difference]: Finished difference Result 2313 states and 3661 transitions. [2023-12-25 07:19:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:19:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-25 07:19:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:50,633 INFO L225 Difference]: With dead ends: 2313 [2023-12-25 07:19:50,633 INFO L226 Difference]: Without dead ends: 1561 [2023-12-25 07:19:50,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:19:50,635 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 466 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:50,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 393 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2023-12-25 07:19:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 809. [2023-12-25 07:19:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.5705445544554455) internal successors, (1269), 808 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have 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:19:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1269 transitions. [2023-12-25 07:19:50,675 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1269 transitions. Word has length 44 [2023-12-25 07:19:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:50,675 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1269 transitions. [2023-12-25 07:19:50,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1269 transitions. [2023-12-25 07:19:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 07:19:50,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:50,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:19:50,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 07:19:50,879 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:19:50,879 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:50,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash 752352640, now seen corresponding path program 1 times [2023-12-25 07:19:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819649854] [2023-12-25 07:19:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:50,880 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:19:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:50,882 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:19:50,882 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:19:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:50,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:19:50,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:19:50,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:50,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819649854] [2023-12-25 07:19:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819649854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:50,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130193843] [2023-12-25 07:19:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:50,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:50,926 INFO L87 Difference]: Start difference. First operand 809 states and 1269 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:50,969 INFO L93 Difference]: Finished difference Result 1521 states and 2415 transitions. [2023-12-25 07:19:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-12-25 07:19:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:50,972 INFO L225 Difference]: With dead ends: 1521 [2023-12-25 07:19:50,972 INFO L226 Difference]: Without dead ends: 765 [2023-12-25 07:19:50,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:19:50,974 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:50,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 172 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-12-25 07:19:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2023-12-25 07:19:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 1.5890052356020943) internal successors, (1214), 764 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have 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:19:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1214 transitions. [2023-12-25 07:19:51,010 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1214 transitions. Word has length 44 [2023-12-25 07:19:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:51,011 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1214 transitions. [2023-12-25 07:19:51,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1214 transitions. [2023-12-25 07:19:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 07:19:51,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:51,012 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:19:51,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 07:19:51,214 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:19:51,214 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:51,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1821048159, now seen corresponding path program 1 times [2023-12-25 07:19:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379149751] [2023-12-25 07:19:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:19:51,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:51,217 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:19:51,220 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:19:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:51,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:51,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:19:51,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:51,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379149751] [2023-12-25 07:19:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379149751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:51,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:51,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957656205] [2023-12-25 07:19:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:51,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:51,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:51,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:51,285 INFO L87 Difference]: Start difference. First operand 765 states and 1214 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:19:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:51,360 INFO L93 Difference]: Finished difference Result 1883 states and 3039 transitions. [2023-12-25 07:19:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:51,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2023-12-25 07:19:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:51,364 INFO L225 Difference]: With dead ends: 1883 [2023-12-25 07:19:51,364 INFO L226 Difference]: Without dead ends: 1171 [2023-12-25 07:19:51,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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:19:51,366 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 83 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:51,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 298 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2023-12-25 07:19:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1169. [2023-12-25 07:19:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.6044520547945205) internal successors, (1874), 1168 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have 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:19:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1874 transitions. [2023-12-25 07:19:51,441 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1874 transitions. Word has length 45 [2023-12-25 07:19:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:51,441 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1874 transitions. [2023-12-25 07:19:51,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:19:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1874 transitions. [2023-12-25 07:19:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 07:19:51,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:51,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:19:51,447 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:19:51,647 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:19:51,648 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:51,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash -792218992, now seen corresponding path program 1 times [2023-12-25 07:19:51,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:51,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673962523] [2023-12-25 07:19:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:51,649 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:19:51,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:51,650 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:19:51,678 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:19:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:51,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:51,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:19:51,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:51,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673962523] [2023-12-25 07:19:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673962523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721669119] [2023-12-25 07:19:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:51,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:51,719 INFO L87 Difference]: Start difference. First operand 1169 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:19:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:51,817 INFO L93 Difference]: Finished difference Result 3119 states and 5058 transitions. [2023-12-25 07:19:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2023-12-25 07:19:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:51,824 INFO L225 Difference]: With dead ends: 3119 [2023-12-25 07:19:51,824 INFO L226 Difference]: Without dead ends: 2005 [2023-12-25 07:19:51,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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:19:51,826 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 88 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:51,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 359 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2023-12-25 07:19:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 2003. [2023-12-25 07:19:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2003 states, 2002 states have (on average 1.60989010989011) internal successors, (3223), 2002 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have 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:19:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 3223 transitions. [2023-12-25 07:19:51,947 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 3223 transitions. Word has length 46 [2023-12-25 07:19:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:51,947 INFO L495 AbstractCegarLoop]: Abstraction has 2003 states and 3223 transitions. [2023-12-25 07:19:51,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:19:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 3223 transitions. [2023-12-25 07:19:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 07:19:51,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:51,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:19:51,954 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:19:52,151 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:19:52,152 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:52,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash -368572270, now seen corresponding path program 1 times [2023-12-25 07:19:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479828997] [2023-12-25 07:19:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:52,153 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:19:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:52,154 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:19:52,168 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:19:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:52,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:52,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:19:52,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:52,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479828997] [2023-12-25 07:19:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479828997] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330922051] [2023-12-25 07:19:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:52,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:52,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:52,202 INFO L87 Difference]: Start difference. First operand 2003 states and 3223 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:52,271 INFO L93 Difference]: Finished difference Result 3909 states and 6325 transitions. [2023-12-25 07:19:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:52,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-25 07:19:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:52,278 INFO L225 Difference]: With dead ends: 3909 [2023-12-25 07:19:52,278 INFO L226 Difference]: Without dead ends: 1961 [2023-12-25 07:19:52,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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:19:52,282 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:52,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 171 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2023-12-25 07:19:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2023-12-25 07:19:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.6173469387755102) internal successors, (3170), 1960 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have 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:19:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3170 transitions. [2023-12-25 07:19:52,373 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3170 transitions. Word has length 46 [2023-12-25 07:19:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:52,373 INFO L495 AbstractCegarLoop]: Abstraction has 1961 states and 3170 transitions. [2023-12-25 07:19:52,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:19:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3170 transitions. [2023-12-25 07:19:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 07:19:52,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:52,375 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 07:19:52,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 07:19:52,577 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:19:52,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:52,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 77319437, now seen corresponding path program 1 times [2023-12-25 07:19:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:52,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822914469] [2023-12-25 07:19:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:52,579 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:19:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:52,580 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:19:52,581 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:19:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:52,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:52,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:19:52,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:52,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:52,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822914469] [2023-12-25 07:19:52,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822914469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:52,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:52,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689733851] [2023-12-25 07:19:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:52,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:52,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:52,635 INFO L87 Difference]: Start difference. First operand 1961 states and 3170 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:19:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:52,779 INFO L93 Difference]: Finished difference Result 5355 states and 8630 transitions. [2023-12-25 07:19:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-12-25 07:19:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:52,788 INFO L225 Difference]: With dead ends: 5355 [2023-12-25 07:19:52,788 INFO L226 Difference]: Without dead ends: 2945 [2023-12-25 07:19:52,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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:19:52,792 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 134 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:52,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 452 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2023-12-25 07:19:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2023-12-25 07:19:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2944 states have (on average 1.596467391304348) internal successors, (4700), 2944 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states have 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:19:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4700 transitions. [2023-12-25 07:19:52,917 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4700 transitions. Word has length 47 [2023-12-25 07:19:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:52,917 INFO L495 AbstractCegarLoop]: Abstraction has 2945 states and 4700 transitions. [2023-12-25 07:19:52,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:19:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4700 transitions. [2023-12-25 07:19:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 07:19:52,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:52,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:19:52,924 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:19:53,122 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:19:53,122 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:53,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1283803363, now seen corresponding path program 1 times [2023-12-25 07:19:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790510603] [2023-12-25 07:19:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:53,123 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:19:53,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:53,124 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:19:53,153 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:19:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:53,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:53,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:19:53,193 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:53,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:53,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790510603] [2023-12-25 07:19:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790510603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:53,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:53,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:53,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101799282] [2023-12-25 07:19:53,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:53,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:53,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:53,195 INFO L87 Difference]: Start difference. First operand 2945 states and 4700 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:19:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:53,394 INFO L93 Difference]: Finished difference Result 8277 states and 13217 transitions. [2023-12-25 07:19:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:53,394 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:19:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:53,411 INFO L225 Difference]: With dead ends: 8277 [2023-12-25 07:19:53,411 INFO L226 Difference]: Without dead ends: 5377 [2023-12-25 07:19:53,415 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:19:53,416 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 123 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:53,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 317 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states. [2023-12-25 07:19:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 5375. [2023-12-25 07:19:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5375 states, 5374 states have (on average 1.5764793449944177) internal successors, (8472), 5374 states have internal predecessors, (8472), 0 states have call successors, (0), 0 states have 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:19:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5375 states to 5375 states and 8472 transitions. [2023-12-25 07:19:53,667 INFO L78 Accepts]: Start accepts. Automaton has 5375 states and 8472 transitions. Word has length 51 [2023-12-25 07:19:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:53,668 INFO L495 AbstractCegarLoop]: Abstraction has 5375 states and 8472 transitions. [2023-12-25 07:19:53,668 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:19:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5375 states and 8472 transitions. [2023-12-25 07:19:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 07:19:53,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:53,671 INFO L195 NwaCegarLoop]: trace histogram [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:19:53,684 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:19:53,873 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:19:53,874 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:53,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1000257788, now seen corresponding path program 1 times [2023-12-25 07:19:53,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:53,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456684772] [2023-12-25 07:19:53,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:53,875 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:19:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:53,876 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:19:53,905 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:19:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:53,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:53,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:19:53,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:53,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456684772] [2023-12-25 07:19:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456684772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:53,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:19:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383970435] [2023-12-25 07:19:53,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:53,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:53,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:53,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:53,926 INFO L87 Difference]: Start difference. First operand 5375 states and 8472 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 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:19:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:54,374 INFO L93 Difference]: Finished difference Result 15984 states and 25234 transitions. [2023-12-25 07:19:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 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 53 [2023-12-25 07:19:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:54,419 INFO L225 Difference]: With dead ends: 15984 [2023-12-25 07:19:54,420 INFO L226 Difference]: Without dead ends: 10611 [2023-12-25 07:19:54,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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:19:54,428 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 167 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:54,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 295 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10611 states. [2023-12-25 07:19:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10611 to 10609. [2023-12-25 07:19:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10609 states, 10608 states have (on average 1.5783371040723981) internal successors, (16743), 10608 states have internal predecessors, (16743), 0 states have call successors, (0), 0 states have 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:19:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10609 states to 10609 states and 16743 transitions. [2023-12-25 07:19:54,929 INFO L78 Accepts]: Start accepts. Automaton has 10609 states and 16743 transitions. Word has length 53 [2023-12-25 07:19:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:54,929 INFO L495 AbstractCegarLoop]: Abstraction has 10609 states and 16743 transitions. [2023-12-25 07:19:54,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 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:19:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 10609 states and 16743 transitions. [2023-12-25 07:19:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-25 07:19:54,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:54,938 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:54,943 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:19:55,141 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:19:55,142 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:55,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash -690807175, now seen corresponding path program 1 times [2023-12-25 07:19:55,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:55,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118232604] [2023-12-25 07:19:55,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:55,143 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:19:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:55,144 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:19:55,174 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:19:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:55,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:55,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:55,223 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:19:55,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:55,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:55,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118232604] [2023-12-25 07:19:55,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118232604] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:55,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:55,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966053685] [2023-12-25 07:19:55,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:55,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:55,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:55,226 INFO L87 Difference]: Start difference. First operand 10609 states and 16743 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:19:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:55,765 INFO L93 Difference]: Finished difference Result 21538 states and 33965 transitions. [2023-12-25 07:19:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:55,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2023-12-25 07:19:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:55,791 INFO L225 Difference]: With dead ends: 21538 [2023-12-25 07:19:55,792 INFO L226 Difference]: Without dead ends: 10956 [2023-12-25 07:19:55,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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:19:55,810 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 123 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:55,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 275 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2023-12-25 07:19:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 10940. [2023-12-25 07:19:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10940 states, 10939 states have (on average 1.5310357436694397) internal successors, (16748), 10939 states have internal predecessors, (16748), 0 states have call successors, (0), 0 states have 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:19:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10940 states to 10940 states and 16748 transitions. [2023-12-25 07:19:56,300 INFO L78 Accepts]: Start accepts. Automaton has 10940 states and 16748 transitions. Word has length 83 [2023-12-25 07:19:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:56,301 INFO L495 AbstractCegarLoop]: Abstraction has 10940 states and 16748 transitions. [2023-12-25 07:19:56,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:19:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 10940 states and 16748 transitions. [2023-12-25 07:19:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 07:19:56,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:56,313 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:56,332 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:19:56,516 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:19:56,516 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:56,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2010245170, now seen corresponding path program 1 times [2023-12-25 07:19:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008231856] [2023-12-25 07:19:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:56,517 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:19:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:56,518 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:19:56,523 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:19:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:56,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:56,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:56,588 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:19:56,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:56,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008231856] [2023-12-25 07:19:56,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008231856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:56,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:56,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778028255] [2023-12-25 07:19:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:56,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:56,589 INFO L87 Difference]: Start difference. First operand 10940 states and 16748 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:19:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:57,045 INFO L93 Difference]: Finished difference Result 22360 states and 34201 transitions. [2023-12-25 07:19:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2023-12-25 07:19:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:57,066 INFO L225 Difference]: With dead ends: 22360 [2023-12-25 07:19:57,066 INFO L226 Difference]: Without dead ends: 11458 [2023-12-25 07:19:57,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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:19:57,078 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 121 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:57,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 274 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2023-12-25 07:19:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 11434. [2023-12-25 07:19:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11434 states, 11433 states have (on average 1.4841249016006297) internal successors, (16968), 11433 states have internal predecessors, (16968), 0 states have call successors, (0), 0 states have 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:19:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11434 states to 11434 states and 16968 transitions. [2023-12-25 07:19:57,738 INFO L78 Accepts]: Start accepts. Automaton has 11434 states and 16968 transitions. Word has length 84 [2023-12-25 07:19:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:57,738 INFO L495 AbstractCegarLoop]: Abstraction has 11434 states and 16968 transitions. [2023-12-25 07:19:57,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have 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:19:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 11434 states and 16968 transitions. [2023-12-25 07:19:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-25 07:19:57,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:57,748 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-25 07:19:57,951 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:19:57,951 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:57,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1399303287, now seen corresponding path program 1 times [2023-12-25 07:19:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994841616] [2023-12-25 07:19:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:57,953 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:19:57,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:57,954 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:19:57,980 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:19:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:58,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:58,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:58,045 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:19:58,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:58,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994841616] [2023-12-25 07:19:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994841616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:58,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:58,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405177020] [2023-12-25 07:19:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:58,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:58,047 INFO L87 Difference]: Start difference. First operand 11434 states and 16968 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:19:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:58,611 INFO L93 Difference]: Finished difference Result 23070 states and 34304 transitions. [2023-12-25 07:19:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:58,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2023-12-25 07:19:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:58,631 INFO L225 Difference]: With dead ends: 23070 [2023-12-25 07:19:58,631 INFO L226 Difference]: Without dead ends: 11692 [2023-12-25 07:19:58,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:58,643 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 116 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:58,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 275 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11692 states. [2023-12-25 07:19:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11692 to 9110. [2023-12-25 07:19:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9110 states, 9109 states have (on average 1.4251838840706994) internal successors, (12982), 9109 states have internal predecessors, (12982), 0 states have call successors, (0), 0 states have 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:19:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9110 states to 9110 states and 12982 transitions. [2023-12-25 07:19:59,140 INFO L78 Accepts]: Start accepts. Automaton has 9110 states and 12982 transitions. Word has length 85 [2023-12-25 07:19:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:19:59,140 INFO L495 AbstractCegarLoop]: Abstraction has 9110 states and 12982 transitions. [2023-12-25 07:19:59,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:19:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 9110 states and 12982 transitions. [2023-12-25 07:19:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-25 07:19:59,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:19:59,148 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:59,170 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:19:59,352 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:19:59,352 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:19:59,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:19:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2120377808, now seen corresponding path program 1 times [2023-12-25 07:19:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:19:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654940062] [2023-12-25 07:19:59,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:19:59,353 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:19:59,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:19:59,354 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:19:59,368 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:19:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:19:59,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:19:59,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:19:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:19:59,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:19:59,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:19:59,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654940062] [2023-12-25 07:19:59,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654940062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:19:59,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:19:59,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:19:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352334213] [2023-12-25 07:19:59,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:19:59,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:19:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:19:59,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:19:59,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:19:59,418 INFO L87 Difference]: Start difference. First operand 9110 states and 12982 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:19:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:19:59,953 INFO L93 Difference]: Finished difference Result 21892 states and 31263 transitions. [2023-12-25 07:19:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:19:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 86 [2023-12-25 07:19:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:19:59,978 INFO L225 Difference]: With dead ends: 21892 [2023-12-25 07:19:59,978 INFO L226 Difference]: Without dead ends: 13924 [2023-12-25 07:19:59,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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:19:59,990 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 101 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:19:59,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 387 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:19:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13924 states. [2023-12-25 07:20:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13924 to 13348. [2023-12-25 07:20:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13348 states, 13347 states have (on average 1.3968682100846632) internal successors, (18644), 13347 states have internal predecessors, (18644), 0 states have call successors, (0), 0 states have 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:20:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13348 states to 13348 states and 18644 transitions. [2023-12-25 07:20:00,497 INFO L78 Accepts]: Start accepts. Automaton has 13348 states and 18644 transitions. Word has length 86 [2023-12-25 07:20:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:00,497 INFO L495 AbstractCegarLoop]: Abstraction has 13348 states and 18644 transitions. [2023-12-25 07:20:00,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:20:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 13348 states and 18644 transitions. [2023-12-25 07:20:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-25 07:20:00,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:00,515 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:00,519 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:20:00,717 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:20:00,718 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:00,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1702675469, now seen corresponding path program 1 times [2023-12-25 07:20:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:00,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340431611] [2023-12-25 07:20:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:00,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:20:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:00,720 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:20:00,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 07:20:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:00,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:00,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 07:20:00,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:00,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340431611] [2023-12-25 07:20:00,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340431611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:00,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:20:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329558288] [2023-12-25 07:20:00,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:00,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:00,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:00,811 INFO L87 Difference]: Start difference. First operand 13348 states and 18644 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 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:20:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:01,390 INFO L93 Difference]: Finished difference Result 26238 states and 36650 transitions. [2023-12-25 07:20:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 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 112 [2023-12-25 07:20:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:01,408 INFO L225 Difference]: With dead ends: 26238 [2023-12-25 07:20:01,408 INFO L226 Difference]: Without dead ends: 13298 [2023-12-25 07:20:01,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 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:20:01,419 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 33 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:01,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 275 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13298 states. [2023-12-25 07:20:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13298 to 13298. [2023-12-25 07:20:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13298 states, 13297 states have (on average 1.3944498759118598) internal successors, (18542), 13297 states have internal predecessors, (18542), 0 states have call successors, (0), 0 states have 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:20:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 18542 transitions. [2023-12-25 07:20:02,164 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 18542 transitions. Word has length 112 [2023-12-25 07:20:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:02,164 INFO L495 AbstractCegarLoop]: Abstraction has 13298 states and 18542 transitions. [2023-12-25 07:20:02,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 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:20:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 18542 transitions. [2023-12-25 07:20:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-25 07:20:02,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:02,180 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:02,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-12-25 07:20:02,382 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:20:02,382 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:02,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash -499436743, now seen corresponding path program 1 times [2023-12-25 07:20:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243509311] [2023-12-25 07:20:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:02,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:20:02,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:02,392 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:20:02,393 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:20:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:02,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:02,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-25 07:20:02,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:02,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243509311] [2023-12-25 07:20:02,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243509311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:02,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:02,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809472710] [2023-12-25 07:20:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:02,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:02,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:02,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:02,472 INFO L87 Difference]: Start difference. First operand 13298 states and 18542 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:02,851 INFO L93 Difference]: Finished difference Result 22739 states and 31497 transitions. [2023-12-25 07:20:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2023-12-25 07:20:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:02,861 INFO L225 Difference]: With dead ends: 22739 [2023-12-25 07:20:02,862 INFO L226 Difference]: Without dead ends: 9493 [2023-12-25 07:20:02,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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:20:02,871 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 74 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:02,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 270 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9493 states. [2023-12-25 07:20:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9493 to 9493. [2023-12-25 07:20:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9493 states, 9492 states have (on average 1.331015592077539) internal successors, (12634), 9492 states have internal predecessors, (12634), 0 states have call successors, (0), 0 states have 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:20:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9493 states to 9493 states and 12634 transitions. [2023-12-25 07:20:03,301 INFO L78 Accepts]: Start accepts. Automaton has 9493 states and 12634 transitions. Word has length 123 [2023-12-25 07:20:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:03,301 INFO L495 AbstractCegarLoop]: Abstraction has 9493 states and 12634 transitions. [2023-12-25 07:20:03,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 9493 states and 12634 transitions. [2023-12-25 07:20:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-25 07:20:03,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:03,316 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,340 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 (25)] Ended with exit code 0 [2023-12-25 07:20:03,519 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:20:03,519 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:03,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash -102570062, now seen corresponding path program 1 times [2023-12-25 07:20:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974687425] [2023-12-25 07:20:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:03,520 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:20:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:03,521 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:20:03,523 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:20:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:03,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:03,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-25 07:20:03,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:03,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974687425] [2023-12-25 07:20:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974687425] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:03,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:03,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109071915] [2023-12-25 07:20:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:03,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:03,593 INFO L87 Difference]: Start difference. First operand 9493 states and 12634 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:03,964 INFO L93 Difference]: Finished difference Result 18233 states and 24286 transitions. [2023-12-25 07:20:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:03,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-12-25 07:20:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:03,976 INFO L225 Difference]: With dead ends: 18233 [2023-12-25 07:20:03,977 INFO L226 Difference]: Without dead ends: 9405 [2023-12-25 07:20:03,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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:20:03,985 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 114 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:03,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 291 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9405 states. [2023-12-25 07:20:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9405 to 9403. [2023-12-25 07:20:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9403 states, 9402 states have (on average 1.3027015528610935) internal successors, (12248), 9402 states have internal predecessors, (12248), 0 states have call successors, (0), 0 states have 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:20:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9403 states to 9403 states and 12248 transitions. [2023-12-25 07:20:04,328 INFO L78 Accepts]: Start accepts. Automaton has 9403 states and 12248 transitions. Word has length 124 [2023-12-25 07:20:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:04,328 INFO L495 AbstractCegarLoop]: Abstraction has 9403 states and 12248 transitions. [2023-12-25 07:20:04,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 9403 states and 12248 transitions. [2023-12-25 07:20:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-25 07:20:04,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:04,338 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:04,343 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:20:04,541 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:20:04,541 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:04,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -188773814, now seen corresponding path program 1 times [2023-12-25 07:20:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342658841] [2023-12-25 07:20:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:04,542 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:20:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:04,543 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:20:04,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 07:20:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:04,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:04,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 07:20:04,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:04,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342658841] [2023-12-25 07:20:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342658841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:20:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675522125] [2023-12-25 07:20:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:04,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:04,640 INFO L87 Difference]: Start difference. First operand 9403 states and 12248 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:04,977 INFO L93 Difference]: Finished difference Result 18394 states and 23955 transitions. [2023-12-25 07:20:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2023-12-25 07:20:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:04,988 INFO L225 Difference]: With dead ends: 18394 [2023-12-25 07:20:04,988 INFO L226 Difference]: Without dead ends: 9385 [2023-12-25 07:20:04,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:04,995 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:04,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 273 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2023-12-25 07:20:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 9365. [2023-12-25 07:20:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9365 states, 9364 states have (on average 1.2994446817599317) internal successors, (12168), 9364 states have internal predecessors, (12168), 0 states have call successors, (0), 0 states have 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:20:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 12168 transitions. [2023-12-25 07:20:05,317 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 12168 transitions. Word has length 130 [2023-12-25 07:20:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:05,317 INFO L495 AbstractCegarLoop]: Abstraction has 9365 states and 12168 transitions. [2023-12-25 07:20:05,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 12168 transitions. [2023-12-25 07:20:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-25 07:20:05,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:05,325 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:05,328 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:20:05,528 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:20:05,528 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:05,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 56047882, now seen corresponding path program 1 times [2023-12-25 07:20:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:05,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874546280] [2023-12-25 07:20:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:05,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:20:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:05,530 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:20:05,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-25 07:20:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:05,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:05,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 07:20:05,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:05,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:05,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874546280] [2023-12-25 07:20:05,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874546280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:05,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:05,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:20:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173954233] [2023-12-25 07:20:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:05,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:05,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:05,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:05,652 INFO L87 Difference]: Start difference. First operand 9365 states and 12168 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:20:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:06,009 INFO L93 Difference]: Finished difference Result 18344 states and 23835 transitions. [2023-12-25 07:20:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:06,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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:20:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:06,019 INFO L225 Difference]: With dead ends: 18344 [2023-12-25 07:20:06,019 INFO L226 Difference]: Without dead ends: 9355 [2023-12-25 07:20:06,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:06,022 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 19 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:06,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 270 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2023-12-25 07:20:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 9335. [2023-12-25 07:20:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9335 states, 9334 states have (on average 1.2960145703878294) internal successors, (12097), 9334 states have internal predecessors, (12097), 0 states have call successors, (0), 0 states have 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:20:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9335 states to 9335 states and 12097 transitions. [2023-12-25 07:20:06,352 INFO L78 Accepts]: Start accepts. Automaton has 9335 states and 12097 transitions. Word has length 130 [2023-12-25 07:20:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:06,352 INFO L495 AbstractCegarLoop]: Abstraction has 9335 states and 12097 transitions. [2023-12-25 07:20:06,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:20:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 9335 states and 12097 transitions. [2023-12-25 07:20:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 07:20:06,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:06,361 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:06,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-12-25 07:20:06,562 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:20:06,562 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:06,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 307440907, now seen corresponding path program 1 times [2023-12-25 07:20:06,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:06,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062364827] [2023-12-25 07:20:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:06,563 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:20:06,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:06,564 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:20:06,566 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:20:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:06,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:06,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 07:20:06,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:06,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:06,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062364827] [2023-12-25 07:20:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062364827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:06,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59574325] [2023-12-25 07:20:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:06,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:06,630 INFO L87 Difference]: Start difference. First operand 9335 states and 12097 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:20:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:06,898 INFO L93 Difference]: Finished difference Result 16391 states and 21330 transitions. [2023-12-25 07:20:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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:20:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:06,906 INFO L225 Difference]: With dead ends: 16391 [2023-12-25 07:20:06,907 INFO L226 Difference]: Without dead ends: 7432 [2023-12-25 07:20:06,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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:20:06,914 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 99 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:06,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 271 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2023-12-25 07:20:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 7430. [2023-12-25 07:20:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7430 states, 7429 states have (on average 1.2685421994884911) internal successors, (9424), 7429 states have internal predecessors, (9424), 0 states have call successors, (0), 0 states have 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:20:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7430 states to 7430 states and 9424 transitions. [2023-12-25 07:20:07,175 INFO L78 Accepts]: Start accepts. Automaton has 7430 states and 9424 transitions. Word has length 133 [2023-12-25 07:20:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:07,175 INFO L495 AbstractCegarLoop]: Abstraction has 7430 states and 9424 transitions. [2023-12-25 07:20:07,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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:20:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7430 states and 9424 transitions. [2023-12-25 07:20:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 07:20:07,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:07,180 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,185 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:20:07,382 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:20:07,383 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:07,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1540318430, now seen corresponding path program 1 times [2023-12-25 07:20:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:07,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545801335] [2023-12-25 07:20:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:07,384 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:20:07,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:07,385 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:20:07,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-25 07:20:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:07,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:07,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 07:20:07,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:07,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545801335] [2023-12-25 07:20:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545801335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626119597] [2023-12-25 07:20:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:07,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:07,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:07,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:07,495 INFO L87 Difference]: Start difference. First operand 7430 states and 9424 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:20:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:07,698 INFO L93 Difference]: Finished difference Result 13086 states and 16618 transitions. [2023-12-25 07:20:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:07,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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:20:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:07,705 INFO L225 Difference]: With dead ends: 13086 [2023-12-25 07:20:07,705 INFO L226 Difference]: Without dead ends: 5622 [2023-12-25 07:20:07,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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:20:07,710 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 101 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:07,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 267 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2023-12-25 07:20:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 5585. [2023-12-25 07:20:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5584 states have (on average 1.2433739255014327) internal successors, (6943), 5584 states have internal predecessors, (6943), 0 states have call successors, (0), 0 states have 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:20:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 6943 transitions. [2023-12-25 07:20:07,895 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 6943 transitions. Word has length 133 [2023-12-25 07:20:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:07,895 INFO L495 AbstractCegarLoop]: Abstraction has 5585 states and 6943 transitions. [2023-12-25 07:20:07,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:20:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 6943 transitions. [2023-12-25 07:20:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-25 07:20:07,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:07,897 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,899 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 (30)] Ended with exit code 0 [2023-12-25 07:20:08,098 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:20:08,098 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:08,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1299287787, now seen corresponding path program 1 times [2023-12-25 07:20:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:08,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040700904] [2023-12-25 07:20:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:08,099 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:20:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:08,100 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:20:08,101 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:20:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:08,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:08,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-25 07:20:08,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:08,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:08,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040700904] [2023-12-25 07:20:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040700904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930330251] [2023-12-25 07:20:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:08,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:08,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:08,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:08,165 INFO L87 Difference]: Start difference. First operand 5585 states and 6943 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:20:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:08,409 INFO L93 Difference]: Finished difference Result 10721 states and 13374 transitions. [2023-12-25 07:20:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 170 [2023-12-25 07:20:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:08,418 INFO L225 Difference]: With dead ends: 10721 [2023-12-25 07:20:08,419 INFO L226 Difference]: Without dead ends: 5398 [2023-12-25 07:20:08,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 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:20:08,426 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:08,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5398 states. [2023-12-25 07:20:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5398 to 5166. [2023-12-25 07:20:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.228460793804453) internal successors, (6345), 5165 states have internal predecessors, (6345), 0 states have call successors, (0), 0 states have 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:20:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 6345 transitions. [2023-12-25 07:20:08,675 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 6345 transitions. Word has length 170 [2023-12-25 07:20:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:08,676 INFO L495 AbstractCegarLoop]: Abstraction has 5166 states and 6345 transitions. [2023-12-25 07:20:08,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:20:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 6345 transitions. [2023-12-25 07:20:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-25 07:20:08,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:08,679 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:08,682 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:20:08,879 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:20:08,880 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:08,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1420735470, now seen corresponding path program 1 times [2023-12-25 07:20:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:08,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157509890] [2023-12-25 07:20:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:08,881 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:20:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:08,882 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:20:08,882 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:20:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:08,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:08,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:20:08,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:08,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157509890] [2023-12-25 07:20:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157509890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:08,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120490230] [2023-12-25 07:20:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:08,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:08,977 INFO L87 Difference]: Start difference. First operand 5166 states and 6345 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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:20:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:09,308 INFO L93 Difference]: Finished difference Result 11966 states and 14693 transitions. [2023-12-25 07:20:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:09,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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 176 [2023-12-25 07:20:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:09,315 INFO L225 Difference]: With dead ends: 11966 [2023-12-25 07:20:09,316 INFO L226 Difference]: Without dead ends: 7062 [2023-12-25 07:20:09,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 174 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:20:09,318 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 127 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:09,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 272 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2023-12-25 07:20:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 5736. [2023-12-25 07:20:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5736 states, 5735 states have (on average 1.2040104620749783) internal successors, (6905), 5735 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states have 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:20:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5736 states to 5736 states and 6905 transitions. [2023-12-25 07:20:09,521 INFO L78 Accepts]: Start accepts. Automaton has 5736 states and 6905 transitions. Word has length 176 [2023-12-25 07:20:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:09,521 INFO L495 AbstractCegarLoop]: Abstraction has 5736 states and 6905 transitions. [2023-12-25 07:20:09,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 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:20:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5736 states and 6905 transitions. [2023-12-25 07:20:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-25 07:20:09,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:09,523 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-12-25 07:20:09,725 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:20:09,725 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:09,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash 782264909, now seen corresponding path program 1 times [2023-12-25 07:20:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:09,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501352637] [2023-12-25 07:20:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:09,726 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:20:09,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:09,728 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:20:09,730 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:20:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:09,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:09,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-25 07:20:09,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:09,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501352637] [2023-12-25 07:20:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501352637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320066347] [2023-12-25 07:20:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:09,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:09,836 INFO L87 Difference]: Start difference. First operand 5736 states and 6905 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:20:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:10,098 INFO L93 Difference]: Finished difference Result 12681 states and 15188 transitions. [2023-12-25 07:20:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 179 [2023-12-25 07:20:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:10,105 INFO L225 Difference]: With dead ends: 12681 [2023-12-25 07:20:10,105 INFO L226 Difference]: Without dead ends: 6524 [2023-12-25 07:20:10,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 177 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:20:10,109 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 101 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:10,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 252 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2023-12-25 07:20:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 6418. [2023-12-25 07:20:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 6417 states have (on average 1.1927692067944522) internal successors, (7654), 6417 states have internal predecessors, (7654), 0 states have call successors, (0), 0 states have 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:20:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 7654 transitions. [2023-12-25 07:20:10,339 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 7654 transitions. Word has length 179 [2023-12-25 07:20:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:10,340 INFO L495 AbstractCegarLoop]: Abstraction has 6418 states and 7654 transitions. [2023-12-25 07:20:10,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:20:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 7654 transitions. [2023-12-25 07:20:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-25 07:20:10,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:10,342 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:10,347 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:20:10,544 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:20:10,545 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:10,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1666060306, now seen corresponding path program 1 times [2023-12-25 07:20:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:10,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384823305] [2023-12-25 07:20:10,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:10,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:20:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:10,547 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:20:10,549 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:20:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:10,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 07:20:10,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 07:20:11,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:20:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 07:20:11,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:11,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384823305] [2023-12-25 07:20:11,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384823305] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:20:11,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:20:11,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-25 07:20:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741635156] [2023-12-25 07:20:11,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:20:11,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 07:20:11,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:11,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 07:20:11,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:20:11,346 INFO L87 Difference]: Start difference. First operand 6418 states and 7654 transitions. Second operand has 19 states, 19 states have (on average 18.263157894736842) internal successors, (347), 19 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have 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:20:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:15,427 INFO L93 Difference]: Finished difference Result 50782 states and 60036 transitions. [2023-12-25 07:20:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-25 07:20:15,428 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.263157894736842) internal successors, (347), 19 states have internal predecessors, (347), 0 states have call successors, (0), 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 180 [2023-12-25 07:20:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:15,481 INFO L225 Difference]: With dead ends: 50782 [2023-12-25 07:20:15,481 INFO L226 Difference]: Without dead ends: 44323 [2023-12-25 07:20:15,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=702, Invalid=5618, Unknown=0, NotChecked=0, Total=6320 [2023-12-25 07:20:15,495 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 4482 mSDsluCounter, 9799 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 10722 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:15,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 10722 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 07:20:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44323 states. [2023-12-25 07:20:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44323 to 17673. [2023-12-25 07:20:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17672 states have (on average 1.1895088275237664) internal successors, (21021), 17672 states have internal predecessors, (21021), 0 states have call successors, (0), 0 states have 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:20:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 21021 transitions. [2023-12-25 07:20:16,494 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 21021 transitions. Word has length 180 [2023-12-25 07:20:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:16,494 INFO L495 AbstractCegarLoop]: Abstraction has 17673 states and 21021 transitions. [2023-12-25 07:20:16,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.263157894736842) internal successors, (347), 19 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have 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:20:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 21021 transitions. [2023-12-25 07:20:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-12-25 07:20:16,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:16,500 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:16,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-12-25 07:20:16,701 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:20:16,701 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:16,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash -929118864, now seen corresponding path program 1 times [2023-12-25 07:20:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:16,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121792107] [2023-12-25 07:20:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:16,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:20:16,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:16,703 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:20:16,704 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:20:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:16,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:20:16,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 07:20:17,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:20:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 07:20:17,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121792107] [2023-12-25 07:20:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121792107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:20:17,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:20:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-25 07:20:17,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40758956] [2023-12-25 07:20:17,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:20:17,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 07:20:17,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:17,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 07:20:17,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-12-25 07:20:17,371 INFO L87 Difference]: Start difference. First operand 17673 states and 21021 transitions. Second operand has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have 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:20:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:22,895 INFO L93 Difference]: Finished difference Result 75148 states and 88755 transitions. [2023-12-25 07:20:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-25 07:20:22,896 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 0 states have call successors, (0), 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 186 [2023-12-25 07:20:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:22,971 INFO L225 Difference]: With dead ends: 75148 [2023-12-25 07:20:22,972 INFO L226 Difference]: Without dead ends: 56572 [2023-12-25 07:20:22,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=668, Invalid=4444, Unknown=0, NotChecked=0, Total=5112 [2023-12-25 07:20:22,993 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 3694 mSDsluCounter, 6133 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3694 SdHoareTripleChecker+Valid, 6703 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:22,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3694 Valid, 6703 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 07:20:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56572 states. [2023-12-25 07:20:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56572 to 27295. [2023-12-25 07:20:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27295 states, 27294 states have (on average 1.1924598812925917) internal successors, (32547), 27294 states have internal predecessors, (32547), 0 states have call successors, (0), 0 states have 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:20:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27295 states to 27295 states and 32547 transitions. [2023-12-25 07:20:25,169 INFO L78 Accepts]: Start accepts. Automaton has 27295 states and 32547 transitions. Word has length 186 [2023-12-25 07:20:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:25,169 INFO L495 AbstractCegarLoop]: Abstraction has 27295 states and 32547 transitions. [2023-12-25 07:20:25,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have 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:20:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 27295 states and 32547 transitions. [2023-12-25 07:20:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-25 07:20:25,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:25,188 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:20:25,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-12-25 07:20:25,388 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:20:25,388 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:25,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1887355508, now seen corresponding path program 1 times [2023-12-25 07:20:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:25,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006478081] [2023-12-25 07:20:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:25,389 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:20:25,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:25,390 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:20:25,391 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:20:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:25,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:25,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 07:20:25,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:25,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:25,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006478081] [2023-12-25 07:20:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006478081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:25,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:25,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708644812] [2023-12-25 07:20:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:25,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:25,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:25,476 INFO L87 Difference]: Start difference. First operand 27295 states and 32547 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:25,878 INFO L93 Difference]: Finished difference Result 31729 states and 37721 transitions. [2023-12-25 07:20:25,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2023-12-25 07:20:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:25,883 INFO L225 Difference]: With dead ends: 31729 [2023-12-25 07:20:25,883 INFO L226 Difference]: Without dead ends: 4673 [2023-12-25 07:20:25,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 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:20:25,898 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 81 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:25,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 347 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2023-12-25 07:20:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4629. [2023-12-25 07:20:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4628 states have (on average 1.1575194468452896) internal successors, (5357), 4628 states have internal predecessors, (5357), 0 states have call successors, (0), 0 states have 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:20:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 5357 transitions. [2023-12-25 07:20:26,190 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 5357 transitions. Word has length 233 [2023-12-25 07:20:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:26,190 INFO L495 AbstractCegarLoop]: Abstraction has 4629 states and 5357 transitions. [2023-12-25 07:20:26,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:20:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 5357 transitions. [2023-12-25 07:20:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-25 07:20:26,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:20:26,194 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,209 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:20:26,397 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:20:26,398 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:20:26,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:20:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1368972449, now seen corresponding path program 1 times [2023-12-25 07:20:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:20:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809303684] [2023-12-25 07:20:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:20:26,399 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:20:26,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:20:26,400 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:20:26,401 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:20:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:20:26,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:20:26,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:20:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-25 07:20:26,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:20:26,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:20:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809303684] [2023-12-25 07:20:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809303684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:20:26,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:20:26,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:20:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906448795] [2023-12-25 07:20:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:20:26,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:20:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:20:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:20:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:20:26,495 INFO L87 Difference]: Start difference. First operand 4629 states and 5357 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:20:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:20:26,569 INFO L93 Difference]: Finished difference Result 5043 states and 5809 transitions. [2023-12-25 07:20:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:20:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 246 [2023-12-25 07:20:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:20:26,570 INFO L225 Difference]: With dead ends: 5043 [2023-12-25 07:20:26,570 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 07:20:26,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 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:20:26,572 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 10 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:20:26,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 264 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:20:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 07:20:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 07:20:26,573 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:20:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 07:20:26,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2023-12-25 07:20:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:20:26,573 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 07:20:26,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:20:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 07:20:26,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 07:20:26,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:20:26,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-12-25 07:20:26,776 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:20:26,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 07:20:32,505 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 270 DAG size of output: 243 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-25 07:23:19,861 WARN L293 SmtUtils]: Spent 2.72m on a formula simplification. DAG size of input: 260 DAG size of output: 216 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-25 07:23:45,676 WARN L293 SmtUtils]: Spent 21.64s on a formula simplification. DAG size of input: 652 DAG size of output: 552 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-25 07:24:11,419 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 552 DAG size of output: 141 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L597(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 568) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L564-2(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L366(lines 298 396) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 238) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 110) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 77) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L598(lines 598 602) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 107) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L534-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L336(lines 298 396) no Hoare annotation was computed. [2023-12-25 07:24:11,424 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 319) no Hoare annotation was computed. [2023-12-25 07:24:11,425 INFO L895 garLoopResultBuilder]: At program point L204-1(lines 197 220) the Hoare annotation is: (let ((.cse39 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse32 (= ~d~0 (_ bv2 32))) (.cse21 (= ~wb_pc~0 (_ bv0 32))) (.cse27 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse34 (= .cse39 ~c_t~0)) (.cse17 (= ~c_req_up~0 (_ bv0 32))) (.cse35 (= ~wl_st~0 (_ bv0 32))) (.cse22 (= ~data~0 (_ bv0 32))) (.cse23 (= ~c1_pc~0 (_ bv0 32))) (.cse36 (= ~wl_pc~0 (_ bv0 32))) (.cse30 (= ~c~0 (_ bv2 32))) (.cse33 (= (_ bv2 32) ~data~0)) (.cse20 (= ~d~0 (_ bv0 32))) (.cse31 (= (_ bv2 32) ~c_t~0)) (.cse26 (= (_ bv2 32) ~c1_st~0)) (.cse10 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse25 (= ~wl_pc~0 (_ bv1 32))) (.cse37 (= (_ bv1 32) ~c_t~0)) (.cse29 (= ~data~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ~t_b~0)) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse38 (= ~c~0 (_ bv1 32))) (.cse28 (= ~data~0 .cse39)) (.cse0 (= (_ bv2 32) ~r_st~0)) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (= (_ bv2 32) ~e_wl~0)) (.cse4 (= (_ bv1 32) ~wb_i~0)) (.cse5 (= ~wl_st~0 (_ bv2 32))) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse18 (= ~wb_st~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse11 (= (_ bv0 32) ~processed~0)) (.cse12 (= ~c1_st~0 (_ bv0 32))) (.cse24 (= (_ bv2 32) ~e_c~0)) (.cse13 (= (_ bv2 32) ~e_g~0)) (.cse14 (= ~c1_i~0 (_ bv1 32))) (.cse15 (= ~wb_pc~0 (_ bv1 32))) (.cse16 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse4 .cse5 .cse6 .cse18 .cse8 .cse19 .cse20 .cse11 .cse21 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse19 .cse9 .cse20 .cse11 .cse26 .cse22 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse18 .cse8 .cse19 .cse20 .cse11 .cse26 .cse21 .cse22 .cse24 .cse25 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse11 .cse26 .cse27 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse30 .cse7 .cse8 .cse19 .cse9 .cse20 .cse11 .cse12 .cse31 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse32 .cse6 .cse30 .cse7 .cse33 .cse8 .cse19 .cse9 .cse26 .cse31 .cse24 .cse13 .cse14 .cse15 .cse16) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~data~0 ~t_b~0) .cse7 .cse8 .cse9 .cse26 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse27 .cse24 .cse13 .cse14 .cse15 .cse16)) .cse34) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse35 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse8 .cse19 .cse20 .cse11 .cse26 .cse21 .cse22 .cse24 .cse13 .cse14 .cse16 .cse36) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse32 .cse6 .cse29 .cse30 .cse7 .cse8 .cse19 .cse9 .cse11 .cse12 .cse31 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse37 .cse4 .cse5 .cse6 .cse29 .cse7 .cse8 .cse19 .cse9 .cse20 .cse11 .cse38 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse13 .cse14 .cse16 .cse36) (and .cse17 .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse19 .cse9 .cse20 .cse11 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse35 .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse8 .cse19 .cse20 .cse11 .cse21 .cse22 .cse12 .cse23 .cse24 .cse13 .cse14 .cse16 .cse36) (and .cse17 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse26 .cse27 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse24 .cse13 .cse14 .cse15 .cse34 .cse16) (and .cse17 .cse35 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse19 .cse9 .cse20 .cse11 .cse26 .cse22 .cse24 .cse13 .cse14 .cse15 .cse16 .cse36) (and .cse17 .cse35 .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse19 .cse9 .cse20 .cse11 .cse22 .cse12 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse36) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse33 .cse8 .cse19 .cse9 .cse20 .cse26 .cse31 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse37 .cse4 .cse5 .cse6 .cse29 .cse7 .cse8 .cse19 .cse9 .cse11 (= ~d~0 (_ bv1 32)) .cse38 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16) (and .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16)))) [2023-12-25 07:24:11,425 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 683) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 377) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point write_back_returnLabel#1(lines 227 258) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point compute1_returnLabel#1(lines 137 181) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 318) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L273(lines 265 282) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 207 215) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L670(lines 670 682) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L505(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L439-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point compute2_returnLabel#1(lines 182 226) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 347) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2023-12-25 07:24:11,426 INFO L899 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L895 garLoopResultBuilder]: At program point L242-1(lines 242 252) the Hoare annotation is: (let ((.cse33 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse27 (= ~c2_pc~0 (_ bv0 32))) (.cse32 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse0 (= ~data~0 .cse33)) (.cse21 (= ~c2_st~0 (_ bv0 32))) (.cse23 (= (_ bv2 32) ~c1_st~0)) (.cse16 (= .cse33 ~c_t~0)) (.cse3 (= (_ bv1 32) ~c1_pc~0)) (.cse6 (= ~wl_st~0 (_ bv2 32))) (.cse26 (= ~wl_pc~0 (_ bv1 32))) (.cse15 (= ~wb_pc~0 (_ bv1 32))) (.cse18 (= ~c_req_up~0 (_ bv0 32))) (.cse28 (= ~wl_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~r_st~0)) (.cse2 (= (_ bv2 32) ~e_f~0)) (.cse4 (= (_ bv2 32) ~e_wl~0)) (.cse5 (= (_ bv1 32) ~wb_i~0)) (.cse7 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse19 (= (_ bv0 32) ~t_b~0)) (.cse20 (= ~d~0 (_ bv0 32))) (.cse22 (= (_ bv0 32) ~processed~0)) (.cse24 (= ~wb_pc~0 (_ bv0 32))) (.cse25 (= ~data~0 (_ bv0 32))) (.cse10 (= ~c1_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~c2_st~0)) (.cse29 (= ~c1_pc~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~e_c~0)) (.cse13 (= (_ bv2 32) ~e_g~0)) (.cse14 (= ~c1_i~0 (_ bv1 32))) (.cse17 (= (_ bv0 32) ~r_i~0)) (.cse30 (= ~wl_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse12 .cse26 .cse13 .cse14 .cse17 .cse27) (and .cse18 .cse28 .cse1 .cse2 .cse4 .cse5 .cse7 .cse9 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse10 .cse29 .cse12 .cse13 .cse14 .cse17 .cse30 .cse27) (let ((.cse31 (bvadd (_ bv2 32) ~t_b~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 (= .cse31 ~data~0) .cse11 .cse12 (= .cse31 ~c_t~0) .cse13 .cse14 .cse15 .cse17)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse23 .cse11 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse20 .cse22 .cse24 .cse25 .cse10 .cse11 .cse29 .cse12 .cse26 .cse13 .cse14 .cse17) (and .cse18 .cse28 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse14 .cse17 .cse30 .cse27) (and .cse18 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse11 .cse12 .cse26 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse13 .cse14 .cse17 .cse30) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse1 .cse2 .cse5 .cse6 .cse7 .cse9 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse10 .cse29 .cse12 .cse26 .cse13 .cse14 .cse17 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse21 .cse23 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse28 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse17 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse13 .cse14 .cse15 .cse17) (and .cse18 .cse28 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse20 .cse22 .cse24 .cse25 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse17 .cse30)))) [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 418) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L408-2(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 317) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L607(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L574-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 414) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 414) no Hoare annotation was computed. [2023-12-25 07:24:11,427 INFO L899 garLoopResultBuilder]: For program point L79(lines 65 135) no Hoare annotation was computed. [2023-12-25 07:24:11,428 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 612) no Hoare annotation was computed. [2023-12-25 07:24:11,428 INFO L899 garLoopResultBuilder]: For program point L477(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,428 INFO L899 garLoopResultBuilder]: For program point L444-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,428 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2023-12-25 07:24:11,428 INFO L899 garLoopResultBuilder]: For program point L312-1(lines 298 396) no Hoare annotation was computed. [2023-12-25 07:24:11,431 INFO L899 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2023-12-25 07:24:11,432 INFO L895 garLoopResultBuilder]: At program point L676-1(lines 545 685) the Hoare annotation is: (let ((.cse29 (bvadd (_ bv2 32) ~t_b~0)) (.cse26 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse1 (= ~data~0 .cse26)) (.cse21 (= ~data~0 (_ bv1 32))) (.cse22 (= ~c~0 (_ bv2 32))) (.cse25 (= (_ bv2 32) ~c_t~0)) (.cse28 (= .cse29 ~data~0)) (.cse23 (= (_ bv0 32) ~t_b~0)) (.cse24 (= ~d~0 (_ bv0 32))) (.cse30 (= ~wl_pc~0 (_ bv0 32))) (.cse0 (= ~c_req_up~0 (_ bv0 32))) (.cse2 (= ~wl_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~r_st~0)) (.cse27 (= ~data~0 ~t_b~0)) (.cse14 (= (_ bv2 32) ~e_c~0)) (.cse11 (= (_ bv2 32) ~wb_st~0)) (.cse12 (= (_ bv2 32) ~c1_st~0)) (.cse13 (= (_ bv2 32) ~c2_st~0)) (.cse4 (= (_ bv2 32) ~e_f~0)) (.cse5 (= (_ bv1 32) ~c1_pc~0)) (.cse6 (= (_ bv2 32) ~e_wl~0)) (.cse7 (= (_ bv1 32) ~wb_i~0)) (.cse20 (= ~wl_st~0 (_ bv2 32))) (.cse8 (= ~c2_i~0 (_ bv1 32))) (.cse9 (= (_ bv1 32) ~c2_pc~0)) (.cse10 (= (_ bv2 32) ~e_e~0)) (.cse15 (= ~wl_pc~0 (_ bv1 32))) (.cse16 (= (_ bv2 32) ~e_g~0)) (.cse17 (= ~c1_i~0 (_ bv1 32))) (.cse18 (= ~wb_pc~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse12 .cse13 .cse25 .cse14 .cse16 .cse17 .cse18 .cse19) (and (= ~c~0 .cse26) (or (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19)) (= .cse26 ~c_t~0)) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 (= .cse29 ~c~0) .cse14 (= .cse29 ~c_t~0) .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse6 .cse7 .cse20 .cse8 .cse10 .cse16 .cse17 .cse19 .cse30) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 (= ~d~0 (_ bv2 32)) .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse25 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= ~wb_st~0 (_ bv0 32)) .cse10 .cse23 .cse24 (= ~c2_st~0 (_ bv0 32)) (= (_ bv0 32) ~processed~0) (= ~wb_pc~0 (_ bv0 32)) (= ~data~0 (_ bv0 32)) (= ~c1_st~0 (_ bv0 32)) (= ~c1_pc~0 (_ bv0 32)) .cse14 .cse16 .cse17 .cse19 .cse30 (= ~c2_pc~0 (_ bv0 32))) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 (not (= ~wl_pc~0 (_ bv2 32))) .cse12 .cse13 .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2023-12-25 07:24:11,432 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2023-12-25 07:24:11,432 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,432 INFO L899 garLoopResultBuilder]: For program point L579-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,432 INFO L895 garLoopResultBuilder]: At program point L381(lines 298 396) the Hoare annotation is: (let ((.cse44 (bvadd (_ bv2 32) ~t_b~0)) (.cse37 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse36 (= ~c~0 .cse37)) (.cse33 (= ~wb_st~0 (_ bv0 32))) (.cse40 (= ~wb_pc~0 (_ bv0 32))) (.cse39 (= ~c1_pc~0 (_ bv0 32))) (.cse31 (= ~wl_pc~0 (_ bv0 32))) (.cse35 (= .cse44 ~data~0)) (.cse42 (= .cse44 ~c~0)) (.cse43 (= .cse44 ~c_t~0)) (.cse2 (= ~wl_st~0 (_ bv0 32))) (.cse38 (= ~data~0 ~t_b~0)) (.cse28 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse1 (= ~data~0 .cse37)) (.cse34 (= .cse37 ~c_t~0)) (.cse0 (= ~c_req_up~0 (_ bv0 32))) (.cse24 (= ~d~0 (_ bv0 32))) (.cse25 (= ~c2_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~c1_st~0)) (.cse30 (= ~data~0 (_ bv0 32))) (.cse15 (= ~wl_pc~0 (_ bv1 32))) (.cse32 (= ~c2_pc~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~r_st~0)) (.cse4 (= (_ bv2 32) ~e_f~0)) (.cse5 (= (_ bv1 32) ~c1_pc~0)) (.cse6 (= (_ bv2 32) ~e_wl~0)) (.cse7 (= (_ bv1 32) ~wb_i~0)) (.cse20 (= ~wl_st~0 (_ bv2 32))) (.cse41 (= ~d~0 (_ bv2 32))) (.cse8 (= ~c2_i~0 (_ bv1 32))) (.cse21 (= ~data~0 (_ bv1 32))) (.cse22 (= ~c~0 (_ bv2 32))) (.cse9 (= (_ bv1 32) ~c2_pc~0)) (.cse10 (= (_ bv2 32) ~e_e~0)) (.cse23 (= (_ bv0 32) ~t_b~0)) (.cse11 (= (_ bv2 32) ~wb_st~0)) (.cse26 (= (_ bv0 32) ~processed~0)) (.cse29 (= ~c1_st~0 (_ bv0 32))) (.cse13 (= (_ bv2 32) ~c2_st~0)) (.cse27 (= (_ bv2 32) ~c_t~0)) (.cse14 (= (_ bv2 32) ~e_c~0)) (.cse16 (= (_ bv2 32) ~e_g~0)) (.cse17 (= ~c1_i~0 (_ bv1 32))) (.cse18 (= ~wb_pc~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse12 .cse27 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse28 .cse29 .cse13 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse12 .cse30 .cse14 .cse16 .cse17 .cse18 .cse19 .cse31 .cse32) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse28 .cse25 .cse12 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse26 .cse29 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse29 .cse13 .cse14 .cse16 .cse17 .cse18 .cse34 .cse19) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse36 (= ~d~0 .cse37) (or (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse38 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19)) .cse34) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse28 .cse25 .cse26 .cse29 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse12 .cse13 .cse27 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse26 .cse29 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse7 .cse20 .cse8 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse30 .cse29 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse32) (and .cse0 .cse3 .cse4 .cse7 .cse20 .cse8 .cse33 .cse10 .cse23 .cse24 .cse25 .cse26 .cse40 .cse30 .cse29 .cse39 .cse14 .cse15 .cse16 .cse17 .cse19 .cse32) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse41 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse25 .cse26 .cse12 .cse27 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse23 .cse24 .cse26 .cse12 .cse40 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse23 .cse24 .cse26 .cse12 .cse40 .cse30 .cse13 .cse14 .cse16 .cse17 .cse19 .cse31) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse41 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse27 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse38 .cse9 .cse10 .cse11 .cse25 .cse26 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse30 .cse29 .cse39 .cse14 .cse16 .cse17 .cse18 .cse19 .cse31 .cse32) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse10 .cse23 .cse24 .cse25 .cse26 .cse12 .cse40 .cse30 .cse14 .cse16 .cse17 .cse19 .cse31 .cse32) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse26 .cse12 .cse35 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse38 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19)) .cse34) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse28 .cse25 .cse26 .cse12 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse25 .cse26 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse25 .cse26 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse24 .cse26 .cse12 .cse30 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse31) (and .cse36 (or (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse38 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19)) .cse34) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse28 .cse26 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse38 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse14 .cse16 .cse17 .cse18 .cse34 .cse19) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse42 .cse14 .cse43 .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse6 .cse7 .cse20 .cse8 .cse10 .cse16 .cse17 .cse19 .cse31) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse24 .cse26 .cse30 .cse29 .cse13 .cse39 .cse14 .cse16 .cse17 .cse18 .cse19 .cse31) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse33 .cse9 .cse10 .cse23 .cse24 .cse26 .cse40 .cse30 .cse29 .cse13 .cse39 .cse14 .cse16 .cse17 .cse19 .cse31) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse43 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse23 .cse24 .cse26 .cse40 .cse30 .cse29 .cse13 .cse39 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse33 .cse9 .cse10 .cse28 .cse26 .cse29 .cse13 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse41 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse27 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse33 .cse10 .cse23 .cse24 .cse25 .cse26 .cse12 .cse40 .cse30 .cse14 .cse15 .cse16 .cse17 .cse19 .cse32) (and .cse0 .cse3 .cse4 .cse7 .cse20 .cse8 .cse9 .cse10 .cse23 .cse11 .cse24 .cse26 .cse30 .cse29 .cse13 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse33 .cse10 .cse23 .cse24 .cse25 .cse26 .cse40 .cse30 .cse29 .cse39 .cse14 .cse16 .cse17 .cse19 .cse31 .cse32) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse24 .cse26 .cse29 .cse13 .cse27 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse35 .cse13 .cse42 .cse14 .cse43 .cse16 .cse17 .cse18 .cse19 (= .cse44 ~d~0)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse38 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse34 .cse19) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse10 .cse23 .cse11 .cse24 .cse25 .cse26 .cse12 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse32) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse41 .cse8 .cse21 .cse22 .cse9 .cse10 .cse23 .cse11 .cse26 .cse29 .cse13 .cse27 .cse14 .cse16 .cse17 .cse18 .cse19)))) [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L514-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 129) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 403 691) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L351(lines 298 396) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 194) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L616(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L649-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 128) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L895 garLoopResultBuilder]: At program point L122-2(lines 87 130) the Hoare annotation is: (let ((.cse0 (let ((.cse18 (= ~c2_st~0 (_ bv0 32))) (.cse11 (= ~c1_st~0 (_ bv0 32))) (.cse1 (= ~c_req_up~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~r_st~0)) (.cse3 (= (_ bv2 32) ~e_f~0)) (.cse4 (= (_ bv1 32) ~c1_pc~0)) (.cse5 (= (_ bv2 32) ~e_wl~0)) (.cse6 (= (_ bv1 32) ~wb_i~0)) (.cse7 (= ~c2_i~0 (_ bv1 32))) (.cse8 (= (_ bv1 32) ~c2_pc~0)) (.cse9 (= (_ bv2 32) ~e_e~0)) (.cse10 (= (_ bv2 32) ~wb_st~0)) (.cse19 (= (_ bv2 32) ~c1_st~0)) (.cse12 (= (_ bv2 32) ~c2_st~0)) (.cse13 (= (_ bv2 32) ~e_c~0)) (.cse14 (= (_ bv2 32) ~e_g~0)) (.cse15 (= ~c1_i~0 (_ bv1 32))) (.cse16 (= ~wb_pc~0 (_ bv1 32))) (.cse17 (= (_ bv0 32) ~r_i~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) (or (and .cse0 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (and (= ~data~0 ~t_b~0) .cse0) (and (= ~data~0 (bvadd (_ bv1 32) ~t_b~0)) .cse0))) [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 562) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L519-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L552-2(lines 552 562) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L321(lines 298 396) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 193) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point $Ultimate##183(lines 204 219) no Hoare annotation was computed. [2023-12-25 07:24:11,433 INFO L899 garLoopResultBuilder]: For program point L553(lines 553 558) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L487(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L553-2(lines 553 558) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L454-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 362) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L654-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point $Ultimate##44(lines 477 485) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L895 garLoopResultBuilder]: At program point L159-1(lines 152 175) the Hoare annotation is: (let ((.cse39 (bvadd (_ bv1 32) ~t_b~0))) (let ((.cse30 (= (_ bv2 32) ~data~0)) (.cse36 (= ~data~0 .cse39)) (.cse37 (= (bvadd (_ bv2 32) ~t_b~0) ~data~0)) (.cse38 (= .cse39 ~c_t~0)) (.cse32 (= ~d~0 (_ bv2 32))) (.cse29 (= ~c~0 (_ bv2 32))) (.cse31 (= (_ bv2 32) ~c_t~0)) (.cse33 (= (_ bv1 32) ~c_t~0)) (.cse34 (= ~data~0 (_ bv1 32))) (.cse35 (= ~c~0 (_ bv1 32))) (.cse10 (not (= ~wl_pc~0 (_ bv2 32)))) (.cse17 (= ~wl_st~0 (_ bv0 32))) (.cse26 (= ~c2_st~0 (_ bv0 32))) (.cse25 (= ~wl_pc~0 (_ bv0 32))) (.cse28 (= ~c2_pc~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~wb_st~0)) (.cse16 (= ~c_req_up~0 (_ bv0 32))) (.cse0 (= (_ bv2 32) ~r_st~0)) (.cse18 (= ~wb_st~0 (_ bv0 32))) (.cse19 (= (_ bv0 32) ~t_b~0)) (.cse20 (= ~d~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~processed~0)) (.cse22 (= ~wb_pc~0 (_ bv0 32))) (.cse23 (= ~data~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~c2_st~0)) (.cse24 (= (_ bv2 32) ~e_c~0)) (.cse1 (= (_ bv2 32) ~e_f~0)) (.cse2 (= (_ bv1 32) ~c1_pc~0)) (.cse3 (= (_ bv2 32) ~e_wl~0)) (.cse4 (= (_ bv1 32) ~wb_i~0)) (.cse5 (= ~wl_st~0 (_ bv2 32))) (.cse6 (= ~c2_i~0 (_ bv1 32))) (.cse7 (= (_ bv1 32) ~c2_pc~0)) (.cse8 (= (_ bv2 32) ~e_e~0)) (.cse27 (= ~wl_pc~0 (_ bv1 32))) (.cse12 (= (_ bv2 32) ~e_g~0)) (.cse13 (= ~c1_i~0 (_ bv1 32))) (.cse14 (= ~wb_pc~0 (_ bv1 32))) (.cse15 (= (_ bv0 32) ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse19 .cse20 .cse21 .cse22 .cse23 .cse11 .cse24 .cse12 .cse13 .cse15 .cse25) (and .cse16 .cse0 .cse1 .cse4 .cse5 .cse6 .cse18 .cse8 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse27 .cse12 .cse13 .cse15 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse30 .cse8 .cse19 .cse9 .cse20 .cse11 .cse31 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse32 .cse6 .cse29 .cse7 .cse30 .cse8 .cse19 .cse9 .cse11 .cse31 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse26 .cse21 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 .cse5 .cse6 .cse34 .cse7 .cse8 .cse19 .cse9 .cse26 .cse21 (= ~d~0 (_ bv1 32)) .cse35 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse36 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse26 .cse21 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse21 .cse37 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 .cse19 .cse9 .cse20 .cse26 .cse21 .cse23 .cse24 .cse27 .cse12 .cse13 .cse14 .cse15 .cse28) (and .cse36 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse38 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse34 .cse29 .cse7 .cse8 .cse19 .cse9 .cse20 .cse26 .cse21 .cse31 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse36 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse21 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse19 .cse9 .cse20 .cse21 .cse23 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25) (and .cse16 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse37 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse37 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~data~0 ~t_b~0) .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15)) .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse32 .cse6 .cse34 .cse29 .cse7 .cse8 .cse19 .cse9 .cse26 .cse21 .cse31 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse12 .cse13 .cse15 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse33 .cse4 .cse5 .cse6 .cse34 .cse7 .cse8 .cse19 .cse9 .cse20 .cse26 .cse21 .cse35 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse21 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse19 .cse9 .cse20 .cse26 .cse21 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse28) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse8 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24 .cse12 .cse13 .cse15 .cse25 .cse28) (and .cse16 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse20 .cse21 .cse23 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse19 .cse20 .cse21 .cse22 .cse23 .cse11 .cse24 .cse27 .cse12 .cse13 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse12 .cse13 .cse14 .cse15)))) [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 87 130) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point $Ultimate##254(lines 597 605) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L424-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 332) no Hoare annotation was computed. [2023-12-25 07:24:11,434 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point write_loop_returnLabel#1(lines 62 136) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L459-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point $Ultimate##159(lines 159 174) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 170) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 170) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L625(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 289 402) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L659-1(lines 545 685) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point $Ultimate##219(lines 273 281) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L429-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 239) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 78) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L496(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L529-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 282) no Hoare annotation was computed. [2023-12-25 07:24:11,435 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2023-12-25 07:24:11,436 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 406 690) no Hoare annotation was computed. [2023-12-25 07:24:11,436 INFO L899 garLoopResultBuilder]: For program point L299(lines 298 396) no Hoare annotation was computed. [2023-12-25 07:24:11,436 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2023-12-25 07:24:11,438 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:24:11,440 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:24:11,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:24:11 BoogieIcfgContainer [2023-12-25 07:24:11,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:24:11,524 INFO L158 Benchmark]: Toolchain (without parser) took 265825.61ms. Allocated memory was 223.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 170.8MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-12-25 07:24:11,524 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 223.3MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:24:11,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.84ms. Allocated memory is still 223.3MB. Free memory was 170.5MB in the beginning and 154.6MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-25 07:24:11,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.73ms. Allocated memory is still 223.3MB. Free memory was 154.6MB in the beginning and 152.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:24:11,525 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 223.3MB. Free memory was 152.2MB in the beginning and 149.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:24:11,525 INFO L158 Benchmark]: RCFGBuilder took 660.98ms. Allocated memory is still 223.3MB. Free memory was 149.1MB in the beginning and 167.1MB in the end (delta: -18.0MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2023-12-25 07:24:11,525 INFO L158 Benchmark]: TraceAbstraction took 264821.71ms. Allocated memory was 223.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 166.6MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-12-25 07:24:11,526 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.37ms. Allocated memory is still 223.3MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.84ms. Allocated memory is still 223.3MB. Free memory was 170.5MB in the beginning and 154.6MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.73ms. Allocated memory is still 223.3MB. Free memory was 154.6MB in the beginning and 152.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 223.3MB. Free memory was 152.2MB in the beginning and 149.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 660.98ms. Allocated memory is still 223.3MB. Free memory was 149.1MB in the beginning and 167.1MB in the end (delta: -18.0MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * TraceAbstraction took 264821.71ms. Allocated memory was 223.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 166.6MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: 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, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 264.7s, OverallIterations: 36, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 224.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12936 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12936 mSDsluCounter, 27083 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19280 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3350 IncrementalHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 7803 mSDtfsCounter, 3350 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3809 GetRequests, 3623 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3303 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27295occurred in iteration=34, InterpolantAutomatonStates: 241, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 61794 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 489 NumberOfFragments, 9208 HoareAnnotationTreeSize, 6 FormulaSimplifications, 2636280 FormulaSimplificationTreeSizeReduction, 198.9s HoareSimplificationTime, 6 FormulaSimplificationsInter, 717340 FormulaSimplificationTreeSizeReductionInter, 25.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3310 NumberOfCodeBlocks, 3310 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3638 ConstructedInterpolants, 0 QuantifiedInterpolants, 7157 SizeOfPredicates, 28 NumberOfNonLiveVariables, 5797 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 38 InterpolantComputations, 34 PerfectInterpolantSequences, 1491/1755 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: 545]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || ((((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (2 == c1_st)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((c == ((1 + t_b) % 4294967296)) && ((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || ((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)))) && (((1 + t_b) % 4294967296) == c_t))) || ((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (((2 + t_b) % 4294967296) == c)) && (2 == e_c)) && (((2 + t_b) % 4294967296) == c_t)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((2 == e_f) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || ((((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || ((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((2 == e_f) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((2 == e_f) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (c2_pc == 0))) || (((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == data)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == data)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (c2_st == 0)) && (0 == processed)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == c_t)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (c2_st == 0)) && (0 == processed)) && (d == 1)) && (c == 1)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (c2_st == 0)) && (0 == processed)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == processed)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (data == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (c2_pc == 0))) || ((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (((1 + t_b) % 4294967296) == c_t)) && (0 == r_i))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (0 == processed)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (0 == processed)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) && (((1 + t_b) % 4294967296) == c_t))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (c2_st == 0)) && (0 == processed)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((2 == e_f) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (0 == processed)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == c_t)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (c == 1)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (c2_st == 0)) && (0 == processed)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || (((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i))) || (((((((((((((2 == e_f) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) && (((2 + t_b) % 4294967296) == data)) || ((data == t_b) && ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))))) || ((data == ((1 + t_b) % 4294967296)) && ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))))) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (0 == processed)) && (c1_st == 0)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i))) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (0 == processed)) && (2 == c1_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i))) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == processed)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (0 == processed)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (c1_st == 0)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == data)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) && (((1 + t_b) % 4294967296) == c_t))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (0 == processed)) && (c1_st == 0)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == c_t)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (c == 1)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((2 == e_f) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (2 == wb_st)) && (0 == processed)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (((1 + t_b) % 4294967296) == c_t)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == data)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (2 == c1_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (2 == c1_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (0 == processed)) && (c1_st == 0)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((2 == e_f) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == c_t)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (0 == processed)) && (d == 1)) && (c == 1)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == processed)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (((1 + t_b) % 4294967296) == c_t)) && (0 == r_i)) || (((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (c2_pc == 0))) || ((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (((2 + t_b) % 4294967296) == c_t)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (2 == c2_st)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || (((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i))) || ((((((((((2 == e_f) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || ((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (c2_pc == 0))) || ((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (c2_st == 0)) && (2 == c1_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || ((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (c2_st == 0)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (((1 + t_b) % 4294967296) == c_t)) && (0 == r_i))) || (((((((((((((2 == e_f) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (2 == c2_st)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || (((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (c2_st == 0)) && (2 == c1_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == processed)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (((1 + t_b) % 4294967296) == c_t)) && (0 == r_i))) || ((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((c == ((1 + t_b) % 4294967296)) && (d == ((1 + t_b) % 4294967296))) && (((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || (((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)))) && (((1 + t_b) % 4294967296) == c_t))) || ((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (c2_st == 0)) && (0 == processed)) && (c1_st == 0)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (2 == c1_st)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (0 == processed)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (c2_pc == 0))) || ((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (c2_pc == 0))) || (((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (d == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (0 == processed)) && (c1_st == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || (((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == processed)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) && (((1 + t_b) % 4294967296) == c_t))) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (2 == c1_st)) && (data == 0)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((c == ((1 + t_b) % 4294967296)) && ((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) || ((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)))) && (((1 + t_b) % 4294967296) == c_t))) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (0 == processed)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (c2_st == 0)) && (2 == c1_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (((1 + t_b) % 4294967296) == c_t)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (((2 + t_b) % 4294967296) == c)) && (2 == e_c)) && (((2 + t_b) % 4294967296) == c_t)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((2 == e_f) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (data == 0)) && (c1_st == 0)) && (2 == c2_st)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (2 == c2_st)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0))) || (((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (((2 + t_b) % 4294967296) == c_t)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (2 == c2_st)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i))) || ((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (1 == c2_pc)) && (2 == e_e)) && !((wl_pc == 2))) && (0 == processed)) && (c1_st == 0)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (wb_pc == 0)) && (data == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (c2_pc == 0))) || ((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (data == 0)) && (c1_st == 0)) && (2 == c2_st)) && (c1_pc == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (wb_st == 0)) && (2 == e_e)) && (0 == t_b)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (wb_pc == 0)) && (data == 0)) && (c1_st == 0)) && (c1_pc == 0)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (0 == r_i)) && (wl_pc == 0)) && (c2_pc == 0))) || (((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (0 == processed)) && (c1_st == 0)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((c_req_up == 0) && (data == ((1 + t_b) % 4294967296))) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (((2 + t_b) % 4294967296) == data)) && (2 == c2_st)) && (((2 + t_b) % 4294967296) == c)) && (2 == e_c)) && (((2 + t_b) % 4294967296) == c_t)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (((2 + t_b) % 4294967296) == d))) || ((((((((((((((((((((c_req_up == 0) && (wl_st == 0)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (c2_i == 1)) && (data == t_b)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || ((((((((((((((((2 == e_f) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && !((wl_pc == 2))) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((2 == e_f) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) || (((((((((((((((((((data == ((1 + t_b) % 4294967296)) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (1 == c2_pc)) && (2 == e_e)) && (2 == wb_st)) && (2 == c1_st)) && (2 == c2_st)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (((1 + t_b) % 4294967296) == c_t)) && (0 == r_i))) || ((((((((((((((((((((((c_req_up == 0) && (2 == r_st)) && (2 == e_f)) && (1 == c1_pc)) && (1 == wb_i)) && (wl_st == 2)) && (c2_i == 1)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (d == 0)) && (c2_st == 0)) && (0 == processed)) && (2 == c1_st)) && (data == 0)) && (2 == e_c)) && (wl_pc == 1)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i)) && (c2_pc == 0))) || (((((((((((((((((((((((2 == r_st) && (2 == e_f)) && (1 == c1_pc)) && (2 == e_wl)) && (1 == wb_i)) && (wl_st == 2)) && (d == 2)) && (c2_i == 1)) && (data == 1)) && (c == 2)) && (1 == c2_pc)) && (2 == e_e)) && (0 == t_b)) && (2 == wb_st)) && (0 == processed)) && (c1_st == 0)) && (2 == c2_st)) && (2 == c_t)) && (2 == e_c)) && (2 == e_g)) && (c1_i == 1)) && (wb_pc == 1)) && (0 == r_i))) RESULT: Ultimate proved your program to be correct! [2023-12-25 07:24:11,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...