/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/array14_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 19:23:22,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 19:23:22,841 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:23:22,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 19:23:22,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 19:23:22,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 19:23:22,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 19:23:22,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 19:23:22,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 19:23:22,872 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 19:23:22,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 19:23:22,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 19:23:22,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 19:23:22,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 19:23:22,874 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 19:23:22,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 19:23:22,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 19:23:22,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 19:23:22,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 19:23:22,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 19:23:22,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 19:23:22,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 19:23:22,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 19:23:22,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 19:23:22,877 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 19:23:22,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 19:23:22,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 19:23:22,878 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 19:23:22,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 19:23:22,878 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 19:23:22,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 19:23:22,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 19:23:22,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 19:23:22,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 19:23:22,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:23:22,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 19:23:22,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 19:23:22,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 19:23:22,880 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 19:23:22,880 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 19:23:22,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 19:23:22,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 19:23:22,880 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 19:23:22,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 19:23:22,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 19:23:22,881 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 19:23:22,881 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:23:23,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 19:23:23,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 19:23:23,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 19:23:23,097 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 19:23:23,097 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 19:23:23,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array14_pattern.c [2023-12-21 19:23:24,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 19:23:24,310 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 19:23:24,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array14_pattern.c [2023-12-21 19:23:24,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3b0b496/314c7fdb28464b7cadbd66083ab2ba60/FLAGdf56e034a [2023-12-21 19:23:24,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3b0b496/314c7fdb28464b7cadbd66083ab2ba60 [2023-12-21 19:23:24,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 19:23:24,332 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 19:23:24,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 19:23:24,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 19:23:24,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 19:23:24,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f13a8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24, skipping insertion in model container [2023-12-21 19:23:24,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,356 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 19:23:24,474 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/array14_pattern.c[1285,1298] [2023-12-21 19:23:24,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:23:24,510 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 19:23:24,520 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/array14_pattern.c[1285,1298] [2023-12-21 19:23:24,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 19:23:24,538 INFO L206 MainTranslator]: Completed translation [2023-12-21 19:23:24,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24 WrapperNode [2023-12-21 19:23:24,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 19:23:24,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 19:23:24,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 19:23:24,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 19:23:24,544 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:23:24" (1/1) ... [2023-12-21 19:23:24,555 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:23:24" (1/1) ... [2023-12-21 19:23:24,575 INFO L138 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-12-21 19:23:24,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 19:23:24,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 19:23:24,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 19:23:24,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 19:23:24,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,601 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:23:24,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 19:23:24,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 19:23:24,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 19:23:24,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 19:23:24,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (1/1) ... [2023-12-21 19:23:24,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 19:23:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 19:23:24,653 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:23:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 19:23:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 19:23:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 19:23:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 19:23:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 19:23:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 19:23:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 19:23:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 19:23:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 19:23:24,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 19:23:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 19:23:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 19:23:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 19:23:24,659 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:23:24,745 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 19:23:24,746 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 19:23:24,999 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 19:23:25,024 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 19:23:25,025 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 19:23:25,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:23:25 BoogieIcfgContainer [2023-12-21 19:23:25,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 19:23:25,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 19:23:25,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 19:23:25,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 19:23:25,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 07:23:24" (1/3) ... [2023-12-21 19:23:25,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a079063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:23:25, skipping insertion in model container [2023-12-21 19:23:25,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 07:23:24" (2/3) ... [2023-12-21 19:23:25,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a079063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 07:23:25, skipping insertion in model container [2023-12-21 19:23:25,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 07:23:25" (3/3) ... [2023-12-21 19:23:25,035 INFO L112 eAbstractionObserver]: Analyzing ICFG array14_pattern.c [2023-12-21 19:23:25,046 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 19:23:25,046 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 19:23:25,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 19:23:25,085 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;@31a687bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 19:23:25,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 19:23:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 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:23:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 19:23:25,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:23:25,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 19:23:25,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:23:25,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:23:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1194769137, now seen corresponding path program 1 times [2023-12-21 19:23:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:23:25,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614681356] [2023-12-21 19:23:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:23:25,113 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:23:25,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:23:25,114 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:23:25,137 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:23:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:23:25,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 19:23:25,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:23:25,197 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:23:25,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:23:25,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:23:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614681356] [2023-12-21 19:23:25,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614681356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:23:25,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:23:25,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 19:23:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121345186] [2023-12-21 19:23:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:23:25,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 19:23:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:23:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 19:23:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 19:23:25,235 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 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:23:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:23:25,303 INFO L93 Difference]: Finished difference Result 50 states and 82 transitions. [2023-12-21 19:23:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 19:23:25,305 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:23:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:23:25,310 INFO L225 Difference]: With dead ends: 50 [2023-12-21 19:23:25,310 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 19:23:25,313 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:23:25,316 INFO L413 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:23:25,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 19:23:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 19:23:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-21 19:23:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:23:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-21 19:23:25,350 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2023-12-21 19:23:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:23:25,350 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-21 19:23:25,350 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:23:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-21 19:23:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 19:23:25,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:23:25,352 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] [2023-12-21 19:23:25,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 19:23:25,557 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:23:25,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:23:25,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:23:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1986080322, now seen corresponding path program 1 times [2023-12-21 19:23:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:23:25,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897725033] [2023-12-21 19:23:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:23:25,559 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:23:25,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:23:25,560 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:23:25,562 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:23:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:23:25,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 19:23:25,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:23:25,821 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:23:25,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:23:26,087 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:23:26,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:23:26,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897725033] [2023-12-21 19:23:26,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897725033] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:23:26,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:23:26,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-21 19:23:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650891447] [2023-12-21 19:23:26,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:23:26,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 19:23:26,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:23:26,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 19:23:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-21 19:23:26,091 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 19:23:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:23:26,434 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-12-21 19:23:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:23:26,435 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27 [2023-12-21 19:23:26,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:23:26,436 INFO L225 Difference]: With dead ends: 35 [2023-12-21 19:23:26,436 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 19:23:26,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:23:26,437 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:23:26,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 66 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 19:23:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 19:23:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-21 19:23:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:23:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-21 19:23:26,444 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 27 [2023-12-21 19:23:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:23:26,445 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-21 19:23:26,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 19:23:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-21 19:23:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 19:23:26,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:23:26,445 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] [2023-12-21 19:23:26,449 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:23:26,648 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:23:26,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:23:26,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:23:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 124073019, now seen corresponding path program 1 times [2023-12-21 19:23:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:23:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304398267] [2023-12-21 19:23:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:23:26,650 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:23:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:23:26,653 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:23:26,655 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:23:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:23:26,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:23:26,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:23:26,875 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:23:26,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:23:26,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:23:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304398267] [2023-12-21 19:23:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304398267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:23:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:23:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:23:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141476889] [2023-12-21 19:23:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:23:26,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:23:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:23:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:23:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:23:26,877 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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:23:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:23:27,216 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-12-21 19:23:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:23:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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 31 [2023-12-21 19:23:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:23:27,218 INFO L225 Difference]: With dead ends: 60 [2023-12-21 19:23:27,218 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 19:23:27,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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:23:27,219 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 19:23:27,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 19:23:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 19:23:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-21 19:23:27,224 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:23:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-12-21 19:23:27,225 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 31 [2023-12-21 19:23:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:23:27,225 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-12-21 19:23:27,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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:23:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-12-21 19:23:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 19:23:27,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:23:27,226 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] [2023-12-21 19:23:27,246 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:23:27,426 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:23:27,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:23:27,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:23:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1068820009, now seen corresponding path program 1 times [2023-12-21 19:23:27,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:23:27,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123316311] [2023-12-21 19:23:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:23:27,433 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:23:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:23:27,435 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:23:27,485 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:23:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:23:27,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 19:23:27,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:23:27,682 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:23:27,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 19:23:27,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:23:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123316311] [2023-12-21 19:23:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123316311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 19:23:27,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 19:23:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 19:23:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614853827] [2023-12-21 19:23:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 19:23:27,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 19:23:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:23:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 19:23:27,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-21 19:23:27,689 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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:23:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:23:27,964 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-12-21 19:23:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 19:23:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 34 [2023-12-21 19:23:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:23:27,965 INFO L225 Difference]: With dead ends: 57 [2023-12-21 19:23:27,965 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 19:23:27,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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:23:27,966 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 45 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:23:27,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 45 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 19:23:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 19:23:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-21 19:23:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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:23:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-12-21 19:23:27,973 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 34 [2023-12-21 19:23:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:23:27,973 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-12-21 19:23:27,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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:23:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-12-21 19:23:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 19:23:27,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:23:27,974 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:23:28,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 19:23:28,174 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:23:28,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:23:28,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:23:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1207156056, now seen corresponding path program 1 times [2023-12-21 19:23:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:23:28,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879615895] [2023-12-21 19:23:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:23:28,176 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:23:28,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:23:28,181 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:23:28,223 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:23:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:23:28,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 19:23:28,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:23:29,156 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 24 treesize of output 20 [2023-12-21 19:23:29,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 19:23:29,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:23:29,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2023-12-21 19:23:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 19:23:30,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:23:30,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 23 [2023-12-21 19:23:30,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 46 treesize of output 44 [2023-12-21 19:23:30,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 23 [2023-12-21 19:23:30,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 46 treesize of output 44 [2023-12-21 19:23:36,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:23:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879615895] [2023-12-21 19:23:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879615895] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:23:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [523044367] [2023-12-21 19:23:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 19:23:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-21 19:23:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-21 19:23:36,525 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:23:36,528 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:23:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 19:23:36,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 19:23:36,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:23:38,663 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 25 treesize of output 21 [2023-12-21 19:24:05,008 INFO L349 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-12-21 19:24:05,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 11 [2023-12-21 19:24:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 19:24:05,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:05,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 23 [2023-12-21 19:24:05,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 46 treesize of output 44 [2023-12-21 19:24:05,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 23 [2023-12-21 19:24:05,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 46 treesize of output 44 [2023-12-21 19:24:10,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [523044367] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 19:24:10,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 31 [2023-12-21 19:24:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368816794] [2023-12-21 19:24:10,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:10,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 19:24:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:10,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 19:24:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1401, Unknown=6, NotChecked=0, Total=1640 [2023-12-21 19:24:10,422 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 32 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-21 19:24:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:18,447 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2023-12-21 19:24:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 19:24:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2023-12-21 19:24:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:18,454 INFO L225 Difference]: With dead ends: 99 [2023-12-21 19:24:18,454 INFO L226 Difference]: Without dead ends: 73 [2023-12-21 19:24:18,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=594, Invalid=3182, Unknown=6, NotChecked=0, Total=3782 [2023-12-21 19:24:18,455 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:18,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 193 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-21 19:24:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-21 19:24:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2023-12-21 19:24:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 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:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2023-12-21 19:24:18,466 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 35 [2023-12-21 19:24:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:18,467 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2023-12-21 19:24:18,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 27 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-21 19:24:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2023-12-21 19:24:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 19:24:18,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:18,468 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] [2023-12-21 19:24:18,486 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:18,677 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:18,879 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:18,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:18,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1252029961, now seen corresponding path program 2 times [2023-12-21 19:24:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397747195] [2023-12-21 19:24:18,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 19:24:18,882 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:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:18,883 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:18,884 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:19,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 19:24:19,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:19,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:24:19,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:19,287 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:19,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:19,496 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:19,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397747195] [2023-12-21 19:24:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397747195] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:19,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:24:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347992800] [2023-12-21 19:24:19,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:19,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:24:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:24:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:24:19,498 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:21,236 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2023-12-21 19:24:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 19:24:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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 36 [2023-12-21 19:24:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:21,238 INFO L225 Difference]: With dead ends: 101 [2023-12-21 19:24:21,238 INFO L226 Difference]: Without dead ends: 73 [2023-12-21 19:24:21,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2023-12-21 19:24:21,239 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 150 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:21,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 121 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-21 19:24:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-21 19:24:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2023-12-21 19:24:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 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:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2023-12-21 19:24:21,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 36 [2023-12-21 19:24:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:21,253 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2023-12-21 19:24:21,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 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:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2023-12-21 19:24:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 19:24:21,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:21,254 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] [2023-12-21 19:24:21,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:21,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:21,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:21,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 525964996, now seen corresponding path program 3 times [2023-12-21 19:24:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614334192] [2023-12-21 19:24:21,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 19:24:21,463 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:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:21,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 19:24:21,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 19:24:21,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 19:24:21,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:21,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:24:21,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 19:24:21,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 19:24:22,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614334192] [2023-12-21 19:24:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614334192] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:22,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:22,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:24:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706901386] [2023-12-21 19:24:22,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:22,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:24:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:22,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:24:22,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:24:22,101 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-21 19:24:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:23,337 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2023-12-21 19:24:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 19:24:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2023-12-21 19:24:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:23,343 INFO L225 Difference]: With dead ends: 114 [2023-12-21 19:24:23,343 INFO L226 Difference]: Without dead ends: 88 [2023-12-21 19:24:23,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2023-12-21 19:24:23,345 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:23,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 72 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 19:24:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-21 19:24:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2023-12-21 19:24:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 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:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2023-12-21 19:24:23,364 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 36 [2023-12-21 19:24:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:23,364 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2023-12-21 19:24:23,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-21 19:24:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2023-12-21 19:24:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-21 19:24:23,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:23,365 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] [2023-12-21 19:24:23,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 19:24:23,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 19:24:23,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:23,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1694259807, now seen corresponding path program 4 times [2023-12-21 19:24:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500586514] [2023-12-21 19:24:23,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 19:24:23,575 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:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:23,580 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:23,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 19:24:23,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 19:24:23,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:23,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 19:24:23,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:23,993 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:23,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:24:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-21 19:24:24,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 19:24:24,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500586514] [2023-12-21 19:24:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500586514] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 19:24:24,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 19:24:24,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2023-12-21 19:24:24,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850136056] [2023-12-21 19:24:24,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 19:24:24,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 19:24:24,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 19:24:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 19:24:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-12-21 19:24:24,182 INFO L87 Difference]: Start difference. First operand 68 states and 83 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:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 19:24:25,343 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2023-12-21 19:24:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 19:24:25,344 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 39 [2023-12-21 19:24:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 19:24:25,345 INFO L225 Difference]: With dead ends: 80 [2023-12-21 19:24:25,345 INFO L226 Difference]: Without dead ends: 44 [2023-12-21 19:24:25,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2023-12-21 19:24:25,346 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 80 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 19:24:25,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 86 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 19:24:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-21 19:24:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-21 19:24:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 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:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2023-12-21 19:24:25,361 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 39 [2023-12-21 19:24:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 19:24:25,361 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2023-12-21 19:24:25,361 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:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2023-12-21 19:24:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 19:24:25,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 19:24:25,367 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] [2023-12-21 19:24:25,386 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:25,572 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:25,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 19:24:25,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 19:24:25,573 INFO L85 PathProgramCache]: Analyzing trace with hash -982448030, now seen corresponding path program 5 times [2023-12-21 19:24:25,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 19:24:25,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198655331] [2023-12-21 19:24:25,573 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 19:24:25,573 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:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 19:24:25,589 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:25,605 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:25,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-12-21 19:24:25,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 19:24:25,997 WARN L260 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-21 19:24:26,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 19:24:26,136 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:26,183 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:26,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:26,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:26,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:24:26,526 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:26,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:26,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:26,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:26,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 19:24:26,649 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:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:28,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:28,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:28,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:28,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:28,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:24:28,818 INFO L349 Elim1Store]: treesize reduction 219, result has 29.1 percent of original size [2023-12-21 19:24:28,818 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 102 treesize of output 177 [2023-12-21 19:24:38,010 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:24:47,080 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:24:56,193 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:25:05,327 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:25:14,461 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:25:23,738 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:25:32,939 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:25:42,136 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:25:42,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:25:42,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:25:42,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:25:42,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 19:25:42,547 INFO L349 Elim1Store]: treesize reduction 55, result has 79.6 percent of original size [2023-12-21 19:25:42,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 173 treesize of output 307 [2023-12-21 19:26:12,645 WARN L293 SmtUtils]: Spent 11.99s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:26:22,950 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:26:22,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 19:27:38,541 WARN L854 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (let ((.cse1 (bvmul (_ bv4 32) ((_ extract 31 0) c_~ARR_SIZE~0))) (.cse3 (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (or (bvsge |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| (_ bv0 64)) (bvsle (let ((.cse0 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3|) (bvadd (bvmul .cse1 ((_ extract 31 0) (bvadd (_ bv18446744073709551615 64) (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|) c_~ARR_SIZE~0))) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|))) (bvmul |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7|)))) (bvadd ((_ sign_extend 32) (select .cse0 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) ((_ sign_extend 32) (select .cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| ((_ sign_extend 32) (select .cse0 (bvadd (_ bv4 32) .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) ((_ sign_extend 32) (select .cse0 (bvadd .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))))) c_~ARR_SIZE~0))) (forall ((|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (or (bvslt |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| c_~ARR_SIZE~0) (bvsle (let ((.cse2 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3|) (bvadd (bvmul .cse1 ((_ extract 31 0) (bvadd (_ bv18446744073709551615 64) (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|) c_~ARR_SIZE~0))) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|))) (bvmul |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7|)))) (bvadd ((_ sign_extend 32) (select .cse2 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) ((_ sign_extend 32) (select .cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| ((_ sign_extend 32) (select .cse2 (bvadd (_ bv4 32) .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) ((_ sign_extend 32) (select .cse2 (bvadd .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))))) c_~ARR_SIZE~0)))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (or (bvsge |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| (_ bv0 64)) (bvsge (let ((.cse4 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3|) (bvadd (bvmul .cse1 ((_ extract 31 0) (bvadd (_ bv18446744073709551615 64) (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|) c_~ARR_SIZE~0))) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|))) (bvmul |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7|)))) (bvadd ((_ sign_extend 32) (select .cse4 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) ((_ sign_extend 32) (select .cse4 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| ((_ sign_extend 32) (select .cse4 (bvadd (_ bv4 32) .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) ((_ sign_extend 32) (select .cse4 (bvadd .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))))) (_ bv0 64)))) (forall ((|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (or (bvslt |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8| c_~ARR_SIZE~0) (bvsge (let ((.cse5 (store (select |c_#memory_int#1| |v_ULTIMATE.start_main_~#array~0#1.base_BEFORE_CALL_3|) (bvadd (bvmul .cse1 ((_ extract 31 0) (bvadd (_ bv18446744073709551615 64) (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|) c_~ARR_SIZE~0))) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5| (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index2~0#1_BEFORE_CALL_8|))) (bvmul |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_7|)))) (bvadd ((_ sign_extend 32) (select .cse5 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|)) ((_ sign_extend 32) (select .cse5 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_11| ((_ sign_extend 32) (select .cse5 (bvadd (_ bv4 32) .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))) ((_ sign_extend 32) (select .cse5 (bvadd .cse1 |v_ULTIMATE.start_main_~#array~0#1.offset_BEFORE_CALL_5|))))) (_ bv0 64))))) .cse3)))) is different from false [2023-12-21 19:29:09,431 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 74 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 19:30:51,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 353 treesize of output 345 [2023-12-21 19:30:52,376 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-12-21 19:30:52,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 172891600 treesize of output 170139088 [2023-12-21 19:34:20,691 WARN L293 SmtUtils]: Spent 3.47m on a formula simplification. DAG size of input: 1547 DAG size of output: 1743 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-21 19:38:03,329 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 19:38:03,329 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:04,345 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:38:04,353 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 19:38:04,353 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 48 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-21 19:38:04,359 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-12-21 19:38:04,360 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 19:38:04,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 07:38:04 BoogieIcfgContainer [2023-12-21 19:38:04,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 19:38:04,362 INFO L158 Benchmark]: Toolchain (without parser) took 880030.32ms. Allocated memory was 259.0MB in the beginning and 778.0MB in the end (delta: 519.0MB). Free memory was 206.8MB in the beginning and 322.5MB in the end (delta: -115.7MB). Peak memory consumption was 460.1MB. Max. memory is 8.0GB. [2023-12-21 19:38:04,362 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 187.7MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 19:38:04,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.19ms. Allocated memory is still 259.0MB. Free memory was 206.3MB in the beginning and 194.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 19:38:04,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.79ms. Allocated memory is still 259.0MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:38:04,363 INFO L158 Benchmark]: Boogie Preprocessor took 48.33ms. Allocated memory is still 259.0MB. Free memory was 192.6MB in the beginning and 190.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 19:38:04,363 INFO L158 Benchmark]: RCFGBuilder took 400.57ms. Allocated memory is still 259.0MB. Free memory was 190.5MB in the beginning and 174.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 19:38:04,363 INFO L158 Benchmark]: TraceAbstraction took 879335.10ms. Allocated memory was 259.0MB in the beginning and 778.0MB in the end (delta: 519.0MB). Free memory was 174.3MB in the beginning and 322.5MB in the end (delta: -148.2MB). Peak memory consumption was 427.6MB. Max. memory is 8.0GB. [2023-12-21 19:38:04,364 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 187.7MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.19ms. Allocated memory is still 259.0MB. Free memory was 206.3MB in the beginning and 194.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.79ms. Allocated memory is still 259.0MB. Free memory was 194.7MB in the beginning and 192.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.33ms. Allocated memory is still 259.0MB. Free memory was 192.6MB in the beginning and 190.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 400.57ms. Allocated memory is still 259.0MB. Free memory was 190.5MB in the beginning and 174.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 879335.10ms. Allocated memory was 259.0MB in the beginning and 778.0MB in the end (delta: 519.0MB). Free memory was 174.3MB in the beginning and 322.5MB in the end (delta: -148.2MB). Peak memory consumption was 427.6MB. 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: 32]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 32). Cancelled while NwaCegarLoop was analyzing trace of length 48 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 879.3s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 519 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 509 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 139 mSDtfsCounter, 1809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 336 SyntacticMatches, 6 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 44.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=7, InterpolantAutomatonStates: 121, 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, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 44.0s InterpolantComputationTime, 287 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 412 ConstructedInterpolants, 174 QuantifiedInterpolants, 3359 SizeOfPredicates, 46 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 155/205 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