/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/list-properties/simple_built_from_end.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:14:15,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:14:15,406 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-16 16:14:15,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:14:15,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:14:15,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:14:15,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:14:15,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:14:15,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:14:15,439 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:14:15,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:14:15,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:14:15,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:14:15,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:14:15,441 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:14:15,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:14:15,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:14:15,442 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:14:15,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:14:15,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:14:15,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:14:15,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:14:15,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:14:15,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:14:15,444 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:14:15,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:14:15,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:14:15,445 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:14:15,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:14:15,445 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:14:15,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:14:15,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:14:15,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:14:15,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:14:15,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:14:15,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:14:15,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:14:15,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:14:15,447 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:14:15,447 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:14:15,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:14:15,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:14:15,447 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:14:15,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:14:15,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:14:15,448 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:14:15,448 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-16 16:14:15,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:14:15,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:14:15,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:14:15,686 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:14:15,686 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:14:15,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end.i [2023-12-16 16:14:16,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:14:16,852 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:14:16,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.i [2023-12-16 16:14:16,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d51014d01/aafdfa05066d4ce0a1833ea969a18f08/FLAGe12ef2c78 [2023-12-16 16:14:16,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d51014d01/aafdfa05066d4ce0a1833ea969a18f08 [2023-12-16 16:14:16,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:14:16,877 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:14:16,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:14:16,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:14:16,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:14:16,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:14:16" (1/1) ... [2023-12-16 16:14:16,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534e2430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:16, skipping insertion in model container [2023-12-16 16:14:16,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:14:16" (1/1) ... [2023-12-16 16:14:16,917 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:14:17,087 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.i[23125,23138] [2023-12-16 16:14:17,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:14:17,104 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:14:17,151 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.i[23125,23138] [2023-12-16 16:14:17,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:14:17,174 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:14:17,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17 WrapperNode [2023-12-16 16:14:17,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:14:17,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:14:17,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:14:17,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:14:17,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,210 INFO L138 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-12-16 16:14:17,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:14:17,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:14:17,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:14:17,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:14:17,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,231 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-16 16:14:17,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:14:17,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:14:17,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:14:17,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:14:17,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (1/1) ... [2023-12-16 16:14:17,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:14:17,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:14:17,324 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-16 16:14:17,360 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-16 16:14:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:14:17,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:14:17,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:14:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:14:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:14:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:14:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:14:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:14:17,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:14:17,483 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:14:17,484 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:14:17,590 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:14:17,615 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:14:17,615 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:14:17,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:14:17 BoogieIcfgContainer [2023-12-16 16:14:17,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:14:17,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:14:17,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:14:17,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:14:17,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:14:16" (1/3) ... [2023-12-16 16:14:17,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cc9ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:14:17, skipping insertion in model container [2023-12-16 16:14:17,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:14:17" (2/3) ... [2023-12-16 16:14:17,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cc9ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:14:17, skipping insertion in model container [2023-12-16 16:14:17,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:14:17" (3/3) ... [2023-12-16 16:14:17,622 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2023-12-16 16:14:17,635 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:14:17,635 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:14:17,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:14:17,673 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;@62caaa28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:14:17,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:14:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-16 16:14:17,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:17,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-16 16:14:17,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:17,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash 73644442, now seen corresponding path program 1 times [2023-12-16 16:14:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:17,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142199300] [2023-12-16 16:14:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:17,699 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-16 16:14:17,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:17,701 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-16 16:14:17,751 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-16 16:14:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:17,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:14:17,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:17,803 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-16 16:14:17,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:14:17,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142199300] [2023-12-16 16:14:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142199300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:14:17,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:14:17,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:14:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800830649] [2023-12-16 16:14:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:14:17,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:14:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:14:17,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:14:17,835 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:17,855 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2023-12-16 16:14:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:14:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-16 16:14:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:17,862 INFO L225 Difference]: With dead ends: 19 [2023-12-16 16:14:17,863 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 16:14:17,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-16 16:14:17,867 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:17,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:14:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 16:14:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-16 16:14:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-12-16 16:14:17,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2023-12-16 16:14:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:17,889 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-12-16 16:14:17,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-12-16 16:14:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:14:17,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:17,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:14:17,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:18,093 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-16 16:14:18,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:18,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2026470929, now seen corresponding path program 1 times [2023-12-16 16:14:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490262542] [2023-12-16 16:14:18,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:18,095 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-16 16:14:18,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:18,096 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-16 16:14:18,118 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-16 16:14:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:18,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:14:18,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:18,220 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-16 16:14:18,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:14:18,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490262542] [2023-12-16 16:14:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490262542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:14:18,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:14:18,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:14:18,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767266008] [2023-12-16 16:14:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:14:18,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:14:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:14:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:14:18,223 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:18,257 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2023-12-16 16:14:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:14:18,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 16:14:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:18,258 INFO L225 Difference]: With dead ends: 18 [2023-12-16 16:14:18,258 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 16:14:18,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:14:18,260 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:18,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:14:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 16:14:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-16 16:14:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-12-16 16:14:18,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2023-12-16 16:14:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:18,269 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-12-16 16:14:18,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-12-16 16:14:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:14:18,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:18,270 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:18,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:18,472 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-16 16:14:18,473 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:18,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1758149216, now seen corresponding path program 1 times [2023-12-16 16:14:18,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:18,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110576626] [2023-12-16 16:14:18,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:18,474 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-16 16:14:18,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:18,478 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-16 16:14:18,480 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-16 16:14:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:18,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:14:18,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:18,591 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 22 treesize of output 7 [2023-12-16 16:14:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:14:18,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:14:18,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110576626] [2023-12-16 16:14:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110576626] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:14:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:14:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:14:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986412748] [2023-12-16 16:14:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:14:18,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:14:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:14:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:14:18,618 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:18,672 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-16 16:14:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:14:18,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 16:14:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:18,673 INFO L225 Difference]: With dead ends: 17 [2023-12-16 16:14:18,673 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 16:14:18,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:14:18,674 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:18,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:14:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 16:14:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2023-12-16 16:14:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-16 16:14:18,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2023-12-16 16:14:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:18,677 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-16 16:14:18,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-16 16:14:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:14:18,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:18,677 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:18,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 16:14:18,879 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-16 16:14:18,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:18,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash -98083423, now seen corresponding path program 1 times [2023-12-16 16:14:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426095753] [2023-12-16 16:14:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:14:18,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:18,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:18,887 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-16 16:14:18,890 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-16 16:14:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:14:18,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:14:18,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:18,982 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 13 treesize of output 9 [2023-12-16 16:14:18,987 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 13 treesize of output 9 [2023-12-16 16:14:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:14:19,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:14:19,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:19,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426095753] [2023-12-16 16:14:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426095753] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:14:19,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:19,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-12-16 16:14:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156661069] [2023-12-16 16:14:19,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:19,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:14:19,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:19,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:14:19,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:14:19,092 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:19,152 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2023-12-16 16:14:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:14:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 16:14:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:19,153 INFO L225 Difference]: With dead ends: 26 [2023-12-16 16:14:19,153 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 16:14:19,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:14:19,153 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:19,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:14:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 16:14:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-12-16 16:14:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-16 16:14:19,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2023-12-16 16:14:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:19,156 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-16 16:14:19,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-16 16:14:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:14:19,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:19,157 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 16:14:19,176 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-16 16:14:19,361 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-16 16:14:19,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:19,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 821181778, now seen corresponding path program 2 times [2023-12-16 16:14:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49830113] [2023-12-16 16:14:19,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:14:19,362 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-16 16:14:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:19,364 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-16 16:14:19,372 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-16 16:14:19,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:14:19,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:19,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 16:14:19,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:19,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-16 16:14:19,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:14:19,497 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:14:19,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2023-12-16 16:14:19,530 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-16 16:14:19,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:14:19,542 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 20 treesize of output 15 [2023-12-16 16:14:19,610 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 27 treesize of output 15 [2023-12-16 16:14:19,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-16 16:14:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:14:19,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:20,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:20,560 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-16 16:14:20,565 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 30 treesize of output 22 [2023-12-16 16:14:20,569 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 5 treesize of output 3 [2023-12-16 16:14:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:14:20,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49830113] [2023-12-16 16:14:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49830113] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:14:20,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:20,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-16 16:14:20,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231780253] [2023-12-16 16:14:20,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:20,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:14:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:14:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=118, Unknown=6, NotChecked=0, Total=156 [2023-12-16 16:14:20,598 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:20,970 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-12-16 16:14:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:14:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:14:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:20,971 INFO L225 Difference]: With dead ends: 23 [2023-12-16 16:14:20,971 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 16:14:20,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=264, Unknown=6, NotChecked=0, Total=380 [2023-12-16 16:14:20,972 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:20,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 41 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:14:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 16:14:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-12-16 16:14:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-12-16 16:14:20,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2023-12-16 16:14:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:20,976 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-12-16 16:14:20,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-12-16 16:14:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 16:14:20,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:20,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-12-16 16:14:21,000 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 (6)] Ended with exit code 0 [2023-12-16 16:14:21,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:21,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:21,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -302572177, now seen corresponding path program 3 times [2023-12-16 16:14:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:21,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032691164] [2023-12-16 16:14:21,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:14:21,179 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-16 16:14:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:21,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:14:21,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:14:21,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 16:14:21,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:21,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 16:14:21,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:21,302 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-16 16:14:21,307 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-16 16:14:21,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-12-16 16:14:21,377 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-12-16 16:14:21,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2023-12-16 16:14:21,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-16 16:14:21,411 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:14:21,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 16:14:21,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:14:21,807 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-12-16 16:14:21,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2023-12-16 16:14:21,881 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-12-16 16:14:21,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 74 [2023-12-16 16:14:22,359 INFO L349 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2023-12-16 16:14:22,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 33 [2023-12-16 16:14:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:14:22,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:22,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:22,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2023-12-16 16:14:22,577 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 234 treesize of output 207 [2023-12-16 16:14:22,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:22,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 122 [2023-12-16 16:14:22,649 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 8 treesize of output 4 [2023-12-16 16:14:22,701 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 8 treesize of output 4 [2023-12-16 16:14:23,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (or (= .cse0 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_3 .cse1))) (= .cse0 |ULTIMATE.start_main_~t~0#1.base|)))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))) (or (= .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|) (= .cse3 (_ bv0 32))))) (not (= (select v_arrayElimArr_4 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) (_ bv0 32)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) |c_ULTIMATE.start_main_~t~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_3 .cse1))))) (not (= (select v_arrayElimArr_4 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_4 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) |ULTIMATE.start_main_~t~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) (_ bv0 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_3 .cse1))))))))) is different from false [2023-12-16 16:14:27,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_3 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) (_ bv0 32)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) (_ bv0 32)))))) (not (= (select v_arrayElimArr_4 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) (_ bv0 32))) (not (= (select v_arrayElimArr_4 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) |ULTIMATE.start_main_~t~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) (_ bv0 32)))) (not (= (select v_arrayElimArr_3 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select v_arrayElimArr_4 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~t~0#1.base| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (or (= .cse1 (_ bv0 32)) (not (= (select v_arrayElimArr_3 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~t~0#1.base|)))))) is different from false [2023-12-16 16:14:27,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:27,187 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-16 16:14:27,191 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 36 treesize of output 24 [2023-12-16 16:14:27,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:27,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 20 [2023-12-16 16:14:27,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:27,224 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2023-12-16 16:14:27,228 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 59 treesize of output 41 [2023-12-16 16:14:27,236 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 15 treesize of output 11 [2023-12-16 16:14:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-16 16:14:27,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032691164] [2023-12-16 16:14:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032691164] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:14:27,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 16:14:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52785644] [2023-12-16 16:14:27,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:27,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 16:14:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 16:14:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=124, Unknown=2, NotChecked=46, Total=210 [2023-12-16 16:14:27,253 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:28,108 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-12-16 16:14:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:14:28,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-16 16:14:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:28,109 INFO L225 Difference]: With dead ends: 34 [2023-12-16 16:14:28,109 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 16:14:28,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=98, Invalid=328, Unknown=2, NotChecked=78, Total=506 [2023-12-16 16:14:28,110 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:28,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 75 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 55 Unchecked, 0.5s Time] [2023-12-16 16:14:28,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 16:14:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2023-12-16 16:14:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-16 16:14:28,116 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2023-12-16 16:14:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:28,116 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-16 16:14:28,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-16 16:14:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:14:28,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:28,116 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2023-12-16 16:14:28,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:28,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:28,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:28,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1213426738, now seen corresponding path program 4 times [2023-12-16 16:14:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:28,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574091360] [2023-12-16 16:14:28,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:14:28,335 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-16 16:14:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:28,337 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-16 16:14:28,338 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-16 16:14:28,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:14:28,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:28,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-16 16:14:28,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:28,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-16 16:14:28,440 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-16 16:14:28,445 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-16 16:14:28,490 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:14:28,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2023-12-16 16:14:28,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-12-16 16:14:28,522 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 20 treesize of output 15 [2023-12-16 16:14:28,528 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 21 treesize of output 23 [2023-12-16 16:14:28,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-16 16:14:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:14:28,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:28,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:28,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 16:14:28,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:28,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-16 16:14:29,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:29,003 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-16 16:14:29,006 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 36 treesize of output 24 [2023-12-16 16:14:29,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:29,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 20 [2023-12-16 16:14:29,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:29,042 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-16 16:14:29,046 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 36 treesize of output 24 [2023-12-16 16:14:29,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:29,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 20 [2023-12-16 16:14:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:14:33,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574091360] [2023-12-16 16:14:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574091360] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:14:33,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:33,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:14:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141102157] [2023-12-16 16:14:33,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 16:14:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:33,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 16:14:33,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=120, Unknown=5, NotChecked=0, Total=156 [2023-12-16 16:14:33,161 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:33,623 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2023-12-16 16:14:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:14:33,624 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 16:14:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:33,625 INFO L225 Difference]: With dead ends: 36 [2023-12-16 16:14:33,625 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 16:14:33,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=38, Invalid=139, Unknown=5, NotChecked=0, Total=182 [2023-12-16 16:14:33,626 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:33,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 16:14:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 16:14:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-12-16 16:14:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-12-16 16:14:33,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2023-12-16 16:14:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:33,629 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-12-16 16:14:33,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-12-16 16:14:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:14:33,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:33,630 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2023-12-16 16:14:33,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:14:33,830 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-16 16:14:33,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:33,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2045922208, now seen corresponding path program 5 times [2023-12-16 16:14:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:33,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860285326] [2023-12-16 16:14:33,831 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 16:14:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:14:33,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:33,832 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-16 16:14:33,835 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-16 16:14:33,957 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-16 16:14:33,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:33,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-16 16:14:33,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:33,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-16 16:14:33,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-16 16:14:34,019 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-16 16:14:34,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-16 16:14:34,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-16 16:14:34,058 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 20 treesize of output 15 [2023-12-16 16:14:34,064 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-16 16:14:34,132 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-16 16:14:34,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-12-16 16:14:34,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-12-16 16:14:34,200 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 21 treesize of output 23 [2023-12-16 16:14:34,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-16 16:14:34,217 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 52 treesize of output 35 [2023-12-16 16:14:34,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-16 16:14:34,606 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-16 16:14:34,607 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2023-12-16 16:14:34,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-16 16:14:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:14:34,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:14:34,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:34,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2023-12-16 16:14:34,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:34,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-12-16 16:14:34,910 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_193 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_ArrVal_193 |c_ULTIMATE.start_main_~t~0#1.offset|) (_ bv1 32))) (= (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_193) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) (_ bv1 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_14 .cse0)))))) is different from false [2023-12-16 16:14:34,949 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_21| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_193 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_14 (_ bv4 32)))) (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_193) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~t~0#1.base_21| v_arrayElimArr_13) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~t~0#1.base_21| v_arrayElimArr_14) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) (_ bv1 32)) (not (= (select v_arrayElimArr_13 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_ArrVal_193 (_ bv0 32)) (_ bv1 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21|))))) is different from false [2023-12-16 16:14:34,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:34,984 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2023-12-16 16:14:34,991 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 90 [2023-12-16 16:14:35,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:35,001 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 76 [2023-12-16 16:14:35,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 114 [2023-12-16 16:14:35,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:35,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 52 [2023-12-16 16:14:35,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:35,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 30 [2023-12-16 16:14:35,160 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-16 16:14:35,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-16 16:14:40,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:40,127 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 45 [2023-12-16 16:14:40,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:14:40,133 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 127 treesize of output 115 [2023-12-16 16:14:40,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:40,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 33 [2023-12-16 16:14:40,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:40,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 25 [2023-12-16 16:14:40,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:40,236 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2023-12-16 16:14:40,240 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 60 treesize of output 52 [2023-12-16 16:14:40,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:14:40,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 48 [2023-12-16 16:14:40,255 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 22 treesize of output 20 [2023-12-16 16:14:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-16 16:14:40,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:14:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860285326] [2023-12-16 16:14:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860285326] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:14:40,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:14:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-12-16 16:14:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196906262] [2023-12-16 16:14:40,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:14:40,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 16:14:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:14:40,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 16:14:40,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=351, Unknown=6, NotChecked=78, Total=506 [2023-12-16 16:14:40,361 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:14:41,772 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-12-16 16:14:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 16:14:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 16:14:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:14:41,773 INFO L225 Difference]: With dead ends: 29 [2023-12-16 16:14:41,773 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:14:41,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=211, Invalid=721, Unknown=6, NotChecked=118, Total=1056 [2023-12-16 16:14:41,774 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 16:14:41,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 72 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 47 Unchecked, 0.6s Time] [2023-12-16 16:14:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:14:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-16 16:14:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-12-16 16:14:41,779 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2023-12-16 16:14:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:14:41,779 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-12-16 16:14:41,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:14:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-12-16 16:14:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:14:41,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:14:41,779 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2023-12-16 16:14:41,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-16 16:14:41,980 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-16 16:14:41,980 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:14:41,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:14:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash -182803551, now seen corresponding path program 6 times [2023-12-16 16:14:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:14:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940303997] [2023-12-16 16:14:41,981 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 16:14:41,981 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-16 16:14:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:14:41,982 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-16 16:14:41,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:14:42,101 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-16 16:14:42,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:14:42,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-16 16:14:42,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:14:42,140 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-16 16:14:42,145 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-16 16:14:42,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-16 16:14:42,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-12-16 16:14:42,204 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-12-16 16:14:42,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2023-12-16 16:14:42,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-16 16:14:42,237 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 16:14:42,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 16:14:42,293 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:14:42,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2023-12-16 16:14:42,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-12-16 16:14:42,379 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2023-12-16 16:14:42,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 53 [2023-12-16 16:14:42,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-12-16 16:14:42,400 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-12-16 16:14:42,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 52 [2023-12-16 16:14:44,566 INFO L349 Elim1Store]: treesize reduction 32, result has 85.8 percent of original size [2023-12-16 16:14:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 218 treesize of output 314 [2023-12-16 16:14:45,556 INFO L349 Elim1Store]: treesize reduction 40, result has 82.2 percent of original size [2023-12-16 16:14:45,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 114 treesize of output 266 [2023-12-16 16:15:17,631 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2023-12-16 16:15:17,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 56 [2023-12-16 16:15:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:17,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:18,190 INFO L349 Elim1Store]: treesize reduction 31, result has 76.2 percent of original size [2023-12-16 16:15:18,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 110 [2023-12-16 16:15:18,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:18,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 260 [2023-12-16 16:15:18,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:18,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 210 [2023-12-16 16:15:19,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse3 (bvadd (_ bv4 32) .cse5))) (let ((.cse4 (select (select .cse6 .cse2) .cse3))) (or (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 32) (select (select .cse1 .cse2) .cse3)) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse4 .cse5))))))))) (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22)) (.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse11 (bvadd (_ bv4 32) (select (select .cse10 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)))) (let ((.cse8 (select (select .cse12 .cse9) .cse11))) (or (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 32) .cse8) (= .cse9 .cse8) (= (select (select .cse10 .cse9) .cse11) |c_ULTIMATE.start_main_~p~0#1.offset|)))))))) (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse16 (bvadd (_ bv4 32) .cse17))) (let ((.cse13 (select (select .cse18 .cse15) .cse16))) (or (= .cse13 (_ bv0 32)) (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select .cse14 .cse15) .cse16)) (= .cse13 .cse17))))))))) (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22)) (.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse22 (bvadd (_ bv4 32) (select (select .cse23 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)))) (let ((.cse19 (select (select .cse23 .cse20) .cse22))) (or (= .cse19 (_ bv0 32)) (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse20 (select (select .cse21 .cse20) .cse22)) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22))) (let ((.cse28 (select (select .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21))) (let ((.cse26 (select (select .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse27 (bvadd (_ bv4 32) .cse28))) (let ((.cse24 (select (select .cse29 .cse26) .cse27))) (or (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 32) .cse24) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24) (= (select (select .cse25 .cse26) .cse27) .cse28))))))) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22)) (.cse34 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (.cse32 (bvadd (_ bv4 32) (select (select .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)))) (let ((.cse33 (select (select .cse34 .cse31) .cse32))) (or (= (select (select .cse30 .cse31) .cse32) (_ bv0 32)) (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (= .cse31 .cse33)))))) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7))) (let ((.cse35 (select (select .cse37 .cse36) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) |c_ULTIMATE.start_main_~p~0#1.base|) .cse7))))) (or (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 32) .cse35) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse35) (= .cse36 .cse35)))))) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~p~0#1.base|) .cse7))) (let ((.cse38 (select (select .cse40 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~p~0#1.base|) .cse7)) (bvadd (_ bv4 32) .cse39)))) (or (= .cse38 (_ bv0 32)) (not (= (select v_arrayElimArr_21 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse38 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse38 .cse39)))))) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) is different from false [2023-12-16 16:15:29,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 158 [2023-12-16 16:15:29,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 138 [2023-12-16 16:15:29,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 153 [2023-12-16 16:15:29,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 138 [2023-12-16 16:15:29,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 163 [2023-12-16 16:15:29,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 138 [2023-12-16 16:15:29,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 168 [2023-12-16 16:15:29,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 138 [2023-12-16 16:15:29,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 168 [2023-12-16 16:15:29,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 138 [2023-12-16 16:15:29,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 153 [2023-12-16 16:15:29,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 138 [2023-12-16 16:15:29,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 163 [2023-12-16 16:15:29,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 138 [2023-12-16 16:15:29,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:29,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 158 [2023-12-16 16:15:30,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:15:30,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 138 [2023-12-16 16:15:30,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_25) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2))) (let ((.cse1 (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_26) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21) |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (bvadd .cse0 (_ bv4 32))))) (or (= .cse0 .cse1) (not (= (select v_arrayElimArr_26 .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (= .cse1 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_25 .cse2))) (= .cse1 |c_ULTIMATE.start_main_~t~0#1.offset|) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_35) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22)) (.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_36) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse6 (bvadd (_ bv4 32) (select (select .cse8 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)))) (let ((.cse7 (select (select .cse8 .cse5) .cse6))) (or (not (= (select v_arrayElimArr_35 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_36 .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (= (select (select .cse4 .cse5) .cse6) .cse5) (= .cse7 (_ bv0 32)) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse7 |c_ULTIMATE.start_main_~t~0#1.offset|) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_31 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22)) (.cse13 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_32) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse9 (select (select .cse13 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse12 (bvadd (_ bv4 32) (select (select .cse11 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)))) (let ((.cse10 (select (select .cse13 .cse9) .cse12))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_32 .cse2))) (= .cse9 .cse10) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (select v_arrayElimArr_31 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select (select .cse11 .cse9) .cse12) (_ bv0 32)) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (= .cse10 |c_ULTIMATE.start_main_~t~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_37) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse16 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_38) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse18 (bvadd (_ bv4 32) .cse14))) (let ((.cse15 (select (select .cse19 .cse17) .cse18))) (or (= .cse14 .cse15) (= .cse15 (_ bv0 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select (select .cse16 .cse17) .cse18) |c_ULTIMATE.start_main_~t~0#1.base|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_38 .cse2))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_37 .cse2))) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_33) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2))) (let ((.cse20 (select (select .cse22 .cse21) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_34) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22) |c_ULTIMATE.start_main_~t~0#1.base|) .cse2))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_33 .cse2))) (= .cse20 (_ bv0 32)) (= .cse20 .cse21) (not (= (select v_arrayElimArr_34 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.base| .cse20) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse23 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_24) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse24 (select (select .cse23 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse25 (bvadd (_ bv4 32) .cse27))) (let ((.cse26 (select (select .cse28 .cse24) .cse25))) (or (= (select (select .cse23 .cse24) .cse25) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_24 .cse2))) (= .cse26 |c_ULTIMATE.start_main_~t~0#1.offset|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse27 .cse26) (not (= (select v_arrayElimArr_23 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse34 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse33 (bvadd (_ bv4 32) .cse30))) (let ((.cse29 (select (select .cse34 .cse32) .cse33))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (= .cse29 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_28 .cse2))) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse30 (select (select .cse31 .cse32) .cse33)) (not (= (select v_arrayElimArr_27 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.base| .cse29) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22)) (.cse39 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse36 (select (select .cse39 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)) (.cse37 (bvadd (_ bv4 32) (select (select .cse35 |c_ULTIMATE.start_main_~t~0#1.base|) .cse2)))) (let ((.cse38 (select (select .cse39 .cse36) .cse37))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_30 .cse2))) (= (select (select .cse35 .cse36) .cse37) |c_ULTIMATE.start_main_~t~0#1.offset|) (= .cse36 .cse38) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (select v_arrayElimArr_21 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= (select v_arrayElimArr_29 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv0 32) .cse38) (not (= (select v_arrayElimArr_22 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|))))))))) is different from false Received shutdown request... [2023-12-16 16:15:30,748 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-16 16:15:30,777 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:15:31,784 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-16 16:15:31,949 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 16:15:31,969 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:15:31,970 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-16 16:15:31,972 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-12-16 16:15:31,974 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:15:31,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-16 16:15:31,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:15:31 BoogieIcfgContainer [2023-12-16 16:15:31,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:15:31,981 INFO L158 Benchmark]: Toolchain (without parser) took 75104.60ms. Allocated memory was 242.2MB in the beginning and 625.0MB in the end (delta: 382.7MB). Free memory was 188.3MB in the beginning and 376.9MB in the end (delta: -188.6MB). Peak memory consumption was 195.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:31,981 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 175.1MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:15:31,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.98ms. Allocated memory is still 242.2MB. Free memory was 188.3MB in the beginning and 170.2MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 16:15:31,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.63ms. Allocated memory is still 242.2MB. Free memory was 170.0MB in the beginning and 168.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:31,984 INFO L158 Benchmark]: Boogie Preprocessor took 48.99ms. Allocated memory is still 242.2MB. Free memory was 168.1MB in the beginning and 165.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:31,984 INFO L158 Benchmark]: RCFGBuilder took 354.85ms. Allocated memory is still 242.2MB. Free memory was 165.8MB in the beginning and 152.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 16:15:31,985 INFO L158 Benchmark]: TraceAbstraction took 74363.58ms. Allocated memory was 242.2MB in the beginning and 625.0MB in the end (delta: 382.7MB). Free memory was 151.7MB in the beginning and 376.9MB in the end (delta: -225.2MB). Peak memory consumption was 158.4MB. Max. memory is 8.0GB. [2023-12-16 16:15:31,988 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.20ms. Allocated memory is still 175.1MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.98ms. Allocated memory is still 242.2MB. Free memory was 188.3MB in the beginning and 170.2MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.63ms. Allocated memory is still 242.2MB. Free memory was 170.0MB in the beginning and 168.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.99ms. Allocated memory is still 242.2MB. Free memory was 168.1MB in the beginning and 165.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.85ms. Allocated memory is still 242.2MB. Free memory was 165.8MB in the beginning and 152.4MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 74363.58ms. Allocated memory was 242.2MB in the beginning and 625.0MB in the end (delta: 382.7MB). Free memory was 151.7MB in the beginning and 376.9MB in the end (delta: -225.2MB). Peak memory consumption was 158.4MB. 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: 543]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 543). Cancelled while NwaCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.3s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 102 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 355 IncrementalHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 68 mSDtfsCounter, 355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 181 ConstructedInterpolants, 28 QuantifiedInterpolants, 5115 SizeOfPredicates, 50 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 45/144 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