/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/array-patterns/array15_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 19:24:05,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 19:24:05,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 19:24:05,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 19:24:05,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 19:24:05,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 19:24:05,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 19:24:05,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 19:24:05,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 19:24:05,914 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 19:24:05,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 19:24:05,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 19:24:05,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 19:24:05,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 19:24:05,916 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 19:24:05,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 19:24:05,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 19:24:05,917 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 19:24:05,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 19:24:05,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 19:24:05,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 19:24:05,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 19:24:05,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 19:24:05,919 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 19:24:05,919 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 19:24:05,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 19:24:05,919 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 19:24:05,920 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 19:24:05,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 19:24:05,920 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 19:24:05,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 19:24:05,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 19:24:05,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 19:24:05,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 19:24:05,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:24:05,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 19:24:05,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 19:24:05,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 19:24:05,921 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 19:24:05,922 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 19:24:06,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 19:24:06,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 19:24:06,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 19:24:06,122 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 19:24:06,122 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 19:24:06,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array15_pattern.c [2023-12-21 19:24:07,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 19:24:07,336 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 19:24:07,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array15_pattern.c [2023-12-21 19:24:07,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b306bbd9/ded2057b5e3a4e56a0a5d1495fc2f542/FLAG3812f1c70 [2023-12-21 19:24:07,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b306bbd9/ded2057b5e3a4e56a0a5d1495fc2f542 [2023-12-21 19:24:07,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 19:24:07,359 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 19:24:07,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 19:24:07,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 19:24:07,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 19:24:07,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41549836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07, skipping insertion in model container [2023-12-21 19:24:07,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,394 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 19:24:07,506 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array15_pattern.c[1424,1437] [2023-12-21 19:24:07,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:24:07,560 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 19:24:07,568 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array15_pattern.c[1424,1437] [2023-12-21 19:24:07,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:24:07,584 INFO L206 MainTranslator]: Completed translation [2023-12-21 19:24:07,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07 WrapperNode [2023-12-21 19:24:07,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 19:24:07,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 19:24:07,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 19:24:07,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 19:24:07,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,621 INFO L138 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2023-12-21 19:24:07,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 19:24:07,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 19:24:07,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 19:24:07,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 19:24:07,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,643 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2023-12-21 19:24:07,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 19:24:07,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 19:24:07,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 19:24:07,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 19:24:07,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (1/1) ... [2023-12-21 19:24:07,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:24:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 19:24:07,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 19:24:07,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 19:24:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 19:24:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 19:24:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 19:24:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 19:24:07,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 19:24:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 19:24:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 19:24:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 19:24:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 19:24:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 19:24:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 19:24:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 19:24:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 19:24:07,787 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 19:24:07,788 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 19:24:08,042 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 19:24:08,081 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 19:24:08,081 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 19:24:08,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:24:08 BoogieIcfgContainer [2023-12-21 19:24:08,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 19:24:08,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 19:24:08,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 19:24:08,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 19:24:08,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 07:24:07" (1/3) ... [2023-12-21 19:24:08,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285402bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:24:08, skipping insertion in model container [2023-12-21 19:24:08,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:24:07" (2/3) ... [2023-12-21 19:24:08,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285402bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:24:08, skipping insertion in model container [2023-12-21 19:24:08,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:24:08" (3/3) ... [2023-12-21 19:24:08,087 INFO L112 eAbstractionObserver]: Analyzing ICFG array15_pattern.c [2023-12-21 19:24:08,103 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 19:24:08,104 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 19:24:08,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 19:24:08,141 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;@6a39f270, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 19:24:08,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 19:24:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:24:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 19:24:08,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:08,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:08,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:08,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1369109538, now seen corresponding path program 1 times [2023-12-21 19:24:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16624157] [2023-12-21 19:24:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:08,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:08,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:08,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:08,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 19:24:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:08,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 19:24:08,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 19:24:08,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:24:08,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16624157] [2023-12-21 19:24:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16624157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:24:08,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:24:08,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 19:24:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208705680] [2023-12-21 19:24:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:24:08,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 19:24:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 19:24:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:24:08,308 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:24:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:08,396 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2023-12-21 19:24:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 19:24:08,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-21 19:24:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:08,402 INFO L225 Difference]: With dead ends: 52 [2023-12-21 19:24:08,403 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 19:24:08,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:24:08,406 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:08,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 19:24:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 19:24:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 19:24:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:24:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-21 19:24:08,433 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 14 [2023-12-21 19:24:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:08,433 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-21 19:24:08,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 19:24:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-21 19:24:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 19:24:08,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:08,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:08,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:08,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:08,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:08,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash -119060570, now seen corresponding path program 1 times [2023-12-21 19:24:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141505999] [2023-12-21 19:24:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:08,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:08,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:08,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:08,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 19:24:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:08,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 19:24:08,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:24:09,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:24:09,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141505999] [2023-12-21 19:24:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141505999] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:09,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-21 19:24:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426227900] [2023-12-21 19:24:09,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:09,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 19:24:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:09,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 19:24:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-21 19:24:09,539 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:24:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:09,914 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-12-21 19:24:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 19:24:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-21 19:24:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:09,915 INFO L225 Difference]: With dead ends: 36 [2023-12-21 19:24:09,915 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 19:24:09,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-21 19:24:09,917 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:09,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 61 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 19:24:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 19:24:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-21 19:24:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:24:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-12-21 19:24:09,925 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2023-12-21 19:24:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:09,925 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-12-21 19:24:09,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:24:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-12-21 19:24:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 19:24:09,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:09,926 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:09,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-21 19:24:10,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:10,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:10,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1018721247, now seen corresponding path program 1 times [2023-12-21 19:24:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:10,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145057930] [2023-12-21 19:24:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:10,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:10,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:10,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:10,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 19:24:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:10,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:24:10,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:24:10,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:24:10,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145057930] [2023-12-21 19:24:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145057930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:24:10,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:24:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:24:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095803303] [2023-12-21 19:24:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:24:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:24:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:10,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:24:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:24:10,301 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:24:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:10,641 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2023-12-21 19:24:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:24:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-12-21 19:24:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:10,642 INFO L225 Difference]: With dead ends: 62 [2023-12-21 19:24:10,643 INFO L226 Difference]: Without dead ends: 40 [2023-12-21 19:24:10,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 19:24:10,644 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:10,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 40 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 19:24:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-21 19:24:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-12-21 19:24:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:24:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-12-21 19:24:10,650 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 32 [2023-12-21 19:24:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:10,651 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-12-21 19:24:10,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:24:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-12-21 19:24:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 19:24:10,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:10,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:10,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:10,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:10,857 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:10,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash -591576335, now seen corresponding path program 1 times [2023-12-21 19:24:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973972154] [2023-12-21 19:24:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:10,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:10,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:10,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:10,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 19:24:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:10,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:24:10,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:24:11,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:24:11,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:11,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973972154] [2023-12-21 19:24:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973972154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:24:11,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:24:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:24:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079152747] [2023-12-21 19:24:11,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:24:11,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:24:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:24:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:24:11,072 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:24:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:11,379 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2023-12-21 19:24:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:24:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2023-12-21 19:24:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:11,381 INFO L225 Difference]: With dead ends: 59 [2023-12-21 19:24:11,381 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 19:24:11,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-21 19:24:11,382 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:11,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 49 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:24:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 19:24:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-12-21 19:24:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:24:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-12-21 19:24:11,387 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2023-12-21 19:24:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:11,388 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-12-21 19:24:11,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 19:24:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-12-21 19:24:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 19:24:11,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:11,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:11,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:11,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:11,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:11,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash -743110031, now seen corresponding path program 1 times [2023-12-21 19:24:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419484329] [2023-12-21 19:24:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:11,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:11,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:11,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:11,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 19:24:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:11,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 19:24:11,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:24:12,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:12,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419484329] [2023-12-21 19:24:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419484329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:24:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2103045293] [2023-12-21 19:24:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:12,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:24:12,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:24:12,342 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:24:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-21 19:24:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:12,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 19:24:12,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:24:12,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2103045293] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:24:12,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2023-12-21 19:24:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902966129] [2023-12-21 19:24:12,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:12,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 19:24:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:12,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 19:24:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-12-21 19:24:12,801 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:24:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:14,248 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2023-12-21 19:24:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 19:24:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2023-12-21 19:24:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:14,250 INFO L225 Difference]: With dead ends: 107 [2023-12-21 19:24:14,250 INFO L226 Difference]: Without dead ends: 82 [2023-12-21 19:24:14,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 19:24:14,251 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 128 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:14,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 102 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 19:24:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-21 19:24:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2023-12-21 19:24:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 19:24:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-12-21 19:24:14,269 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 36 [2023-12-21 19:24:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:14,269 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-12-21 19:24:14,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 19:24:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-12-21 19:24:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 19:24:14,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:14,270 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:14,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-21 19:24:14,476 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-21 19:24:14,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:14,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:14,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash -484944593, now seen corresponding path program 1 times [2023-12-21 19:24:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:14,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737096864] [2023-12-21 19:24:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:14,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:14,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 19:24:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:14,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 19:24:14,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:14,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 19:24:15,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:24:15,809 INFO L349 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-12-21 19:24:15,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 42 [2023-12-21 19:24:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:24:16,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:17,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737096864] [2023-12-21 19:24:17,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737096864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:24:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [247231748] [2023-12-21 19:24:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:24:17,562 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:24:17,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:24:17,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:24:17,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-21 19:24:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:24:17,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 19:24:17,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:18,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 19:24:20,737 INFO L349 Elim1Store]: treesize reduction 145, result has 7.1 percent of original size [2023-12-21 19:24:20,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 36 [2023-12-21 19:24:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:24:29,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [247231748] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:24:30,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2023-12-21 19:24:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305126246] [2023-12-21 19:24:30,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:30,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 19:24:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 19:24:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 19:24:30,119 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 26 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-21 19:24:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:32,542 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2023-12-21 19:24:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 19:24:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 26 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2023-12-21 19:24:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:32,546 INFO L225 Difference]: With dead ends: 107 [2023-12-21 19:24:32,546 INFO L226 Difference]: Without dead ends: 103 [2023-12-21 19:24:32,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=517, Invalid=2239, Unknown=0, NotChecked=0, Total=2756 [2023-12-21 19:24:32,548 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 174 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:32,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 169 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 19:24:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-21 19:24:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2023-12-21 19:24:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-21 19:24:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2023-12-21 19:24:32,571 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 36 [2023-12-21 19:24:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:32,571 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2023-12-21 19:24:32,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 26 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-21 19:24:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2023-12-21 19:24:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 19:24:32,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:32,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:32,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-21 19:24:32,783 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-21 19:24:32,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:32,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:32,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1145687311, now seen corresponding path program 2 times [2023-12-21 19:24:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970809370] [2023-12-21 19:24:32,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:24:32,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:32,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:32,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:32,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 19:24:33,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:24:33,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:33,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:24:33,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 19:24:33,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 19:24:33,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:33,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970809370] [2023-12-21 19:24:33,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970809370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:33,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:33,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:24:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492909715] [2023-12-21 19:24:33,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:33,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:24:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:24:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:24:33,584 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:24:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:34,787 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2023-12-21 19:24:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 19:24:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-12-21 19:24:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:34,788 INFO L225 Difference]: With dead ends: 100 [2023-12-21 19:24:34,788 INFO L226 Difference]: Without dead ends: 75 [2023-12-21 19:24:34,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2023-12-21 19:24:34,789 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:34,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 154 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 19:24:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-21 19:24:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2023-12-21 19:24:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 19:24:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-12-21 19:24:34,801 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 37 [2023-12-21 19:24:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:34,801 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-12-21 19:24:34,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:24:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-12-21 19:24:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 19:24:34,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:34,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:34,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:35,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:35,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:35,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1696961768, now seen corresponding path program 2 times [2023-12-21 19:24:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:35,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231620186] [2023-12-21 19:24:35,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:24:35,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:35,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:35,005 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:35,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 19:24:35,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:24:35,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:35,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 19:24:35,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 19:24:35,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 19:24:35,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:35,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231620186] [2023-12-21 19:24:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231620186] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:35,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-12-21 19:24:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580061396] [2023-12-21 19:24:35,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:35,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 19:24:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 19:24:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-12-21 19:24:35,673 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:24:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:36,804 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2023-12-21 19:24:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 19:24:36,805 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2023-12-21 19:24:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:36,806 INFO L225 Difference]: With dead ends: 71 [2023-12-21 19:24:36,806 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 19:24:36,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 19:24:36,807 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 116 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:36,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 113 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 19:24:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 19:24:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-12-21 19:24:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:24:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-12-21 19:24:36,813 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 40 [2023-12-21 19:24:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:36,813 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-12-21 19:24:36,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 19:24:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-12-21 19:24:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 19:24:36,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:36,814 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:24:36,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:37,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:37,018 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:37,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash 316517944, now seen corresponding path program 3 times [2023-12-21 19:24:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436077601] [2023-12-21 19:24:37,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:24:37,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:37,020 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:37,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 19:24:37,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 19:24:37,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:37,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 19:24:37,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-21 19:24:37,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:37,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436077601] [2023-12-21 19:24:37,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436077601] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:24:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [265014891] [2023-12-21 19:24:37,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:24:37,779 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:24:37,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:24:37,780 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:24:37,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-21 19:24:38,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 19:24:38,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:38,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 19:24:38,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 19:24:38,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 19:24:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [265014891] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:38,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 19:24:38,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2023-12-21 19:24:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529275566] [2023-12-21 19:24:38,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:38,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 19:24:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 19:24:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2023-12-21 19:24:38,801 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 23 states have internal predecessors, (67), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-12-21 19:24:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:40,608 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2023-12-21 19:24:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 19:24:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 23 states have internal predecessors, (67), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 43 [2023-12-21 19:24:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:40,609 INFO L225 Difference]: With dead ends: 96 [2023-12-21 19:24:40,609 INFO L226 Difference]: Without dead ends: 53 [2023-12-21 19:24:40,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2023-12-21 19:24:40,610 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 162 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:40,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 132 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 19:24:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-21 19:24:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2023-12-21 19:24:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 19:24:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2023-12-21 19:24:40,618 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 43 [2023-12-21 19:24:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:40,618 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2023-12-21 19:24:40,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 23 states have internal predecessors, (67), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-12-21 19:24:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2023-12-21 19:24:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-21 19:24:40,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:40,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2023-12-21 19:24:40,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:40,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:41,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:41,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:41,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1486893030, now seen corresponding path program 4 times [2023-12-21 19:24:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118834599] [2023-12-21 19:24:41,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 19:24:41,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:41,033 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:41,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 19:24:41,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 19:24:41,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:41,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-21 19:24:41,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:41,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 19:24:41,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-21 19:24:41,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:41,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:41,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:24:41,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2023-12-21 19:24:41,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:41,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:41,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:41,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:41,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:24:41,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-12-21 19:24:43,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:43,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:43,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:43,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:43,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:43,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:43,745 INFO L349 Elim1Store]: treesize reduction 187, result has 30.5 percent of original size [2023-12-21 19:24:43,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 95 treesize of output 158 [2023-12-21 19:25:02,007 WARN L293 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 61 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:26:33,253 WARN L293 SmtUtils]: Spent 16.77s on a formula simplification. DAG size of input: 79 DAG size of output: 61 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-21 19:26:33,253 INFO L349 Elim1Store]: treesize reduction 76, result has 69.0 percent of original size [2023-12-21 19:26:33,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 242 [2023-12-21 19:26:49,622 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:27:39,457 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:28:29,622 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:28:57,901 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:29:26,089 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:29:34,109 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:31:56,909 WARN L293 SmtUtils]: Spent 1.77m on a formula simplification that was a NOOP. DAG size: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:32:06,193 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:32:22,272 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:32:30,292 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:32:58,453 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:33:26,590 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 19:33:34,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv3 64) ((_ sign_extend 32) (_ bv0 32)))))) (or (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_38| (_ BitVec 16)) (|ULTIMATE.start_main_~index2~0#1| (_ BitVec 16)) (v_prenex_4 (_ BitVec 16)) (v_prenex_5 (_ BitVec 16)) (|ULTIMATE.start_main_~index1~0#1| (_ BitVec 16))) (let ((.cse1 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_38|))) (let ((.cse5 ((_ sign_extend 16) v_prenex_5)) (.cse4 ((_ sign_extend 16) v_prenex_4)) (.cse7 ((_ extract 31 0) .cse1))) (let ((.cse3 (bvmul (_ bv4 32) .cse7)) (.cse6 (bvadd (bvmul (_ bv4 32) ((_ sign_extend 16) |ULTIMATE.start_main_~index2~0#1|)) (bvmul (_ bv4 32) (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index1~0#1|) .cse7)))) (.cse2 (bvadd (bvmul (_ bv4 32) (bvmul .cse5 .cse7)) (bvmul (_ bv4 32) .cse4)))) (and (not (bvsle .cse0 (bvadd (_ bv18446744073709551614 64) (bvmul .cse1 (_ bv2 64))))) (not (= .cse2 .cse3)) (= .cse1 (bvadd (_ bv2 64) ((_ sign_extend 32) (bvadd .cse4 .cse5)))) (not (= .cse3 .cse6)) (not (= .cse6 (_ bv0 32))) (= .cse2 (_ bv0 32))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_38| (_ BitVec 16)) (|ULTIMATE.start_main_~index2~0#1| (_ BitVec 16)) (v_prenex_4 (_ BitVec 16)) (v_prenex_5 (_ BitVec 16)) (|ULTIMATE.start_main_~index1~0#1| (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_38|))) (let ((.cse12 ((_ sign_extend 16) v_prenex_5)) (.cse10 ((_ extract 31 0) .cse8)) (.cse11 ((_ sign_extend 16) v_prenex_4))) (let ((.cse9 (bvadd (bvmul (_ bv4 32) (bvmul .cse12 .cse10)) (bvmul (_ bv4 32) .cse11)))) (and (not (bvsle .cse0 (bvadd (_ bv18446744073709551614 64) (bvmul .cse8 (_ bv2 64))))) (not (= .cse9 (bvmul (_ bv4 32) .cse10))) (= .cse8 (bvadd (_ bv2 64) ((_ sign_extend 32) (bvadd .cse11 .cse12)))) (not (= (bvadd (bvmul (_ bv4 32) ((_ sign_extend 16) |ULTIMATE.start_main_~index2~0#1|)) (bvmul (_ bv4 32) (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index1~0#1|) .cse10))) (_ bv0 32))) (= .cse9 (_ bv0 32))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_38| (_ BitVec 16)) (|ULTIMATE.start_main_~index2~0#1| (_ BitVec 16)) (v_prenex_4 (_ BitVec 16)) (v_prenex_5 (_ BitVec 16)) (|ULTIMATE.start_main_~index1~0#1| (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_38|))) (let ((.cse17 ((_ sign_extend 16) v_prenex_5)) (.cse16 ((_ sign_extend 16) v_prenex_4)) (.cse18 ((_ extract 31 0) .cse13))) (let ((.cse15 (bvmul (_ bv4 32) .cse18)) (.cse14 (bvadd (bvmul (_ bv4 32) (bvmul .cse17 .cse18)) (bvmul (_ bv4 32) .cse16)))) (and (not (bvsle .cse0 (bvadd (_ bv18446744073709551614 64) (bvmul .cse13 (_ bv2 64))))) (not (= .cse14 .cse15)) (= .cse13 (bvadd (_ bv2 64) ((_ sign_extend 32) (bvadd .cse16 .cse17)))) (not (= (bvadd (_ bv4 32) .cse15) (bvadd (bvmul (_ bv4 32) ((_ sign_extend 16) |ULTIMATE.start_main_~index2~0#1|)) (bvmul (_ bv4 32) (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index1~0#1|) .cse18))))) (= .cse14 (_ bv0 32))))))))) is different from false [2023-12-21 19:33:38,633 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv3 64) ((_ sign_extend 32) (_ bv0 32)))))) (or (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_38| (_ BitVec 16)) (|ULTIMATE.start_main_~index2~0#1| (_ BitVec 16)) (v_prenex_4 (_ BitVec 16)) (v_prenex_5 (_ BitVec 16)) (|ULTIMATE.start_main_~index1~0#1| (_ BitVec 16))) (let ((.cse1 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_38|))) (let ((.cse5 ((_ sign_extend 16) v_prenex_5)) (.cse4 ((_ sign_extend 16) v_prenex_4)) (.cse7 ((_ extract 31 0) .cse1))) (let ((.cse3 (bvmul (_ bv4 32) .cse7)) (.cse6 (bvadd (bvmul (_ bv4 32) ((_ sign_extend 16) |ULTIMATE.start_main_~index2~0#1|)) (bvmul (_ bv4 32) (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index1~0#1|) .cse7)))) (.cse2 (bvadd (bvmul (_ bv4 32) (bvmul .cse5 .cse7)) (bvmul (_ bv4 32) .cse4)))) (and (not (bvsle .cse0 (bvadd (_ bv18446744073709551614 64) (bvmul .cse1 (_ bv2 64))))) (not (= .cse2 .cse3)) (= .cse1 (bvadd (_ bv2 64) ((_ sign_extend 32) (bvadd .cse4 .cse5)))) (not (= .cse3 .cse6)) (not (= .cse6 (_ bv0 32))) (= .cse2 (_ bv0 32))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_38| (_ BitVec 16)) (|ULTIMATE.start_main_~index2~0#1| (_ BitVec 16)) (v_prenex_4 (_ BitVec 16)) (v_prenex_5 (_ BitVec 16)) (|ULTIMATE.start_main_~index1~0#1| (_ BitVec 16))) (let ((.cse8 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_38|))) (let ((.cse12 ((_ sign_extend 16) v_prenex_5)) (.cse10 ((_ extract 31 0) .cse8)) (.cse11 ((_ sign_extend 16) v_prenex_4))) (let ((.cse9 (bvadd (bvmul (_ bv4 32) (bvmul .cse12 .cse10)) (bvmul (_ bv4 32) .cse11)))) (and (not (bvsle .cse0 (bvadd (_ bv18446744073709551614 64) (bvmul .cse8 (_ bv2 64))))) (not (= .cse9 (bvmul (_ bv4 32) .cse10))) (= .cse8 (bvadd (_ bv2 64) ((_ sign_extend 32) (bvadd .cse11 .cse12)))) (not (= (bvadd (bvmul (_ bv4 32) ((_ sign_extend 16) |ULTIMATE.start_main_~index2~0#1|)) (bvmul (_ bv4 32) (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index1~0#1|) .cse10))) (_ bv0 32))) (= .cse9 (_ bv0 32))))))) (exists ((|v_ULTIMATE.start_main_#t~nondet4#1_38| (_ BitVec 16)) (|ULTIMATE.start_main_~index2~0#1| (_ BitVec 16)) (v_prenex_4 (_ BitVec 16)) (v_prenex_5 (_ BitVec 16)) (|ULTIMATE.start_main_~index1~0#1| (_ BitVec 16))) (let ((.cse13 ((_ sign_extend 48) |v_ULTIMATE.start_main_#t~nondet4#1_38|))) (let ((.cse17 ((_ sign_extend 16) v_prenex_5)) (.cse16 ((_ sign_extend 16) v_prenex_4)) (.cse18 ((_ extract 31 0) .cse13))) (let ((.cse15 (bvmul (_ bv4 32) .cse18)) (.cse14 (bvadd (bvmul (_ bv4 32) (bvmul .cse17 .cse18)) (bvmul (_ bv4 32) .cse16)))) (and (not (bvsle .cse0 (bvadd (_ bv18446744073709551614 64) (bvmul .cse13 (_ bv2 64))))) (not (= .cse14 .cse15)) (= .cse13 (bvadd (_ bv2 64) ((_ sign_extend 32) (bvadd .cse16 .cse17)))) (not (= (bvadd (_ bv4 32) .cse15) (bvadd (bvmul (_ bv4 32) ((_ sign_extend 16) |ULTIMATE.start_main_~index2~0#1|)) (bvmul (_ bv4 32) (bvmul ((_ sign_extend 16) |ULTIMATE.start_main_~index1~0#1|) .cse18))))) (= .cse14 (_ bv0 32))))))))) is different from true [2023-12-21 19:33:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:33:38,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:37:25,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:37:25,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118834599] [2023-12-21 19:37:25,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118834599] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:37:25,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [559467704] [2023-12-21 19:37:25,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 19:37:25,999 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:37:25,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:37:26,001 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-21 19:37:26,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-21 19:37:26,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 19:37:26,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:37:27,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-21 19:37:27,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:37:32,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 19:37:34,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-21 19:37:39,935 INFO L349 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2023-12-21 19:37:39,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 35 [2023-12-21 19:37:41,911 INFO L349 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2023-12-21 19:37:41,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 51 Received shutdown request... [2023-12-21 19:38:51,045 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 19:38:51,049 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 19:38:51,049 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 19:38:51,753 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 19:38:51,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-12-21 19:38:51,960 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 (14)] Ended with exit code 0 [2023-12-21 19:38:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:38:52,154 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 49 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. [2023-12-21 19:38:52,158 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-12-21 19:38:52,159 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 19:38:52,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 07:38:52 BoogieIcfgContainer [2023-12-21 19:38:52,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 19:38:52,161 INFO L158 Benchmark]: Toolchain (without parser) took 884802.20ms. Allocated memory was 185.6MB in the beginning and 297.8MB in the end (delta: 112.2MB). Free memory was 135.2MB in the beginning and 179.7MB in the end (delta: -44.5MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2023-12-21 19:38:52,161 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 185.6MB. Free memory was 136.6MB in the beginning and 136.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 19:38:52,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.64ms. Allocated memory is still 185.6MB. Free memory was 134.8MB in the beginning and 122.9MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 19:38:52,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.01ms. Allocated memory is still 185.6MB. Free memory was 122.9MB in the beginning and 121.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:38:52,161 INFO L158 Benchmark]: Boogie Preprocessor took 31.90ms. Allocated memory is still 185.6MB. Free memory was 121.2MB in the beginning and 118.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:38:52,162 INFO L158 Benchmark]: RCFGBuilder took 426.80ms. Allocated memory is still 185.6MB. Free memory was 118.8MB in the beginning and 103.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 19:38:52,162 INFO L158 Benchmark]: TraceAbstraction took 884077.99ms. Allocated memory was 185.6MB in the beginning and 297.8MB in the end (delta: 112.2MB). Free memory was 102.3MB in the beginning and 179.7MB in the end (delta: -77.4MB). Peak memory consumption was 35.2MB. Max. memory is 8.0GB. [2023-12-21 19:38:52,163 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.15ms. Allocated memory is still 185.6MB. Free memory was 136.6MB in the beginning and 136.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.64ms. Allocated memory is still 185.6MB. Free memory was 134.8MB in the beginning and 122.9MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.01ms. Allocated memory is still 185.6MB. Free memory was 122.9MB in the beginning and 121.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.90ms. Allocated memory is still 185.6MB. Free memory was 121.2MB in the beginning and 118.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.80ms. Allocated memory is still 185.6MB. Free memory was 118.8MB in the beginning and 103.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 884077.99ms. Allocated memory was 185.6MB in the beginning and 297.8MB in the end (delta: 112.2MB). Free memory was 102.3MB in the beginning and 179.7MB in the end (delta: -77.4MB). Peak memory consumption was 35.2MB. 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 - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 39). Cancelled while NwaCegarLoop was analyzing trace of length 49 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 884.0s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 820 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 810 mSDsluCounter, 850 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 693 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2110 IncrementalHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 157 mSDtfsCounter, 2110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 713 GetRequests, 480 SyntacticMatches, 14 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=6, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 77 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 416 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 548 ConstructedInterpolants, 275 QuantifiedInterpolants, 4898 SizeOfPredicates, 72 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 249/306 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2023-12-21 19:38:52,200 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