/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/mem_slave_tlm.2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:10:29,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:10:29,747 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:10:29,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:10:29,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:10:29,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:10:29,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:10:29,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:10:29,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:10:29,766 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:10:29,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:10:29,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:10:29,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:10:29,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:10:29,767 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:10:29,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:10:29,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:10:29,768 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:10:29,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:10:29,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:10:29,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:10:29,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:10:29,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:10:29,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:10:29,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:10:29,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:10:29,770 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:10:29,770 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:10:29,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:10:29,771 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:10:29,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:10:29,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:10:29,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:10:29,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:10:29,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:10:29,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:10:29,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:10:29,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:10:29,772 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:10:29,772 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:10:29,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:10:29,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:10:29,773 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:10:29,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:10:29,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:10:29,773 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:10:29,773 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:10:29,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:10:29,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:10:29,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:10:29,920 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:10:29,920 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:10:29,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.2.cil.c [2023-12-25 07:10:30,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:10:31,128 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:10:31,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.2.cil.c [2023-12-25 07:10:31,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d863dda2/f6ddbea9a2c645b6b11a1e67c781fa77/FLAGad33bbc74 [2023-12-25 07:10:31,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d863dda2/f6ddbea9a2c645b6b11a1e67c781fa77 [2023-12-25 07:10:31,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:10:31,153 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:10:31,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:10:31,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:10:31,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:10:31,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1234b03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31, skipping insertion in model container [2023-12-25 07:10:31,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,209 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:10:31,327 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/mem_slave_tlm.2.cil.c[646,659] [2023-12-25 07:10:31,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:10:31,411 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:10:31,419 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/mem_slave_tlm.2.cil.c[646,659] [2023-12-25 07:10:31,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:10:31,485 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:10:31,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31 WrapperNode [2023-12-25 07:10:31,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:10:31,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:10:31,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:10:31,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:10:31,491 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:10:31" (1/1) ... [2023-12-25 07:10:31,502 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:10:31" (1/1) ... [2023-12-25 07:10:31,533 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 849 [2023-12-25 07:10:31,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:10:31,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:10:31,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:10:31,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:10:31,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,570 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:10:31,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:10:31,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:10:31,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:10:31,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:10:31,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (1/1) ... [2023-12-25 07:10:31,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:10:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:10:31,690 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:10:31,707 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:10:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:10:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:10:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-25 07:10:31,715 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-25 07:10:31,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:10:31,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:10:31,801 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:10:31,803 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:10:32,430 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:10:32,480 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:10:32,480 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-12-25 07:10:32,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:10:32 BoogieIcfgContainer [2023-12-25 07:10:32,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:10:32,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:10:32,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:10:32,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:10:32,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:10:31" (1/3) ... [2023-12-25 07:10:32,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f9198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:10:32, skipping insertion in model container [2023-12-25 07:10:32,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:10:31" (2/3) ... [2023-12-25 07:10:32,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f9198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:10:32, skipping insertion in model container [2023-12-25 07:10:32,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:10:32" (3/3) ... [2023-12-25 07:10:32,488 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2023-12-25 07:10:32,500 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:10:32,500 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:10:32,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:10:32,550 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;@62fd664a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:10:32,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:10:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 241 states have (on average 1.937759336099585) internal successors, (467), 247 states have internal predecessors, (467), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 07:10:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-25 07:10:32,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:32,570 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] [2023-12-25 07:10:32,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:32,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1846885785, now seen corresponding path program 1 times [2023-12-25 07:10:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:32,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687190741] [2023-12-25 07:10:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:32,587 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:10:32,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:32,589 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:10:32,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 07:10:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:32,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 07:10:32,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:32,696 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:10:32,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:32,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687190741] [2023-12-25 07:10:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687190741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:32,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724337837] [2023-12-25 07:10:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:32,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 07:10:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 07:10:32,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:10:32,732 INFO L87 Difference]: Start difference. First operand has 249 states, 241 states have (on average 1.937759336099585) internal successors, (467), 247 states have internal predecessors, (467), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:32,821 INFO L93 Difference]: Finished difference Result 478 states and 917 transitions. [2023-12-25 07:10:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 07:10:32,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-25 07:10:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:32,834 INFO L225 Difference]: With dead ends: 478 [2023-12-25 07:10:32,835 INFO L226 Difference]: Without dead ends: 246 [2023-12-25 07:10:32,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:10:32,840 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:32,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-25 07:10:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2023-12-25 07:10:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 240 states have (on average 1.825) internal successors, (438), 244 states have internal predecessors, (438), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 443 transitions. [2023-12-25 07:10:32,886 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 443 transitions. Word has length 26 [2023-12-25 07:10:32,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:32,887 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 443 transitions. [2023-12-25 07:10:32,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 443 transitions. [2023-12-25 07:10:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 07:10:32,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:32,889 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] [2023-12-25 07:10:32,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:33,091 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:10:33,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:33,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash 471027554, now seen corresponding path program 1 times [2023-12-25 07:10:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:33,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59600899] [2023-12-25 07:10:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:33,093 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:10:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:33,094 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:10:33,096 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:10:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:33,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:33,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:33,260 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:10:33,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:33,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:33,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59600899] [2023-12-25 07:10:33,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59600899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:33,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:33,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802640196] [2023-12-25 07:10:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:33,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:33,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:33,265 INFO L87 Difference]: Start difference. First operand 246 states and 443 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:33,596 INFO L93 Difference]: Finished difference Result 649 states and 1153 transitions. [2023-12-25 07:10:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-25 07:10:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:33,598 INFO L225 Difference]: With dead ends: 649 [2023-12-25 07:10:33,598 INFO L226 Difference]: Without dead ends: 407 [2023-12-25 07:10:33,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:10:33,600 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 231 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:33,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 692 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:10:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-12-25 07:10:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 400. [2023-12-25 07:10:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 394 states have (on average 1.6370558375634519) internal successors, (645), 398 states have internal predecessors, (645), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 650 transitions. [2023-12-25 07:10:33,613 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 650 transitions. Word has length 27 [2023-12-25 07:10:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:33,614 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 650 transitions. [2023-12-25 07:10:33,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 650 transitions. [2023-12-25 07:10:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 07:10:33,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:33,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:33,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 07:10:33,817 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:10:33,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:33,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 242253487, now seen corresponding path program 1 times [2023-12-25 07:10:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377088180] [2023-12-25 07:10:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:33,821 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:10:33,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:33,824 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:10:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 07:10:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:33,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:33,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:33,888 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:10:33,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:33,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:33,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377088180] [2023-12-25 07:10:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377088180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410178951] [2023-12-25 07:10:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:33,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:33,890 INFO L87 Difference]: Start difference. First operand 400 states and 650 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:34,029 INFO L93 Difference]: Finished difference Result 1048 states and 1728 transitions. [2023-12-25 07:10:34,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:34,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-25 07:10:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:34,032 INFO L225 Difference]: With dead ends: 1048 [2023-12-25 07:10:34,032 INFO L226 Difference]: Without dead ends: 661 [2023-12-25 07:10:34,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:34,034 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 308 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:34,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 924 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-12-25 07:10:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 654. [2023-12-25 07:10:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 648 states have (on average 1.6682098765432098) internal successors, (1081), 652 states have internal predecessors, (1081), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1086 transitions. [2023-12-25 07:10:34,048 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1086 transitions. Word has length 36 [2023-12-25 07:10:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:34,049 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 1086 transitions. [2023-12-25 07:10:34,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1086 transitions. [2023-12-25 07:10:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 07:10:34,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:34,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:34,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:34,252 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:10:34,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:34,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1958989152, now seen corresponding path program 1 times [2023-12-25 07:10:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:34,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154033249] [2023-12-25 07:10:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:34,254 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:10:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:34,255 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:10:34,279 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:10:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:34,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:34,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:34,340 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:10:34,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:34,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:34,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154033249] [2023-12-25 07:10:34,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154033249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:34,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:34,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471492916] [2023-12-25 07:10:34,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:34,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:34,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:34,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:34,347 INFO L87 Difference]: Start difference. First operand 654 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:34,423 INFO L93 Difference]: Finished difference Result 1644 states and 2735 transitions. [2023-12-25 07:10:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-25 07:10:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:34,428 INFO L225 Difference]: With dead ends: 1644 [2023-12-25 07:10:34,428 INFO L226 Difference]: Without dead ends: 1014 [2023-12-25 07:10:34,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:34,430 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 332 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:34,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 734 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2023-12-25 07:10:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1003. [2023-12-25 07:10:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 997 states have (on average 1.6639919759277833) internal successors, (1659), 1001 states have internal predecessors, (1659), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1664 transitions. [2023-12-25 07:10:34,451 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1664 transitions. Word has length 37 [2023-12-25 07:10:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:34,451 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1664 transitions. [2023-12-25 07:10:34,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1664 transitions. [2023-12-25 07:10:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-25 07:10:34,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:34,452 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] [2023-12-25 07:10:34,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:34,662 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:10:34,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:34,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1906881250, now seen corresponding path program 1 times [2023-12-25 07:10:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:34,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187359921] [2023-12-25 07:10:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:34,664 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:10:34,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:34,665 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:10:34,668 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:10:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:34,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:34,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:34,750 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:10:34,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:34,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187359921] [2023-12-25 07:10:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187359921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946997453] [2023-12-25 07:10:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:34,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:34,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:34,752 INFO L87 Difference]: Start difference. First operand 1003 states and 1664 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:34,850 INFO L93 Difference]: Finished difference Result 2660 states and 4424 transitions. [2023-12-25 07:10:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:34,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-25 07:10:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:34,856 INFO L225 Difference]: With dead ends: 2660 [2023-12-25 07:10:34,856 INFO L226 Difference]: Without dead ends: 1681 [2023-12-25 07:10:34,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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:10:34,858 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 306 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:34,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 862 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2023-12-25 07:10:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1661. [2023-12-25 07:10:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1655 states have (on average 1.6634441087613292) internal successors, (2753), 1659 states have internal predecessors, (2753), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2758 transitions. [2023-12-25 07:10:34,894 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2758 transitions. Word has length 43 [2023-12-25 07:10:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:34,895 INFO L495 AbstractCegarLoop]: Abstraction has 1661 states and 2758 transitions. [2023-12-25 07:10:34,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2758 transitions. [2023-12-25 07:10:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 07:10:34,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:34,896 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:10:34,912 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:10:35,099 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:10:35,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:35,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1913337657, now seen corresponding path program 1 times [2023-12-25 07:10:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:35,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190613157] [2023-12-25 07:10:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:35,100 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:10:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:35,101 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:10:35,102 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:10:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:35,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:35,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:35,222 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:10:35,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:35,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190613157] [2023-12-25 07:10:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190613157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:35,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820983938] [2023-12-25 07:10:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:35,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:35,224 INFO L87 Difference]: Start difference. First operand 1661 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:35,389 INFO L93 Difference]: Finished difference Result 3302 states and 5484 transitions. [2023-12-25 07:10:35,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:35,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:10:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:35,394 INFO L225 Difference]: With dead ends: 3302 [2023-12-25 07:10:35,394 INFO L226 Difference]: Without dead ends: 1665 [2023-12-25 07:10:35,396 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:10:35,396 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 396 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:35,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 942 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2023-12-25 07:10:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1559. [2023-12-25 07:10:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1553 states have (on average 1.6413393432066967) internal successors, (2549), 1557 states have internal predecessors, (2549), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2554 transitions. [2023-12-25 07:10:35,477 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2554 transitions. Word has length 53 [2023-12-25 07:10:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:35,477 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2554 transitions. [2023-12-25 07:10:35,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2554 transitions. [2023-12-25 07:10:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 07:10:35,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:35,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:35,500 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 (7)] Ended with exit code 0 [2023-12-25 07:10:35,680 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:10:35,681 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:35,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 478554798, now seen corresponding path program 1 times [2023-12-25 07:10:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383771739] [2023-12-25 07:10:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:35,682 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:10:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:35,697 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:10:35,762 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:10:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:35,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:35,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:35,832 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:10:35,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:35,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:35,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383771739] [2023-12-25 07:10:35,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383771739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:35,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:35,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:35,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595415114] [2023-12-25 07:10:35,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:35,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:35,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:35,834 INFO L87 Difference]: Start difference. First operand 1559 states and 2554 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:35,998 INFO L93 Difference]: Finished difference Result 4044 states and 6590 transitions. [2023-12-25 07:10:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-25 07:10:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:36,005 INFO L225 Difference]: With dead ends: 4044 [2023-12-25 07:10:36,005 INFO L226 Difference]: Without dead ends: 2503 [2023-12-25 07:10:36,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:10:36,008 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 349 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:36,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 735 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2023-12-25 07:10:36,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2460. [2023-12-25 07:10:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2454 states have (on average 1.5925020374898124) internal successors, (3908), 2458 states have internal predecessors, (3908), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3913 transitions. [2023-12-25 07:10:36,077 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3913 transitions. Word has length 55 [2023-12-25 07:10:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:36,077 INFO L495 AbstractCegarLoop]: Abstraction has 2460 states and 3913 transitions. [2023-12-25 07:10:36,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3913 transitions. [2023-12-25 07:10:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 07:10:36,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:36,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:36,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 07:10:36,280 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:10:36,281 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:36,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash 524791694, now seen corresponding path program 1 times [2023-12-25 07:10:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:36,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089604753] [2023-12-25 07:10:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:36,282 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:10:36,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:36,283 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:10:36,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 07:10:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:36,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:36,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:10:36,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:36,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:36,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089604753] [2023-12-25 07:10:36,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089604753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:36,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:36,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230425684] [2023-12-25 07:10:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:36,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:36,364 INFO L87 Difference]: Start difference. First operand 2460 states and 3913 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:36,673 INFO L93 Difference]: Finished difference Result 5945 states and 9539 transitions. [2023-12-25 07:10:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:36,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-25 07:10:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:36,683 INFO L225 Difference]: With dead ends: 5945 [2023-12-25 07:10:36,683 INFO L226 Difference]: Without dead ends: 3550 [2023-12-25 07:10:36,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:10:36,686 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 233 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:36,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 775 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:10:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2023-12-25 07:10:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3527. [2023-12-25 07:10:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 3521 states have (on average 1.4987219539903436) internal successors, (5277), 3525 states have internal predecessors, (5277), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 5282 transitions. [2023-12-25 07:10:36,773 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 5282 transitions. Word has length 55 [2023-12-25 07:10:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:36,773 INFO L495 AbstractCegarLoop]: Abstraction has 3527 states and 5282 transitions. [2023-12-25 07:10:36,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 5282 transitions. [2023-12-25 07:10:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 07:10:36,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:36,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:36,785 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:10:36,977 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:10:36,977 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:36,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1311066694, now seen corresponding path program 1 times [2023-12-25 07:10:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:36,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365463024] [2023-12-25 07:10:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:36,978 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:10:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:36,979 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:10:36,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 (10)] Waiting until timeout for monitored process [2023-12-25 07:10:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:37,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:37,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:37,097 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:10:37,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:37,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365463024] [2023-12-25 07:10:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365463024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:37,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990866281] [2023-12-25 07:10:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:37,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:37,098 INFO L87 Difference]: Start difference. First operand 3527 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:37,221 INFO L93 Difference]: Finished difference Result 6926 states and 10392 transitions. [2023-12-25 07:10:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:37,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-25 07:10:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:37,231 INFO L225 Difference]: With dead ends: 6926 [2023-12-25 07:10:37,231 INFO L226 Difference]: Without dead ends: 3464 [2023-12-25 07:10:37,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:37,236 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 321 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:37,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 394 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2023-12-25 07:10:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3464. [2023-12-25 07:10:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3464 states, 3458 states have (on average 1.470213996529786) internal successors, (5084), 3462 states have internal predecessors, (5084), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 5089 transitions. [2023-12-25 07:10:37,372 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 5089 transitions. Word has length 57 [2023-12-25 07:10:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:37,372 INFO L495 AbstractCegarLoop]: Abstraction has 3464 states and 5089 transitions. [2023-12-25 07:10:37,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 5089 transitions. [2023-12-25 07:10:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 07:10:37,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:37,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:37,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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:37,576 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:10:37,576 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:37,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1296691314, now seen corresponding path program 1 times [2023-12-25 07:10:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633947738] [2023-12-25 07:10:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:10:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:37,595 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:10:37,599 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:10:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:37,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:37,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:37,669 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:10:37,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:37,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:37,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633947738] [2023-12-25 07:10:37,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633947738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:37,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534585328] [2023-12-25 07:10:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:37,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:37,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:37,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:37,671 INFO L87 Difference]: Start difference. First operand 3464 states and 5089 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:37,798 INFO L93 Difference]: Finished difference Result 7534 states and 11061 transitions. [2023-12-25 07:10:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:37,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-25 07:10:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:37,809 INFO L225 Difference]: With dead ends: 7534 [2023-12-25 07:10:37,809 INFO L226 Difference]: Without dead ends: 4090 [2023-12-25 07:10:37,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:10:37,814 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 217 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:37,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 890 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2023-12-25 07:10:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 3173. [2023-12-25 07:10:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 3167 states have (on average 1.4748973792232396) internal successors, (4671), 3171 states have internal predecessors, (4671), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4676 transitions. [2023-12-25 07:10:37,899 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4676 transitions. Word has length 58 [2023-12-25 07:10:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:37,899 INFO L495 AbstractCegarLoop]: Abstraction has 3173 states and 4676 transitions. [2023-12-25 07:10:37,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4676 transitions. [2023-12-25 07:10:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-25 07:10:37,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:37,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:37,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 07:10:38,110 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:10:38,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:38,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1299520037, now seen corresponding path program 1 times [2023-12-25 07:10:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:38,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545580065] [2023-12-25 07:10:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:38,112 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:10:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:38,129 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:10:38,175 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:10:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:38,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:10:38,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:38,312 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:10:38,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:38,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545580065] [2023-12-25 07:10:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545580065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:38,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:10:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679693814] [2023-12-25 07:10:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:38,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:10:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:10:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:10:38,313 INFO L87 Difference]: Start difference. First operand 3173 states and 4676 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:38,597 INFO L93 Difference]: Finished difference Result 8870 states and 13180 transitions. [2023-12-25 07:10:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 07:10:38,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-25 07:10:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:38,627 INFO L225 Difference]: With dead ends: 8870 [2023-12-25 07:10:38,628 INFO L226 Difference]: Without dead ends: 6546 [2023-12-25 07:10:38,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:10:38,633 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 721 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:38,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 2147 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2023-12-25 07:10:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 4658. [2023-12-25 07:10:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4658 states, 4652 states have (on average 1.473774720550301) internal successors, (6856), 4656 states have internal predecessors, (6856), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 6861 transitions. [2023-12-25 07:10:38,811 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 6861 transitions. Word has length 60 [2023-12-25 07:10:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:38,811 INFO L495 AbstractCegarLoop]: Abstraction has 4658 states and 6861 transitions. [2023-12-25 07:10:38,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 6861 transitions. [2023-12-25 07:10:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 07:10:38,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:38,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:38,828 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:10:39,015 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:10:39,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:39,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1129675064, now seen corresponding path program 1 times [2023-12-25 07:10:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:39,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054300602] [2023-12-25 07:10:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:39,016 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:10:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:39,017 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:10:39,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 07:10:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:39,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:10:39,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:39,130 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:10:39,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:39,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054300602] [2023-12-25 07:10:39,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054300602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:39,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:39,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 07:10:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058152358] [2023-12-25 07:10:39,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:39,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 07:10:39,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:39,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 07:10:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:10:39,131 INFO L87 Difference]: Start difference. First operand 4658 states and 6861 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:39,579 INFO L93 Difference]: Finished difference Result 12316 states and 18131 transitions. [2023-12-25 07:10:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 07:10:39,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-25 07:10:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:39,594 INFO L225 Difference]: With dead ends: 12316 [2023-12-25 07:10:39,594 INFO L226 Difference]: Without dead ends: 8991 [2023-12-25 07:10:39,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:10:39,600 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1087 mSDsluCounter, 2690 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 3290 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:39,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 3290 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:10:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8991 states. [2023-12-25 07:10:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8991 to 6276. [2023-12-25 07:10:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6276 states, 6270 states have (on average 1.4669856459330144) internal successors, (9198), 6274 states have internal predecessors, (9198), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 9203 transitions. [2023-12-25 07:10:39,831 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 9203 transitions. Word has length 61 [2023-12-25 07:10:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:39,831 INFO L495 AbstractCegarLoop]: Abstraction has 6276 states and 9203 transitions. [2023-12-25 07:10:39,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 9203 transitions. [2023-12-25 07:10:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 07:10:39,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:39,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:39,837 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:10:40,037 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:10:40,037 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:40,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -606569739, now seen corresponding path program 1 times [2023-12-25 07:10:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393698498] [2023-12-25 07:10:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:40,038 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:10:40,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:40,039 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:10:40,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 07:10:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:40,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:40,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:10:40,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:40,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393698498] [2023-12-25 07:10:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393698498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:40,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:10:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809041402] [2023-12-25 07:10:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:40,141 INFO L87 Difference]: Start difference. First operand 6276 states and 9203 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:40,302 INFO L93 Difference]: Finished difference Result 10024 states and 14898 transitions. [2023-12-25 07:10:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-25 07:10:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:40,309 INFO L225 Difference]: With dead ends: 10024 [2023-12-25 07:10:40,309 INFO L226 Difference]: Without dead ends: 3804 [2023-12-25 07:10:40,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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:10:40,317 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 328 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:40,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 605 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2023-12-25 07:10:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3434. [2023-12-25 07:10:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 3428 states have (on average 1.5037922987164527) internal successors, (5155), 3432 states have internal predecessors, (5155), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 5160 transitions. [2023-12-25 07:10:40,443 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 5160 transitions. Word has length 96 [2023-12-25 07:10:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:40,443 INFO L495 AbstractCegarLoop]: Abstraction has 3434 states and 5160 transitions. [2023-12-25 07:10:40,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 5160 transitions. [2023-12-25 07:10:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-25 07:10:40,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:40,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:40,451 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:10:40,649 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:10:40,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:40,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1927521292, now seen corresponding path program 1 times [2023-12-25 07:10:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604008633] [2023-12-25 07:10:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:40,651 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:10:40,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:40,652 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:10:40,679 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:10:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:40,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:40,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 07:10:40,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:40,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:40,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604008633] [2023-12-25 07:10:40,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604008633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:40,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:40,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:40,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910273597] [2023-12-25 07:10:40,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:40,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:40,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:40,733 INFO L87 Difference]: Start difference. First operand 3434 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:40,907 INFO L93 Difference]: Finished difference Result 8523 states and 12776 transitions. [2023-12-25 07:10:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:40,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:10:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:40,916 INFO L225 Difference]: With dead ends: 8523 [2023-12-25 07:10:40,916 INFO L226 Difference]: Without dead ends: 5007 [2023-12-25 07:10:40,921 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:10:40,922 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 278 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:40,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 894 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2023-12-25 07:10:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 4943. [2023-12-25 07:10:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4943 states, 4937 states have (on average 1.491796637634191) internal successors, (7365), 4941 states have internal predecessors, (7365), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 7370 transitions. [2023-12-25 07:10:41,086 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 7370 transitions. Word has length 133 [2023-12-25 07:10:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:41,086 INFO L495 AbstractCegarLoop]: Abstraction has 4943 states and 7370 transitions. [2023-12-25 07:10:41,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 7370 transitions. [2023-12-25 07:10:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 07:10:41,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:41,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:41,104 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:10:41,294 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:10:41,294 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:41,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 425572113, now seen corresponding path program 1 times [2023-12-25 07:10:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944804774] [2023-12-25 07:10:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:41,295 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:10:41,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:41,296 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:10:41,332 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:10:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:41,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:41,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 07:10:41,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:41,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944804774] [2023-12-25 07:10:41,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944804774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:41,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514848093] [2023-12-25 07:10:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:41,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:41,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:41,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:41,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:41,418 INFO L87 Difference]: Start difference. First operand 4943 states and 7370 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:41,719 INFO L93 Difference]: Finished difference Result 12959 states and 19213 transitions. [2023-12-25 07:10:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-25 07:10:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:41,730 INFO L225 Difference]: With dead ends: 12959 [2023-12-25 07:10:41,731 INFO L226 Difference]: Without dead ends: 8117 [2023-12-25 07:10:41,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 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:10:41,736 INFO L413 NwaCegarLoop]: 645 mSDtfsCounter, 332 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:41,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 966 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8117 states. [2023-12-25 07:10:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8117 to 8068. [2023-12-25 07:10:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8068 states, 8062 states have (on average 1.424956586454974) internal successors, (11488), 8066 states have internal predecessors, (11488), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11493 transitions. [2023-12-25 07:10:42,011 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11493 transitions. Word has length 141 [2023-12-25 07:10:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:42,011 INFO L495 AbstractCegarLoop]: Abstraction has 8068 states and 11493 transitions. [2023-12-25 07:10:42,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11493 transitions. [2023-12-25 07:10:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-25 07:10:42,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:42,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:42,031 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:10:42,222 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:10:42,222 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:42,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash -931768647, now seen corresponding path program 1 times [2023-12-25 07:10:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880938816] [2023-12-25 07:10:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:42,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:10:42,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:42,224 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:10:42,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 07:10:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:42,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:42,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 07:10:42,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:42,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880938816] [2023-12-25 07:10:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880938816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404951614] [2023-12-25 07:10:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:42,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:42,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:42,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:42,336 INFO L87 Difference]: Start difference. First operand 8068 states and 11493 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:42,502 INFO L93 Difference]: Finished difference Result 11714 states and 16870 transitions. [2023-12-25 07:10:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:42,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2023-12-25 07:10:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:42,507 INFO L225 Difference]: With dead ends: 11714 [2023-12-25 07:10:42,507 INFO L226 Difference]: Without dead ends: 3595 [2023-12-25 07:10:42,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 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:10:42,516 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 319 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:42,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 489 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2023-12-25 07:10:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3540. [2023-12-25 07:10:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 3534 states have (on average 1.3619128466327108) internal successors, (4813), 3538 states have internal predecessors, (4813), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4818 transitions. [2023-12-25 07:10:42,636 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4818 transitions. Word has length 142 [2023-12-25 07:10:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:42,636 INFO L495 AbstractCegarLoop]: Abstraction has 3540 states and 4818 transitions. [2023-12-25 07:10:42,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4818 transitions. [2023-12-25 07:10:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-25 07:10:42,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:42,638 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:10:42,643 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:10:42,841 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:10:42,841 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:42,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1357555119, now seen corresponding path program 1 times [2023-12-25 07:10:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688841763] [2023-12-25 07:10:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:42,843 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:10:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:42,844 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:10:42,845 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:10:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:42,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:42,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:10:43,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:43,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688841763] [2023-12-25 07:10:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688841763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:43,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:43,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:43,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090805036] [2023-12-25 07:10:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:43,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:43,026 INFO L87 Difference]: Start difference. First operand 3540 states and 4818 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:43,130 INFO L93 Difference]: Finished difference Result 6280 states and 8569 transitions. [2023-12-25 07:10:43,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:43,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2023-12-25 07:10:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:43,133 INFO L225 Difference]: With dead ends: 6280 [2023-12-25 07:10:43,134 INFO L226 Difference]: Without dead ends: 2776 [2023-12-25 07:10:43,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 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:10:43,138 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 248 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:43,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 383 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:10:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2023-12-25 07:10:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2592. [2023-12-25 07:10:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2586 states have (on average 1.3333333333333333) internal successors, (3448), 2590 states have internal predecessors, (3448), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3453 transitions. [2023-12-25 07:10:43,219 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3453 transitions. Word has length 148 [2023-12-25 07:10:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:43,219 INFO L495 AbstractCegarLoop]: Abstraction has 2592 states and 3453 transitions. [2023-12-25 07:10:43,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3453 transitions. [2023-12-25 07:10:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-25 07:10:43,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:43,221 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:43,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-25 07:10:43,423 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:10:43,424 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:43,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2041407437, now seen corresponding path program 1 times [2023-12-25 07:10:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:43,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385468871] [2023-12-25 07:10:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:43,425 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:10:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:43,426 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:10:43,429 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:10:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:43,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:10:43,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:10:43,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:10:43,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385468871] [2023-12-25 07:10:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385468871] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:43,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-25 07:10:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217374697] [2023-12-25 07:10:43,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:43,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 07:10:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 07:10:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 07:10:43,779 INFO L87 Difference]: Start difference. First operand 2592 states and 3453 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:44,064 INFO L93 Difference]: Finished difference Result 6675 states and 8989 transitions. [2023-12-25 07:10:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 07:10:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2023-12-25 07:10:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:44,071 INFO L225 Difference]: With dead ends: 6675 [2023-12-25 07:10:44,071 INFO L226 Difference]: Without dead ends: 4271 [2023-12-25 07:10:44,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-25 07:10:44,074 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 773 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:44,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2796 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:10:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2023-12-25 07:10:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3635. [2023-12-25 07:10:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3635 states, 3629 states have (on average 1.3466519702397355) internal successors, (4887), 3633 states have internal predecessors, (4887), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4892 transitions. [2023-12-25 07:10:44,200 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4892 transitions. Word has length 151 [2023-12-25 07:10:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:44,200 INFO L495 AbstractCegarLoop]: Abstraction has 3635 states and 4892 transitions. [2023-12-25 07:10:44,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4892 transitions. [2023-12-25 07:10:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 07:10:44,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:44,202 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:44,207 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:10:44,407 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:10:44,407 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:44,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash -132077224, now seen corresponding path program 1 times [2023-12-25 07:10:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252308815] [2023-12-25 07:10:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:44,408 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:10:44,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:44,409 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:10:44,412 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:10:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:44,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:10:44,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:10:44,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 07:10:44,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:44,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252308815] [2023-12-25 07:10:44,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252308815] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:44,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:44,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-12-25 07:10:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31274867] [2023-12-25 07:10:44,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:44,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:10:44,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:44,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:10:44,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:10:44,822 INFO L87 Difference]: Start difference. First operand 3635 states and 4892 transitions. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:45,261 INFO L93 Difference]: Finished difference Result 7718 states and 10346 transitions. [2023-12-25 07:10:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 07:10:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2023-12-25 07:10:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:45,269 INFO L225 Difference]: With dead ends: 7718 [2023-12-25 07:10:45,269 INFO L226 Difference]: Without dead ends: 4271 [2023-12-25 07:10:45,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-12-25 07:10:45,273 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 939 mSDsluCounter, 3201 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:45,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 3726 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:10:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2023-12-25 07:10:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3782. [2023-12-25 07:10:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3776 states have (on average 1.3421610169491525) internal successors, (5068), 3780 states have internal predecessors, (5068), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5073 transitions. [2023-12-25 07:10:45,442 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5073 transitions. Word has length 154 [2023-12-25 07:10:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:45,442 INFO L495 AbstractCegarLoop]: Abstraction has 3782 states and 5073 transitions. [2023-12-25 07:10:45,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5073 transitions. [2023-12-25 07:10:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-25 07:10:45,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:45,445 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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, 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] [2023-12-25 07:10:45,458 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:10:45,648 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:10:45,648 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:45,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2105079576, now seen corresponding path program 1 times [2023-12-25 07:10:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333381330] [2023-12-25 07:10:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:45,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:10:45,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:45,650 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:10:45,672 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:10:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:45,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:10:45,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 07:10:45,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:45,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333381330] [2023-12-25 07:10:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333381330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:45,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:10:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991607819] [2023-12-25 07:10:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:45,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:10:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:45,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:10:45,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:10:45,781 INFO L87 Difference]: Start difference. First operand 3782 states and 5073 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:45,941 INFO L93 Difference]: Finished difference Result 4821 states and 6406 transitions. [2023-12-25 07:10:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:10:45,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:10:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:45,948 INFO L225 Difference]: With dead ends: 4821 [2023-12-25 07:10:45,949 INFO L226 Difference]: Without dead ends: 1057 [2023-12-25 07:10:45,951 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:10:45,952 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 131 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:45,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 358 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-12-25 07:10:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 867. [2023-12-25 07:10:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 863 states have (on average 1.1031286210892237) internal successors, (952), 865 states have internal predecessors, (952), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 955 transitions. [2023-12-25 07:10:45,983 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 955 transitions. Word has length 246 [2023-12-25 07:10:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:45,985 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 955 transitions. [2023-12-25 07:10:45,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 955 transitions. [2023-12-25 07:10:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-25 07:10:45,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:45,987 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:10:45,990 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:10:46,190 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:10:46,190 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:46,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash 308126803, now seen corresponding path program 1 times [2023-12-25 07:10:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:46,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354756581] [2023-12-25 07:10:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:46,192 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:10:46,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:46,193 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:10:46,193 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:10:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:46,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 07:10:46,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 96 proven. 101 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:10:46,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 96 proven. 101 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:10:46,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:46,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354756581] [2023-12-25 07:10:46,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354756581] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:46,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:46,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-25 07:10:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797528913] [2023-12-25 07:10:46,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:46,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 07:10:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 07:10:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-25 07:10:46,812 INFO L87 Difference]: Start difference. First operand 867 states and 955 transitions. Second operand has 12 states, 12 states have (on average 35.5) internal successors, (426), 12 states have internal predecessors, (426), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:47,013 INFO L93 Difference]: Finished difference Result 1374 states and 1517 transitions. [2023-12-25 07:10:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 07:10:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 35.5) internal successors, (426), 12 states have internal predecessors, (426), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2023-12-25 07:10:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:47,015 INFO L225 Difference]: With dead ends: 1374 [2023-12-25 07:10:47,015 INFO L226 Difference]: Without dead ends: 968 [2023-12-25 07:10:47,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-12-25 07:10:47,015 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 930 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:47,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 2415 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2023-12-25 07:10:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 957. [2023-12-25 07:10:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 953 states have (on average 1.1049317943336832) internal successors, (1053), 955 states have internal predecessors, (1053), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1056 transitions. [2023-12-25 07:10:47,043 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1056 transitions. Word has length 249 [2023-12-25 07:10:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:47,044 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1056 transitions. [2023-12-25 07:10:47,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.5) internal successors, (426), 12 states have internal predecessors, (426), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1056 transitions. [2023-12-25 07:10:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2023-12-25 07:10:47,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:47,047 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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, 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] [2023-12-25 07:10:47,066 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:10:47,250 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:10:47,251 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:47,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -985731691, now seen corresponding path program 1 times [2023-12-25 07:10:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412029008] [2023-12-25 07:10:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:47,252 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:10:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:47,253 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:10:47,253 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:10:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:47,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:10:47,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 07:10:47,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:47,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412029008] [2023-12-25 07:10:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412029008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:47,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:47,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 07:10:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847279172] [2023-12-25 07:10:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:47,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 07:10:47,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:47,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 07:10:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:10:47,432 INFO L87 Difference]: Start difference. First operand 957 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:47,573 INFO L93 Difference]: Finished difference Result 1269 states and 1396 transitions. [2023-12-25 07:10:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:10:47,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2023-12-25 07:10:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:47,575 INFO L225 Difference]: With dead ends: 1269 [2023-12-25 07:10:47,575 INFO L226 Difference]: Without dead ends: 970 [2023-12-25 07:10:47,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-25 07:10:47,576 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 218 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:47,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1362 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2023-12-25 07:10:47,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 955. [2023-12-25 07:10:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 951 states have (on average 1.1009463722397477) internal successors, (1047), 953 states have internal predecessors, (1047), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1050 transitions. [2023-12-25 07:10:47,605 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1050 transitions. Word has length 251 [2023-12-25 07:10:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:47,605 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1050 transitions. [2023-12-25 07:10:47,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1050 transitions. [2023-12-25 07:10:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-25 07:10:47,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:47,607 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 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, 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] [2023-12-25 07:10:47,612 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:10:47,810 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:10:47,810 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:47,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash 7829070, now seen corresponding path program 1 times [2023-12-25 07:10:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212771398] [2023-12-25 07:10:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:47,811 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:10:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:47,819 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:10:47,844 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:10:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:47,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:10:47,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 07:10:47,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:10:47,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212771398] [2023-12-25 07:10:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212771398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:10:47,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:10:47,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:10:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722835937] [2023-12-25 07:10:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:10:47,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:10:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:10:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:10:47,973 INFO L87 Difference]: Start difference. First operand 955 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:48,066 INFO L93 Difference]: Finished difference Result 1247 states and 1365 transitions. [2023-12-25 07:10:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:10:48,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2023-12-25 07:10:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:48,068 INFO L225 Difference]: With dead ends: 1247 [2023-12-25 07:10:48,068 INFO L226 Difference]: Without dead ends: 944 [2023-12-25 07:10:48,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:10:48,069 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 173 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:48,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 780 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2023-12-25 07:10:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 938. [2023-12-25 07:10:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 935 states have (on average 1.085561497326203) internal successors, (1015), 936 states have internal predecessors, (1015), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1017 transitions. [2023-12-25 07:10:48,098 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1017 transitions. Word has length 252 [2023-12-25 07:10:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:48,099 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1017 transitions. [2023-12-25 07:10:48,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1017 transitions. [2023-12-25 07:10:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-12-25 07:10:48,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:48,100 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 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, 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, 1, 1] [2023-12-25 07:10:48,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:48,304 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:10:48,304 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:48,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1534330045, now seen corresponding path program 1 times [2023-12-25 07:10:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:48,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815717762] [2023-12-25 07:10:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:48,305 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:10:48,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:48,306 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:10:48,317 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:10:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:48,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 07:10:48,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 07:10:48,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 15 proven. 143 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 07:10:49,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:49,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815717762] [2023-12-25 07:10:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815717762] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:49,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:49,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2023-12-25 07:10:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245107293] [2023-12-25 07:10:49,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:49,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 07:10:49,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:49,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 07:10:49,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2023-12-25 07:10:49,417 INFO L87 Difference]: Start difference. First operand 938 states and 1017 transitions. Second operand has 24 states, 24 states have (on average 14.833333333333334) internal successors, (356), 24 states have internal predecessors, (356), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:50,042 INFO L93 Difference]: Finished difference Result 952 states and 1030 transitions. [2023-12-25 07:10:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 07:10:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.833333333333334) internal successors, (356), 24 states have internal predecessors, (356), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2023-12-25 07:10:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:50,045 INFO L225 Difference]: With dead ends: 952 [2023-12-25 07:10:50,045 INFO L226 Difference]: Without dead ends: 949 [2023-12-25 07:10:50,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 07:10:50,046 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 750 mSDsluCounter, 5888 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 6280 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:50,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 6280 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:10:50,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-12-25 07:10:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 938. [2023-12-25 07:10:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 935 states have (on average 1.0844919786096257) internal successors, (1014), 936 states have internal predecessors, (1014), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1016 transitions. [2023-12-25 07:10:50,087 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1016 transitions. Word has length 308 [2023-12-25 07:10:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:50,088 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1016 transitions. [2023-12-25 07:10:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.833333333333334) internal successors, (356), 24 states have internal predecessors, (356), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1016 transitions. [2023-12-25 07:10:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2023-12-25 07:10:50,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:50,098 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-25 07:10:50,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-25 07:10:50,302 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:10:50,303 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:50,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1966940543, now seen corresponding path program 1 times [2023-12-25 07:10:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:50,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771895348] [2023-12-25 07:10:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:50,304 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:10:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:50,312 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:10:50,356 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:10:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:50,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 07:10:50,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 07:10:50,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 135 proven. 45 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 07:10:50,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:50,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771895348] [2023-12-25 07:10:50,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771895348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:50,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:50,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-12-25 07:10:50,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068596909] [2023-12-25 07:10:50,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:50,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 07:10:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:50,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 07:10:50,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-25 07:10:50,757 INFO L87 Difference]: Start difference. First operand 938 states and 1016 transitions. Second operand has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:50,931 INFO L93 Difference]: Finished difference Result 1043 states and 1124 transitions. [2023-12-25 07:10:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 07:10:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2023-12-25 07:10:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:50,949 INFO L225 Difference]: With dead ends: 1043 [2023-12-25 07:10:50,949 INFO L226 Difference]: Without dead ends: 945 [2023-12-25 07:10:50,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:10:50,950 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 387 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:50,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2210 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:10:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2023-12-25 07:10:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 937. [2023-12-25 07:10:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.0802139037433156) internal successors, (1010), 935 states have internal predecessors, (1010), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1011 transitions. [2023-12-25 07:10:50,988 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1011 transitions. Word has length 352 [2023-12-25 07:10:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:50,989 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1011 transitions. [2023-12-25 07:10:50,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1011 transitions. [2023-12-25 07:10:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2023-12-25 07:10:50,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:10:50,991 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-25 07:10:50,995 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:10:51,195 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:10:51,195 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:10:51,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:10:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash -711226123, now seen corresponding path program 1 times [2023-12-25 07:10:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:10:51,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369701750] [2023-12-25 07:10:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:10:51,196 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:10:51,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:10:51,213 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:10:51,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-25 07:10:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:10:51,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 07:10:51,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:10:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 89 proven. 325 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:10:52,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:10:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 20 proven. 394 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-25 07:10:52,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:10:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369701750] [2023-12-25 07:10:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369701750] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:10:52,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:10:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2023-12-25 07:10:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366900006] [2023-12-25 07:10:52,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:10:52,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-25 07:10:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:10:52,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-25 07:10:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2023-12-25 07:10:52,890 INFO L87 Difference]: Start difference. First operand 937 states and 1011 transitions. Second operand has 30 states, 30 states have (on average 20.166666666666668) internal successors, (605), 30 states have internal predecessors, (605), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:10:53,958 INFO L93 Difference]: Finished difference Result 945 states and 1019 transitions. [2023-12-25 07:10:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 07:10:53,958 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 20.166666666666668) internal successors, (605), 30 states have internal predecessors, (605), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2023-12-25 07:10:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:10:53,959 INFO L225 Difference]: With dead ends: 945 [2023-12-25 07:10:53,959 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 07:10:53,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=2490, Unknown=0, NotChecked=0, Total=2756 [2023-12-25 07:10:53,961 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 832 mSDsluCounter, 10186 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 10707 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:10:53,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 10707 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:10:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 07:10:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 07:10:53,961 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:10:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 07:10:53,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 410 [2023-12-25 07:10:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:10:53,961 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 07:10:53,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 20.166666666666668) internal successors, (605), 30 states have internal predecessors, (605), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 07:10:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 07:10:53,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 07:10:53,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:10:53,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-25 07:10:54,169 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:10:54,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 07:11:22,645 WARN L293 SmtUtils]: Spent 26.77s on a formula simplification. DAG size of input: 191 DAG size of output: 185 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 769 813) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point L696(lines 696 700) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 777 812) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point L1093(lines 1093 1097) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 785 811) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point L631(lines 623 640) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 793 810) no Hoare annotation was computed. [2023-12-25 07:11:29,936 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L895 garLoopResultBuilder]: At program point L500-2(lines 500 528) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse5 (= ~s_run_st~0 (_ bv2 32))) (.cse6 (= ~c_m_lock~0 (_ bv0 32))) (.cse7 (= ~s_memory0~0 (_ bv50 32))) (.cse8 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse9 (= |ULTIMATE.start_m_run_~req_type___0~0#1| (_ bv0 32)))) (or (and .cse0 (= ~c_req_a~0 (_ bv0 32)) (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse2 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse4 (= (_ bv6 32) ~m_run_pc~0) (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv1 32) |ULTIMATE.start_m_run_~req_a___0~0#1|)) (and .cse0 .cse1 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32)) .cse2 (= (_ bv1 32) ~a_t~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| (_ bv0 32)) (= (_ bv3 32) ~m_run_pc~0) .cse3 .cse4 (= ~c_req_d~0 (_ bv51 32)) .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 856 1117) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L1227(lines 1175 1354) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 801 809) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L501(lines 500 528) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L369(lines 139 485) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1232) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 369 377) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 823 831) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1276 1320) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point L1031(lines 1005 1032) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1284 1319) no Hoare annotation was computed. [2023-12-25 07:11:29,937 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1292 1318) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L569(lines 569 622) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 135) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 840) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L834-1(lines 834 840) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1300 1317) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 574) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 90 849) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point $Ultimate##630(lines 1308 1316) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L1100(lines 1092 1109) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L895 garLoopResultBuilder]: At program point L836(line 836) the Hoare annotation is: false [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point $Ultimate##642(lines 1330 1338) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 774) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 708) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 134) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1105) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L971(lines 971 975) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L179(lines 149 180) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 133) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L1038(lines 1038 1091) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-12-25 07:11:29,938 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L895 garLoopResultBuilder]: At program point L643-2(lines 643 671) the Hoare annotation is: (let ((.cse16 (= ~c_req_a~0 (_ bv0 32))) (.cse17 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse18 (= |ULTIMATE.start_m_run_~req_a___0~0#1| (_ bv0 32))) (.cse9 (= ~c_empty_req~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ~a_t~0)) (.cse12 (= ~s_run_st~0 (_ bv2 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32))) (.cse2 (= (_ bv1 32) ~req_tt_a~0)) (.cse3 (= ~s_memory1~0 (_ bv51 32))) (.cse4 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv1 32) ~a_t~0)) (.cse7 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 (_ bv1 32))) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse13 (= ~s_memory0~0 (_ bv50 32))) (.cse15 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse14 (= (_ bv1 32) |ULTIMATE.start_m_run_~req_a___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_rsp_d~0 (_ bv51 32)) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse5 .cse7 .cse10 .cse11 .cse12 .cse15) (and .cse16 .cse3 .cse4 .cse17 .cse18 (or (and .cse0 .cse5 .cse7 .cse11 .cse19 .cse15) (and .cse0 .cse5 .cse6 .cse7 .cse11 .cse15)) .cse13) (and .cse0 .cse17 .cse5 .cse7 .cse11 .cse12 .cse15) (and .cse0 .cse5 .cse7 .cse9 .cse10 .cse12 (= ~c_m_lock~0 (_ bv0 32)) .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse19 .cse13 .cse15 .cse14) (and .cse0 .cse16 .cse3 .cse4 .cse17 .cse5 .cse18 .cse7 (= (_ bv0 32) ~req_tt_a~0) .cse9 .cse10 (= ~c_rsp_d~0 (_ bv50 32)) .cse11 .cse19 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse14))) [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L644(lines 643 671) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L578(lines 578 582) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 132) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L909(lines 883 910) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L895 garLoopResultBuilder]: At program point L183-2(lines 183 211) the Hoare annotation is: (let ((.cse1 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv0 32))) (.cse4 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse15 (= ~s_run_pc~0 (_ bv0 32))) (.cse12 (= |ULTIMATE.start_m_run_~req_d~0#1| (_ bv50 32))) (.cse14 (= ~m_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse5 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= (_ bv0 32) ~a_t~0)) (.cse10 (= |ULTIMATE.start_m_run_~req_type~0#1| (_ bv1 32))) (.cse11 (= ~s_run_st~0 (_ bv2 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse5 (= (_ bv3 32) ~m_run_pc~0) .cse6 (= |ULTIMATE.start_m_run_~req_d~0#1| (_ bv51 32)) .cse7 .cse8 .cse9 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv1 32)) (= ~c_req_d~0 (_ bv50 32)) .cse10 .cse11 (= ~s_memory0~0 (_ bv50 32)) .cse13))) [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 782) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L184(lines 183 211) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L1308(lines 1260 1349) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L1242(lines 1242 1246) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 131) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L978(lines 970 987) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 388) no Hoare annotation was computed. [2023-12-25 07:11:29,939 INFO L899 garLoopResultBuilder]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L1177(lines 1177 1181) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L1177-2(lines 1175 1354) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 983) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L451(lines 139 485) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 577 621) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L916(lines 916 969) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L322(lines 292 323) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L719(lines 490 842) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L1182-1(lines 1175 1354) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 129) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L786(lines 786 790) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L720(lines 720 724) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L391(lines 383 400) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 940 966) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 451 459) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L259(lines 139 485) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1254) no Hoare annotation was computed. [2023-12-25 07:11:29,940 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 396) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 473 481) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L329(lines 329 382) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 391 399) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L990(lines 990 1004) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 419 463) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 929) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L529(lines 499 530) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 427 462) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 435 461) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1327) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 924 968) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1124 1165) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 932 967) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 443 460) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point L136(lines 106 848) no Hoare annotation was computed. [2023-12-25 07:11:29,941 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 585 620) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L895 garLoopResultBuilder]: At program point L533-2(lines 533 561) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= ~s_run_st~0 (_ bv2 32))) (.cse7 (= ~s_memory0~0 (_ bv50 32))) (.cse8 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse9 (= |ULTIMATE.start_m_run_~req_type___0~0#1| (_ bv0 32)))) (or (and .cse0 (= ~c_req_a~0 (_ bv0 32)) (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse2 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse4 (= (_ bv6 32) ~m_run_pc~0) (= ~c_rsp_d~0 (_ bv50 32)) .cse5 (= (_ bv0 32) ~a_t~0) .cse6 .cse7 .cse8 .cse9 (= (_ bv1 32) |ULTIMATE.start_m_run_~req_a___0~0#1|)) (and .cse0 .cse1 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32)) .cse2 (= (_ bv1 32) ~a_t~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| (_ bv0 32)) (= (_ bv3 32) ~m_run_pc~0) .cse3 .cse4 (= ~c_req_d~0 (_ bv51 32)) .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 593 619) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 601 618) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1046 1090) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L534(lines 533 561) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 408) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L402-1(lines 402 408) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L1129(lines 1129 1133) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1054 1089) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L1129-1(lines 1124 1165) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 67 72) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 609 617) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L899 garLoopResultBuilder]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2023-12-25 07:11:29,942 INFO L895 garLoopResultBuilder]: At program point L139-2(lines 139 485) the Hoare annotation is: (let ((.cse11 (= ~c_req_type~0 (_ bv0 32))) (.cse5 (= (_ bv0 32) ~a_t~0)) (.cse10 (= ~c_req_a~0 (_ bv0 32))) (.cse12 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse14 (= ~s_run_pc~0 (_ bv0 32))) (.cse13 (= ~m_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse6 (= ~s_run_st~0 (_ bv2 32))) (.cse7 (= ~c_m_lock~0 (_ bv0 32))) (.cse8 (= ~s_memory0~0 (_ bv50 32))) (.cse9 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_d~0 (_ bv50 32)) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse12 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse13) (and .cse10 .cse11 .cse12 .cse1 .cse3 .cse4 .cse14 .cse5 .cse7 .cse9 .cse13) (and .cse10 .cse12 .cse3 .cse4 .cse14 .cse6 .cse7 .cse9 .cse13) (and .cse0 (= ~s_memory1~0 (_ bv51 32)) .cse1 (= (_ bv1 32) ~a_t~0) .cse2 .cse3 .cse4 (= ~c_req_d~0 (_ bv51 32)) .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv2 32))))) [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 878) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L734(lines 734 738) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 606) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L895 garLoopResultBuilder]: At program point L404(line 404) the Hoare annotation is: false [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 485) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L933(lines 933 937) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 948 965) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L801(lines 490 842) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 956 964) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L1330(lines 1260 1349) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 806) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 978 986) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1335) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 877) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L473(lines 465 482) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L672(lines 642 673) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L1135(lines 1124 1165) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L1268(lines 1268 1321) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 84) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 876) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2023-12-25 07:11:29,943 INFO L899 garLoopResultBuilder]: For program point L212(lines 182 213) no Hoare annotation was computed. [2023-12-25 07:11:29,944 INFO L899 garLoopResultBuilder]: For program point L1071(lines 1071 1075) no Hoare annotation was computed. [2023-12-25 07:11:29,944 INFO L899 garLoopResultBuilder]: For program point L741(lines 733 750) no Hoare annotation was computed. [2023-12-25 07:11:29,944 INFO L899 garLoopResultBuilder]: For program point L609(lines 490 842) no Hoare annotation was computed. [2023-12-25 07:11:29,944 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 464) no Hoare annotation was computed. [2023-12-25 07:11:29,944 INFO L899 garLoopResultBuilder]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2023-12-25 07:11:29,955 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 84) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L895 garLoopResultBuilder]: At program point L1006-1(lines 1006 1030) the Hoare annotation is: (let ((.cse12 (= ~c_req_type~0 (_ bv0 32))) (.cse13 (= (_ bv6 32) ~m_run_pc~0)) (.cse14 (= |ULTIMATE.start_s_run_~req_type~1#1| (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse11 (= ~s_memory1~0 (_ bv51 32))) (.cse15 (= (_ bv1 32) ~a_t~0)) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= (_ bv0 32) ~a_t~0)) (.cse7 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~s_memory0~0 (_ bv50 32))) (.cse9 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse10 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv0 32)) .cse11 .cse12 .cse1 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse4 .cse13 (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv50 32)) .cse5 .cse6 .cse14 .cse8 .cse9) (and (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv1 32)) .cse0 (= (_ bv1 32) ~req_tt_a~0) .cse11 .cse12 .cse1 .cse15 .cse3 (= ~c_req_a~0 (_ bv1 32)) .cse4 .cse13 .cse5 (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv51 32)) .cse14 .cse8 .cse9) (and .cse0 .cse11 .cse1 .cse15 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv51 32)) .cse2 .cse3 .cse4 (= ~c_req_d~0 (_ bv51 32)) .cse5 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~s_run_pc~0 (_ bv0 32)) .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 746) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 614) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 416) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1006 1030) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L941(lines 941 945) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L281(lines 273 290) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L895 garLoopResultBuilder]: At program point L150-2(lines 150 178) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse15 (= ~s_run_pc~0 (_ bv2 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse11 (= ~c_req_type~0 (_ bv0 32))) (.cse1 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv0 32))) (.cse2 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse12 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~a_t~0)) (.cse6 (= |ULTIMATE.start_m_run_~req_type~0#1| (_ bv1 32))) (.cse7 (= ~s_run_st~0 (_ bv2 32))) (.cse8 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= |ULTIMATE.start_m_run_~req_d~0#1| (_ bv50 32))) (.cse9 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse10 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse6 .cse8 .cse14 .cse9 .cse10) (and .cse15 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse12 (= (_ bv3 32) ~m_run_pc~0) .cse3 (= |ULTIMATE.start_m_run_~req_d~0#1| (_ bv51 32)) .cse4 .cse13 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv1 32)) (= ~c_req_d~0 (_ bv50 32)) .cse6 .cse7 .cse8 (= ~s_memory0~0 (_ bv50 32)) .cse9) (and .cse15 .cse0 .cse11 .cse1 .cse2 .cse12 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10))) [2023-12-25 07:11:29,956 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 77 87) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L679(lines 679 732) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L151(lines 150 178) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 684) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1172 1355) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L219(lines 219 272) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L1078(lines 881 1111) no Hoare annotation was computed. [2023-12-25 07:11:29,956 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1347) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L895 garLoopResultBuilder]: At program point L1343-1(lines 1260 1349) the Hoare annotation is: (let ((.cse10 (= (_ bv1 32) ~req_tt_a~0)) (.cse14 (= ~c_req_a~0 (_ bv1 32))) (.cse17 (= ~c_req_type~0 (_ bv1 32))) (.cse23 (= ~c_req_d~0 (_ bv50 32))) (.cse20 (= (_ bv0 32) ~req_tt_a~0)) (.cse4 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~s_memory1~0 (_ bv51 32))) (.cse13 (= (_ bv1 32) ~a_t~0)) (.cse8 (= (_ bv3 32) ~m_run_pc~0)) (.cse18 (= ~c_req_d~0 (_ bv51 32))) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse16 (= ~s_memory0~0 (_ bv50 32))) (.cse22 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse19 (= ~c_req_a~0 (_ bv0 32))) (.cse12 (= ~c_req_type~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= ~m_run_st~0 (_ bv0 32))) (.cse15 (= ~c_empty_req~0 (_ bv1 32))) (.cse21 (= (_ bv0 32) ~a_t~0)) (.cse6 (= ~s_run_st~0 (_ bv2 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse24 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse3 .cse15 (= ~c_rsp_d~0 (_ bv51 32)) .cse4 .cse5 .cse6 .cse16) (and .cse0 .cse1 .cse13 .cse8 .cse2 .cse14 .cse17 .cse18 .cse5 .cse16 .cse7) (and .cse0 .cse19 .cse11 .cse12 .cse1 .cse2 .cse20 .cse3 .cse15 .cse4 (= ~c_rsp_d~0 (_ bv50 32)) .cse5 .cse21 .cse6 .cse16) (and .cse0 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse4 .cse5 .cse16 .cse7) (and .cse19 .cse8 .cse2 .cse3 .cse17 .cse5 .cse22 .cse6 .cse7) (and .cse19 .cse1 .cse8 .cse2 .cse17 .cse5 .cse22 .cse21 .cse23 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse15 .cse5 .cse21 .cse23 .cse6 .cse16) (and .cse0 .cse19 .cse1 .cse8 .cse2 .cse17 .cse5 .cse21 .cse23 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse19 .cse11 .cse12 .cse1 .cse2 .cse20 .cse4 .cse5 .cse21 .cse16 .cse7) (and .cse19 .cse2 .cse15 .cse22 .cse6 .cse9 .cse7 .cse24) (and .cse0 .cse8 .cse2 .cse15 .cse9 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse9 .cse7) (and .cse0 .cse11 .cse1 .cse13 .cse8 .cse2 .cse3 .cse15 .cse18 .cse5 .cse6 .cse16) (and .cse19 .cse12 .cse1 .cse2 .cse15 .cse22 .cse21 .cse9 .cse7 .cse24) (and .cse0 .cse19 .cse12 .cse1 .cse2 .cse3 .cse15 .cse21 .cse6 .cse9 .cse7 .cse24))) [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L895 garLoopResultBuilder]: At program point L881-1(lines 881 1111) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse7 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= ~c_req_type~0 (_ bv0 32))) (.cse9 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= |ULTIMATE.start_s_run_~req_type~1#1| (_ bv0 32))) (.cse5 (= (_ bv0 32) ~a_t~0)) (.cse14 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse15 (= (_ bv1 32) ~a_t~0)) (.cse13 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= ~c_m_lock~0 (_ bv1 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_m_lock~0 (_ bv0 32)) .cse6 (= ~m_run_pc~0 (_ bv0 32))) (and .cse7 .cse0 (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv0 32)) .cse8 .cse1 .cse2 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse4 .cse9 (= ~c_rsp_d~0 (_ bv50 32)) (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv50 32)) .cse10 .cse5 .cse11 .cse12) (and .cse0 .cse2 .cse13 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse10 (= ~s_run_pc~0 (_ bv0 32)) .cse5 .cse14 .cse6) (and (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv1 32)) .cse7 (= (_ bv1 32) ~req_tt_a~0) .cse8 .cse1 .cse2 .cse15 .cse3 (= ~c_req_a~0 (_ bv1 32)) .cse4 (= ~c_rsp_d~0 (_ bv51 32)) .cse9 .cse10 (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv51 32)) .cse11 .cse12) (and .cse2 .cse13 .cse3 .cse4 .cse10 .cse5 .cse14 .cse12 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv50 32))) (and .cse8 .cse2 .cse15 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv51 32)) .cse13 .cse3 .cse4 (= ~c_req_d~0 (_ bv51 32)) .cse10 .cse12))) [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 820) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 337 381) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L486(lines 138 487) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 953) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 345 380) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 353 379) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1249 1257) no Hoare annotation was computed. [2023-12-25 07:11:29,957 INFO L895 garLoopResultBuilder]: At program point L884-1(lines 884 908) the Hoare annotation is: (let ((.cse18 (= ~c_req_type~0 (_ bv1 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse10 (= (_ bv0 32) ~req_tt_a~0)) (.cse6 (= ~c_m_lock~0 (_ bv0 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse20 (= (_ bv1 32) ~req_tt_a~0)) (.cse1 (= ~c_req_type~0 (_ bv0 32))) (.cse17 (= ~c_req_a~0 (_ bv1 32))) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse13 (= |ULTIMATE.start_s_run_~req_type~1#1| (_ bv0 32))) (.cse5 (= (_ bv0 32) ~a_t~0)) (.cse21 (= ~c_req_d~0 (_ bv50 32))) (.cse9 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse15 (= (_ bv1 32) ~a_t~0)) (.cse16 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse19 (= ~c_req_d~0 (_ bv51 32))) (.cse12 (= ~c_m_lock~0 (_ bv1 32))) (.cse14 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 (_ bv0 32))) (and .cse8 .cse0 (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv0 32)) .cse9 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 (= ~c_rsp_d~0 (_ bv50 32)) (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv50 32)) .cse12 .cse5 .cse13 .cse14) (and .cse8 .cse2 .cse15 .cse16 .cse3 .cse17 .cse18 .cse19 .cse12 .cse14 .cse7) (and .cse8 .cse20 .cse9 .cse1 .cse2 .cse15 .cse3 .cse17 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse16 .cse3 .cse18 .cse12 (= ~s_run_pc~0 (_ bv0 32)) .cse5 .cse21 .cse7) (and .cse8 .cse16 .cse3 .cse4 .cse12 .cse7) (and .cse8 .cse0 .cse2 .cse16 .cse3 .cse18 .cse12 .cse5 .cse21 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse5 .cse14 .cse7) (and .cse8 .cse16 .cse3 .cse4 .cse6 .cse7) (and (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv1 32)) .cse8 .cse20 .cse9 .cse1 .cse2 .cse15 .cse3 .cse17 .cse4 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse12 (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv51 32)) .cse13 .cse14) (and .cse2 .cse16 .cse3 .cse4 .cse12 .cse5 .cse21 .cse14 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv50 32))) (and .cse9 .cse2 .cse15 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv51 32)) .cse16 .cse3 .cse4 .cse19 .cse12 .cse14))) [2023-12-25 07:11:29,957 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 758) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point L752-1(lines 752 758) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 361 378) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point L885(lines 884 908) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L895 garLoopResultBuilder]: At program point L1150(lines 1124 1165) the Hoare annotation is: (let ((.cse7 (= ~c_req_d~0 (_ bv51 32))) (.cse20 (= ~c_req_d~0 (_ bv50 32))) (.cse15 (= (_ bv1 32) ~req_tt_a~0)) (.cse3 (= (_ bv1 32) ~a_t~0)) (.cse13 (= ~c_req_a~0 (_ bv1 32))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse22 (= (_ bv0 32) ~req_tt_a~0)) (.cse11 (= (_ bv6 32) ~m_run_pc~0)) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse16 (= ~c_req_type~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse19 (= (_ bv0 32) ~a_t~0)) (.cse21 (= ~c_m_lock~0 (_ bv0 32))) (.cse23 (= ~m_run_pc~0 (_ bv0 32))) (.cse17 (= ~c_req_a~0 (_ bv0 32))) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse14 (= ~c_req_type~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse18 (= ~s_run_pc~0 (_ bv0 32))) (.cse9 (= ~s_run_st~0 (_ bv2 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse11 .cse8 .cse9 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse14 .cse7 .cse8 .cse10 .cse12) (and .cse0 .cse15 .cse1 .cse16 .cse2 .cse3 .cse5 .cse13 .cse11 .cse8 .cse10 .cse12) (and .cse17 .cse2 .cse4 .cse5 .cse14 .cse8 .cse18 .cse19 .cse20 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse21 .cse12) (and .cse0 .cse4 .cse5 .cse6 .cse8 .cse12) (and .cse0 .cse2 .cse5 .cse6 .cse11 .cse9 .cse21 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse19 .cse20 .cse9 .cse10) (and .cse0 .cse17 .cse1 .cse16 .cse2 .cse5 .cse22 .cse6 .cse11 (= ~c_rsp_d~0 (_ bv50 32)) .cse8 .cse19 .cse9 .cse10) (and .cse0 .cse17 .cse16 .cse2 .cse5 .cse6 .cse19 .cse9 .cse21 .cse12 .cse23) (and .cse0 .cse17 .cse2 .cse4 .cse5 .cse14 .cse8 .cse19 .cse20 .cse12) (and .cse0 .cse15 .cse1 .cse16 .cse2 .cse3 .cse5 .cse13 .cse6 (= ~c_rsp_d~0 (_ bv51 32)) .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse17 .cse1 .cse16 .cse2 .cse5 .cse22 .cse11 .cse8 .cse19 .cse10 .cse12) (and .cse17 .cse5 .cse6 .cse18 .cse9 .cse21 .cse12 .cse23) (and .cse0 .cse4 .cse5 .cse6 .cse21 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse8 .cse9 .cse12) (and .cse17 .cse16 .cse2 .cse5 .cse6 .cse18 .cse19 .cse21 .cse12 .cse23) (and .cse17 .cse4 .cse5 .cse14 .cse8 .cse18 .cse9 .cse12))) [2023-12-25 07:11:29,958 INFO L895 garLoopResultBuilder]: At program point L754(line 754) the Hoare annotation is: false [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point L688(lines 688 692) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1227 1235) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1219 1236) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 243 269) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L895 garLoopResultBuilder]: At program point L490-2(lines 490 842) the Hoare annotation is: (let ((.cse5 (= (_ bv6 32) ~m_run_pc~0)) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= ~s_memory1~0 (_ bv51 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse10 (= (_ bv1 32) ~a_t~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse6 (= ~s_run_st~0 (_ bv2 32))) (.cse7 (= ~c_m_lock~0 (_ bv0 32))) (.cse8 (= ~s_memory0~0 (_ bv50 32))) (.cse9 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 (= ~c_req_a~0 (_ bv0 32)) (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse1 (= ~c_req_type~0 (_ bv0 32)) .cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| (_ bv0 32)) .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse4 .cse5 (= ~c_rsp_d~0 (_ bv50 32)) (= (_ bv0 32) ~a_t~0) .cse6 .cse7 .cse8 (= |ULTIMATE.start_m_run_~rsp_d___0~0#1| (_ bv50 32)) .cse9) (and .cse0 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv2 32))) (and .cse0 .cse1 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32)) .cse2 .cse10 (= (_ bv3 32) ~m_run_pc~0) .cse3 .cse4 (= ~c_req_d~0 (_ bv51 32)) .cse6 .cse7 .cse8 .cse9))) [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 711 728) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 719 727) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 251 268) no Hoare annotation was computed. [2023-12-25 07:11:29,958 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1211 1237) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point L491(lines 490 842) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 259 267) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1203 1238) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L895 garLoopResultBuilder]: At program point L293-2(lines 293 321) the Hoare annotation is: (let ((.cse19 (= ~c_req_a~0 (_ bv0 32))) (.cse4 (= (_ bv3 32) ~m_run_pc~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse14 (= ~c_req_type~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse21 (= ~s_run_pc~0 (_ bv0 32))) (.cse16 (= ~c_empty_rsp~0 (_ bv1 32)))) (let ((.cse7 (= ~c_req_d~0 (_ bv51 32))) (.cse1 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32))) (.cse3 (= (_ bv1 32) ~a_t~0)) (.cse10 (= ~s_memory0~0 (_ bv50 32))) (.cse12 (= (_ bv0 32) ~a_t~0)) (.cse18 (= ~c_req_d~0 (_ bv50 32))) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse24 (= ~c_m_lock~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse20 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv0 32))) (.cse17 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse15 (= |ULTIMATE.start_m_run_~req_type~0#1| (_ bv1 32))) (.cse22 (= ~m_run_pc~0 (_ bv0 32))) (.cse23 (and .cse19 .cse4 .cse5 .cse14 .cse8 .cse21 .cse16)) (.cse9 (= ~s_run_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 (= ~s_memory1~0 (_ bv51 32)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse7 (let ((.cse11 (= ~c_req_a~0 (_ bv1 32))) (.cse13 (or (and .cse5 .cse14 .cse8 .cse15 .cse16) (and .cse4 .cse5 .cse14 .cse8 .cse16)))) (or (and .cse0 .cse1 .cse2 .cse11 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse13)))) (and .cse17 .cse2 .cse12 .cse18 (or (and .cse19 .cse20 .cse5 .cse14 .cse8 .cse21 .cse15 .cse16 .cse22) .cse23)) (and .cse0 .cse17 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse18 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse9 .cse24 .cse16) (and .cse0 .cse4 .cse5 .cse6 .cse8 .cse16) (and .cse0 .cse17 .cse2 (or (and .cse19 .cse20 .cse5 .cse14 .cse8 .cse15 .cse16) (and .cse19 .cse4 .cse5 .cse14 .cse8 .cse16)) .cse12 .cse18) (and .cse0 .cse4 .cse5 .cse6 .cse24 .cse16) (and .cse0 .cse2 .cse5 .cse8 .cse9 .cse16) (and (or (and .cse19 .cse20 .cse17 .cse5 .cse14 .cse8 .cse21 .cse15 .cse16 .cse22) .cse23) .cse9)))) [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 628) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 741 749) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point L294(lines 293 321) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1195 1239) no Hoare annotation was computed. [2023-12-25 07:11:29,960 INFO L899 garLoopResultBuilder]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 232) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 281 289) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L823(lines 815 832) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 1224) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 1161) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1062 1088) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1118 1171) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L956(lines 881 1111) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L824(lines 824 828) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 631 639) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1070 1087) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point L957(lines 957 961) no Hoare annotation was computed. [2023-12-25 07:11:29,961 INFO L899 garLoopResultBuilder]: For program point $Ultimate##580(lines 1078 1086) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point L562(lines 532 563) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##592(lines 1100 1108) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 687 731) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point L761(lines 761 814) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 227 271) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 695 730) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 235 270) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 703 729) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-12-25 07:11:29,962 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-12-25 07:11:29,962 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-12-25 07:11:29,980 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] [2023-12-25 07:11:29,982 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:11:30,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:11:30 BoogieIcfgContainer [2023-12-25 07:11:30,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:11:30,013 INFO L158 Benchmark]: Toolchain (without parser) took 58860.44ms. Allocated memory was 296.7MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 250.1MB in the beginning and 950.6MB in the end (delta: -700.5MB). Peak memory consumption was 667.1MB. Max. memory is 8.0GB. [2023-12-25 07:11:30,013 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:11:30,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.83ms. Allocated memory is still 296.7MB. Free memory was 249.6MB in the beginning and 227.3MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-25 07:11:30,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.47ms. Allocated memory is still 296.7MB. Free memory was 227.3MB in the beginning and 224.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:11:30,014 INFO L158 Benchmark]: Boogie Preprocessor took 65.79ms. Allocated memory is still 296.7MB. Free memory was 224.2MB in the beginning and 219.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-25 07:11:30,014 INFO L158 Benchmark]: RCFGBuilder took 880.07ms. Allocated memory is still 296.7MB. Free memory was 219.5MB in the beginning and 155.0MB in the end (delta: 64.5MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2023-12-25 07:11:30,014 INFO L158 Benchmark]: TraceAbstraction took 57530.04ms. Allocated memory was 296.7MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 154.4MB in the beginning and 950.6MB in the end (delta: -796.2MB). Peak memory consumption was 571.7MB. Max. memory is 8.0GB. [2023-12-25 07:11:30,015 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.83ms. Allocated memory is still 296.7MB. Free memory was 249.6MB in the beginning and 227.3MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.47ms. Allocated memory is still 296.7MB. Free memory was 227.3MB in the beginning and 224.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.79ms. Allocated memory is still 296.7MB. Free memory was 224.2MB in the beginning and 219.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 880.07ms. Allocated memory is still 296.7MB. Free memory was 219.5MB in the beginning and 155.0MB in the end (delta: 64.5MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * TraceAbstraction took 57530.04ms. Allocated memory was 296.7MB in the beginning and 1.1GB in the end (delta: 818.9MB). Free memory was 154.4MB in the beginning and 950.6MB in the end (delta: -796.2MB). Peak memory consumption was 571.7MB. 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: 20]: 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 2 procedures, 249 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 26, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11139 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11139 mSDsluCounter, 46779 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35209 mSDsCounter, 459 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4499 IncrementalHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 459 mSolverCounterUnsat, 11570 mSDtfsCounter, 4499 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5281 GetRequests, 5092 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8068occurred in iteration=15, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 7825 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 131 PreInvPairs, 311 NumberOfFragments, 3577 HoareAnnotationTreeSize, 131 FormulaSimplifications, 1472465 FormulaSimplificationTreeSizeReduction, 29.2s HoareSimplificationTime, 19 FormulaSimplificationsInter, 27601 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3601 NumberOfCodeBlocks, 3601 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5193 ConstructedInterpolants, 0 QuantifiedInterpolants, 13612 SizeOfPredicates, 64 NumberOfNonLiveVariables, 7190 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 1729/3090 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: 293]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2) && (a == 1)) && (s_memory1 == 51)) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_run_st == 2)) && (s_memory0 == 50)) || ((c_req_d == 51) && ((((((((s_run_pc == 2) && (a == 1)) && (2 == c_write_req_ev)) && (c_req_a == 1)) && (0 == a_t)) && (s_memory0 == 50)) && ((((((2 == c_write_rsp_ev) && (c_req_type == 1)) && (c_m_lock == 1)) && (req_type == 1)) && (c_empty_rsp == 1)) || (((((3 == m_run_pc) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1)))) || (((((((s_run_pc == 2) && (a == 1)) && (2 == c_write_req_ev)) && (1 == a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && ((((((2 == c_write_rsp_ev) && (c_req_type == 1)) && (c_m_lock == 1)) && (req_type == 1)) && (c_empty_rsp == 1)) || (((((3 == m_run_pc) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))))))) || (((((a == 0) && (2 == c_write_req_ev)) && (0 == a_t)) && (c_req_d == 50)) && ((((((((((c_req_a == 0) && (req_a == 0)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (c_empty_rsp == 1))))) || (((((((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && ((((((((c_req_a == 0) && (req_a == 0)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (req_type == 1)) && (c_empty_rsp == 1)) || ((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1)))) && (0 == a_t)) && (c_req_d == 50))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((((((c_req_a == 0) && (req_a == 0)) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (c_empty_rsp == 1))) && (s_run_st == 2))) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (a == 1)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (req_a___0 == 0)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (rsp_d___0 == 50)) && (c_empty_rsp == 1)) || ((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (a == 2))) || (((((((((((((s_run_pc == 2) && (s_memory1 == 51)) && (a == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((s_run_pc == 2) && (a == 1)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) || ((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((c_req_a == 0) && (c_req_type == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((c_req_a == 0) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((s_run_pc == 2) && (s_memory1 == 51)) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (a == 2))) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (a == 1)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (s_run_st == 2)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_type___0 == 0)) && (1 == req_a___0)) || (((((((((((((((s_run_pc == 2) && (s_memory1 == 51)) && (a == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (req_a___0 == 0)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_run_st == 2)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_type___0 == 0))) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 1)) && (s_run_st == 2)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_a == 0) && (req_a == 0)) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((((c_req_a == 0) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (req_type == 1)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((((s_run_pc == 2) && (a == 1)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (req_d == 51)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (req_a == 1)) && (c_req_d == 50)) && (req_type == 1)) && (s_run_st == 2)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1)) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((((((((((s_run_pc == 2) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (m_run_st == 0)) && (c_empty_req == 1)) && (c_rsp_d == 51)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (s_memory0 == 50))) || (((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_req_type == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || (((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (m_run_st == 0)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((((((s_run_pc == 2) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || (((((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || (((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((((s_run_pc == 2) && (c_req_a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((c_req_a == 0) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((((((((s_run_pc == 2) && (s_memory1 == 51)) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_empty_req == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_empty_req == 1)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 0)) && (s_memory0 == 50))) || (((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_req_type == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((((s_run_pc == 2) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || ((((((((((s_run_pc == 2) && (c_req_a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((((((((((((req_a == 1) && (s_run_pc == 2)) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_empty_req == 1)) && (c_rsp_d == 51)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (rsp_d == 51)) && (req_type == 0)) && (s_memory0 == 50))) || (((((((((2 == c_write_req_ev) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (req_d == 50))) || ((((((((((s_memory1 == 51) && (2 == c_write_req_ev)) && (1 == a_t)) && (req_d == 51)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_memory0 == 50))) - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 0)) && (s_memory0 == 50))) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((((((((((((req_a == 1) && (s_run_pc == 2)) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_empty_req == 1)) && (c_rsp_d == 51)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (rsp_d == 51)) && (req_type == 0)) && (s_memory0 == 50))) || (((((((((2 == c_write_req_ev) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (req_d == 50))) || ((((((((((s_memory1 == 51) && (2 == c_write_req_ev)) && (1 == a_t)) && (req_d == 51)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_memory0 == 50))) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_run_pc == 2) && (s_memory1 == 51)) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_run_st == 2)) && (s_memory0 == 50)) || (((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || (((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (1 == a_t)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_req_type == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((((s_run_pc == 2) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || (((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (s_run_st == 2)) && (s_memory0 == 50))) || (((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((s_run_pc == 2) && (c_req_a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((((((((((s_run_pc == 2) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_empty_req == 1)) && (c_rsp_d == 51)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((c_req_a == 0) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_empty_rsp == 1))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_a == 0) && (req_a == 0)) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((((((((c_req_a == 0) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (req_type == 1)) && (c_m_lock == 0)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((((s_run_pc == 2) && (a == 1)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (req_d == 51)) && (c_empty_req == 1)) && (0 == a_t)) && (req_a == 1)) && (c_req_d == 50)) && (req_type == 1)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || (((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (req_type == 1)) && (s_run_st == 2)) && (c_m_lock == 0)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_run_pc == 2) && (a == 1)) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_empty_req == 1)) && (c_rsp_d == 51)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (s_memory0 == 50)) && (1 == req_a___0)) || (((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || (((((((c_req_a == 0) && (s_memory1 == 51)) && (c_req_type == 0)) && (a == 0)) && (req_a___0 == 0)) && (((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (0 == a_t)) && (c_empty_rsp == 1)) || ((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (c_empty_rsp == 1)))) && (s_memory0 == 50))) || (((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((((((((s_run_pc == 2) && (a == 1)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (1 == req_a___0))) || ((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (req_a___0 == 0)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((((((((s_run_pc == 2) && (a == 1)) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (1 == req_a___0))) - InvariantResult [Line: 1006]: Loop Invariant Derived loop invariant: (((((((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_d == 50)) || ((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (req_a == 0)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((((((((req_a == 1) && (s_run_pc == 2)) && (1 == req_tt_a)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (2 == c_write_rsp_ev)) && (c_req_a == 1)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (rsp_d == 51)) && (req_type == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((((s_run_pc == 2) && (s_memory1 == 51)) && (2 == c_write_req_ev)) && (1 == a_t)) && (req_d == 51)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (c_m_lock == 1)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || (((((((((((2 == c_write_req_ev) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_d == 50))) - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (a == 1)) && (s_memory1 == 51)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_type___0 == 0)) && (1 == req_a___0)) || (((((((((((((((s_run_pc == 2) && (s_memory1 == 51)) && (a == 0)) && (2 == c_write_req_ev)) && (1 == a_t)) && (req_a___0 == 0)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_req_d == 51)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_type___0 == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-25 07:11:30,039 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...