/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-24 20:55:05,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:55:05,400 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-24 20:55:05,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:55:05,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:55:05,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:55:05,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:55:05,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:55:05,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:55:05,437 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:55:05,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:55:05,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:55:05,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:55:05,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:55:05,439 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:55:05,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:55:05,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:55:05,439 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:55:05,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:55:05,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:55:05,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:55:05,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:55:05,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:55:05,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:55:05,441 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:55:05,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:55:05,442 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:55:05,442 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:55:05,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:55:05,442 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:55:05,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:55:05,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:55:05,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:55:05,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:55:05,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:55:05,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:55:05,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:55:05,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:55:05,444 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:55:05,444 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:55:05,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:55:05,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:55:05,444 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:55:05,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:55:05,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:55:05,445 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:55:05,445 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-24 20:55:05,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:55:05,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:55:05,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:55:05,647 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:55:05,647 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:55:05,648 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-24 20:55:06,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:55:06,885 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:55:06,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.i [2023-12-24 20:55:06,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba662f71b/8ee92fb4d23947939e71f54a50ab1793/FLAG7c3b13197 [2023-12-24 20:55:06,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba662f71b/8ee92fb4d23947939e71f54a50ab1793 [2023-12-24 20:55:06,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:55:06,907 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:55:06,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:55:06,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:55:06,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:55:06,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:55:06" (1/1) ... [2023-12-24 20:55:06,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfb13c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:06, skipping insertion in model container [2023-12-24 20:55:06,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:55:06" (1/1) ... [2023-12-24 20:55:06,959 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:55:07,232 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-24 20:55:07,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:55:07,258 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:55:07,302 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-24 20:55:07,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:55:07,327 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:55:07,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07 WrapperNode [2023-12-24 20:55:07,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:55:07,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:55:07,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:55:07,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:55:07,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,361 INFO L138 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-12-24 20:55:07,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:55:07,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:55:07,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:55:07,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:55:07,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,386 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-24 20:55:07,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:55:07,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:55:07,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:55:07,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:55:07,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (1/1) ... [2023-12-24 20:55:07,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:55:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:55:07,434 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-24 20:55:07,436 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-24 20:55:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:55:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:55:07,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 20:55:07,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:55:07,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 20:55:07,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 20:55:07,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 20:55:07,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 20:55:07,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:55:07,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:55:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:55:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:55:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:55:07,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:55:07,551 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:55:07,552 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:55:07,663 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:55:07,699 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:55:07,699 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 20:55:07,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:55:07 BoogieIcfgContainer [2023-12-24 20:55:07,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:55:07,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:55:07,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:55:07,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:55:07,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:55:06" (1/3) ... [2023-12-24 20:55:07,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f85b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:55:07, skipping insertion in model container [2023-12-24 20:55:07,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:55:07" (2/3) ... [2023-12-24 20:55:07,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f85b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:55:07, skipping insertion in model container [2023-12-24 20:55:07,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:55:07" (3/3) ... [2023-12-24 20:55:07,711 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2023-12-24 20:55:07,725 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:55:07,725 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:55:07,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:55:07,772 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;@74ca2baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:55:07,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:55:07,777 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-24 20:55:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-24 20:55:07,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:07,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-24 20:55:07,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:07,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash 73644442, now seen corresponding path program 1 times [2023-12-24 20:55:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683790779] [2023-12-24 20:55:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:07,803 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-24 20:55:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:07,806 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-24 20:55:07,807 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-24 20:55:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:07,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:55:07,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:07,908 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-24 20:55:07,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:55:07,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683790779] [2023-12-24 20:55:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683790779] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:55:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:55:07,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:55:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996333190] [2023-12-24 20:55:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:55:07,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:55:07,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:55:07,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:55:07,946 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-24 20:55:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:07,975 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2023-12-24 20:55:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:55:07,977 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-24 20:55:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:07,982 INFO L225 Difference]: With dead ends: 19 [2023-12-24 20:55:07,983 INFO L226 Difference]: Without dead ends: 9 [2023-12-24 20:55:07,985 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-24 20:55:07,988 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-24 20:55:07,988 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-24 20:55:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-24 20:55:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-24 20:55:08,010 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-24 20:55:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-12-24 20:55:08,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2023-12-24 20:55:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:08,011 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-12-24 20:55:08,012 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-24 20:55:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-12-24 20:55:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 20:55:08,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:08,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 20:55:08,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 20:55:08,215 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-24 20:55:08,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:08,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2026470929, now seen corresponding path program 1 times [2023-12-24 20:55:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446646486] [2023-12-24 20:55:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:08,218 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-24 20:55:08,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:08,219 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-24 20:55:08,221 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-24 20:55:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:08,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 20:55:08,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:08,354 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-24 20:55:08,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:55:08,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:08,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446646486] [2023-12-24 20:55:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446646486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:55:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:55:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:55:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149652389] [2023-12-24 20:55:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:55:08,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 20:55:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 20:55:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 20:55:08,357 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-24 20:55:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:08,388 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2023-12-24 20:55:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 20:55:08,389 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-24 20:55:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:08,389 INFO L225 Difference]: With dead ends: 18 [2023-12-24 20:55:08,389 INFO L226 Difference]: Without dead ends: 12 [2023-12-24 20:55:08,389 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-24 20:55:08,390 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-24 20:55:08,391 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-24 20:55:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-24 20:55:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-24 20:55:08,393 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-24 20:55:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-12-24 20:55:08,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2023-12-24 20:55:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:08,406 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-12-24 20:55:08,406 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-24 20:55:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-12-24 20:55:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 20:55:08,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:08,407 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:08,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 20:55:08,609 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-24 20:55:08,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:08,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1758149216, now seen corresponding path program 1 times [2023-12-24 20:55:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396108070] [2023-12-24 20:55:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:08,613 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-24 20:55:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:08,614 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-24 20:55:08,616 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-24 20:55:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:08,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 20:55:08,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:08,707 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-24 20:55:08,726 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-24 20:55:08,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:55:08,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396108070] [2023-12-24 20:55:08,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396108070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:55:08,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:55:08,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 20:55:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115877727] [2023-12-24 20:55:08,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:55:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 20:55:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 20:55:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 20:55:08,728 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-24 20:55:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:08,780 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-24 20:55:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 20:55:08,780 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-24 20:55:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:08,781 INFO L225 Difference]: With dead ends: 17 [2023-12-24 20:55:08,781 INFO L226 Difference]: Without dead ends: 15 [2023-12-24 20:55:08,781 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-24 20:55:08,782 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-24 20:55:08,782 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-24 20:55:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-24 20:55:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2023-12-24 20:55:08,784 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-24 20:55:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-24 20:55:08,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2023-12-24 20:55:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:08,785 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-24 20:55:08,785 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-24 20:55:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-24 20:55:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 20:55:08,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:08,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:08,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 20:55:08,988 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-24 20:55:08,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:08,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash -98083423, now seen corresponding path program 1 times [2023-12-24 20:55:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:08,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695599000] [2023-12-24 20:55:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:55:08,990 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-24 20:55:08,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:09,005 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-24 20:55:09,009 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-24 20:55:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:55:09,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 20:55:09,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:09,087 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-24 20:55:09,092 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-24 20:55:09,136 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-24 20:55:09,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:09,183 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-24 20:55:09,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695599000] [2023-12-24 20:55:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695599000] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:09,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-12-24 20:55:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766563166] [2023-12-24 20:55:09,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:09,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 20:55:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 20:55:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 20:55:09,185 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-24 20:55:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:09,242 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2023-12-24 20:55:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 20:55:09,242 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-24 20:55:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:09,243 INFO L225 Difference]: With dead ends: 26 [2023-12-24 20:55:09,243 INFO L226 Difference]: Without dead ends: 17 [2023-12-24 20:55:09,243 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-24 20:55:09,243 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-24 20:55:09,244 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-24 20:55:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-24 20:55:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-12-24 20:55:09,246 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-24 20:55:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-24 20:55:09,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2023-12-24 20:55:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:09,247 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-24 20:55:09,247 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-24 20:55:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-24 20:55:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 20:55:09,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:09,247 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 20:55:09,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 20:55:09,450 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-24 20:55:09,450 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:09,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 821181778, now seen corresponding path program 2 times [2023-12-24 20:55:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:09,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186791744] [2023-12-24 20:55:09,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:55:09,452 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-24 20:55:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:09,453 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-24 20:55:09,454 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-24 20:55:09,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:55:09,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:09,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 20:55:09,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:09,536 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-24 20:55:09,554 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-24 20:55:09,605 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:55:09,605 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-24 20:55:09,639 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-24 20:55:09,647 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-24 20:55:09,651 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-24 20:55:09,737 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-24 20:55:09,741 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-24 20:55:09,764 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-24 20:55:09,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:10,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:10,684 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-24 20:55:10,688 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-24 20:55:10,692 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-24 20:55:10,708 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-24 20:55:10,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186791744] [2023-12-24 20:55:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186791744] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:10,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-24 20:55:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349912994] [2023-12-24 20:55:10,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:10,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 20:55:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 20:55:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=118, Unknown=6, NotChecked=0, Total=156 [2023-12-24 20:55:10,710 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-24 20:55:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:11,056 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-12-24 20:55:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 20:55:11,057 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-24 20:55:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:11,057 INFO L225 Difference]: With dead ends: 23 [2023-12-24 20:55:11,057 INFO L226 Difference]: Without dead ends: 21 [2023-12-24 20:55:11,058 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-24 20:55:11,058 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-24 20:55:11,058 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-24 20:55:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-24 20:55:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-12-24 20:55:11,062 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-24 20:55:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-12-24 20:55:11,062 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2023-12-24 20:55:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:11,063 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-12-24 20:55:11,063 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-24 20:55:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-12-24 20:55:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 20:55:11,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:11,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-12-24 20:55:11,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 20:55:11,267 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-24 20:55:11,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:11,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash -302572177, now seen corresponding path program 3 times [2023-12-24 20:55:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:11,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199763122] [2023-12-24 20:55:11,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 20:55:11,268 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-24 20:55:11,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:11,269 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-24 20:55:11,270 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-24 20:55:11,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 20:55:11,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:11,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 20:55:11,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:11,370 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-24 20:55:11,375 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-24 20:55:11,423 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-24 20:55:11,439 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-12-24 20:55:11,439 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-24 20:55:11,450 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-24 20:55:11,500 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 20:55:11,501 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-24 20:55:11,511 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-24 20:55:11,836 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-12-24 20:55:11,837 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-24 20:55:11,903 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-12-24 20:55:11,904 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-24 20:55:12,342 INFO L349 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2023-12-24 20:55:12,343 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-24 20:55:12,361 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-24 20:55:12,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:12,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:12,594 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-24 20:55:12,615 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-24 20:55:12,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:12,628 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-24 20:55:12,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-24 20:55:12,759 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-24 20:55:13,115 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-24 20:55:17,187 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-24 20:55:17,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:17,306 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-24 20:55:17,310 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-24 20:55:17,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:17,318 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-24 20:55:17,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:17,335 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-24 20:55:17,340 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-24 20:55:17,346 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-24 20:55:17,360 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-24 20:55:17,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199763122] [2023-12-24 20:55:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199763122] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:17,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:17,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-24 20:55:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221569576] [2023-12-24 20:55:17,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:17,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 20:55:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 20:55:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=124, Unknown=2, NotChecked=46, Total=210 [2023-12-24 20:55:17,362 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-24 20:55:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:18,161 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-12-24 20:55:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:55:18,161 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-24 20:55:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:18,162 INFO L225 Difference]: With dead ends: 34 [2023-12-24 20:55:18,162 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 20:55:18,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=98, Invalid=328, Unknown=2, NotChecked=78, Total=506 [2023-12-24 20:55:18,163 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.4s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:18,163 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.4s Time] [2023-12-24 20:55:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 20:55:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2023-12-24 20:55:18,167 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-24 20:55:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-12-24 20:55:18,168 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2023-12-24 20:55:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:18,168 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-12-24 20:55:18,168 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-24 20:55:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-12-24 20:55:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 20:55:18,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:18,168 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2023-12-24 20:55:18,175 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-24 20:55:18,369 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-24 20:55:18,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:18,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1213426738, now seen corresponding path program 4 times [2023-12-24 20:55:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:18,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402604755] [2023-12-24 20:55:18,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 20:55:18,370 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-24 20:55:18,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:18,371 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-24 20:55:18,377 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-24 20:55:18,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 20:55:18,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:18,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 20:55:18,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:18,490 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-24 20:55:18,510 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-24 20:55:18,516 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-24 20:55:18,557 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:55:18,557 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-24 20:55:18,586 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-24 20:55:18,591 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-24 20:55:18,597 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-24 20:55:18,603 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-24 20:55:18,785 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-24 20:55:18,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:18,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:18,865 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-24 20:55:18,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:18,875 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-24 20:55:19,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:19,045 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-24 20:55:19,048 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-24 20:55:19,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:19,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-24 20:55:19,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:19,084 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-24 20:55:19,088 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-24 20:55:19,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:19,097 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-24 20:55:19,192 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-24 20:55:19,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:19,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402604755] [2023-12-24 20:55:19,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402604755] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:19,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:19,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-24 20:55:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127820539] [2023-12-24 20:55:19,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:19,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 20:55:19,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:19,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 20:55:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=120, Unknown=5, NotChecked=0, Total=156 [2023-12-24 20:55:19,194 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-24 20:55:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:19,598 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2023-12-24 20:55:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 20:55:19,599 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-24 20:55:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:19,599 INFO L225 Difference]: With dead ends: 36 [2023-12-24 20:55:19,599 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 20:55:19,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=139, Unknown=5, NotChecked=0, Total=182 [2023-12-24 20:55:19,600 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-24 20:55:19,600 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-24 20:55:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 20:55:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-12-24 20:55:19,603 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-24 20:55:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-12-24 20:55:19,604 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2023-12-24 20:55:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:19,604 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-12-24 20:55:19,604 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-24 20:55:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-12-24 20:55:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 20:55:19,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:19,605 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2023-12-24 20:55:19,610 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-24 20:55:19,808 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-24 20:55:19,811 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:19,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2045922208, now seen corresponding path program 5 times [2023-12-24 20:55:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848037679] [2023-12-24 20:55:19,812 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 20:55:19,812 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-24 20:55:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:19,813 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-24 20:55:19,816 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-24 20:55:19,943 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-24 20:55:19,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:19,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-24 20:55:19,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:19,954 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-24 20:55:19,965 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-24 20:55:20,008 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-24 20:55:20,008 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-24 20:55:20,050 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-24 20:55:20,053 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-24 20:55:20,058 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-24 20:55:20,128 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-24 20:55:20,128 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-24 20:55:20,193 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-24 20:55:20,197 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-24 20:55:20,206 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-24 20:55:20,214 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-24 20:55:20,221 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-24 20:55:20,615 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 20:55:20,615 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-24 20:55:20,622 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-24 20:55:20,678 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-24 20:55:20,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:55:20,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:20,905 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-24 20:55:20,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:20,915 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-24 20:55:20,947 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-24 20:55:21,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:21,347 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-24 20:55:21,355 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-24 20:55:21,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:21,366 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-24 20:55:21,372 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-24 20:55:21,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:21,386 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-24 20:55:21,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:21,400 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-24 20:55:21,528 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-24 20:55:21,528 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-24 20:55:26,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:26,400 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-24 20:55:26,403 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:55:26,409 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-24 20:55:26,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:26,422 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-24 20:55:26,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:26,435 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-24 20:55:26,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:26,489 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-24 20:55:26,493 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-24 20:55:26,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:55:26,504 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-24 20:55:26,509 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-24 20:55:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-24 20:55:26,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:55:26,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848037679] [2023-12-24 20:55:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848037679] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:55:26,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:55:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-12-24 20:55:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355913451] [2023-12-24 20:55:26,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:55:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-24 20:55:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:55:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-24 20:55:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=377, Unknown=15, NotChecked=40, Total=506 [2023-12-24 20:55:26,683 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-24 20:55:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:55:27,820 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-12-24 20:55:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:55:27,821 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-24 20:55:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:55:27,821 INFO L225 Difference]: With dead ends: 29 [2023-12-24 20:55:27,821 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 20:55:27,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=221, Invalid=760, Unknown=15, NotChecked=60, Total=1056 [2023-12-24 20:55:27,822 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 20:55:27,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 25 Unchecked, 0.5s Time] [2023-12-24 20:55:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 20:55:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-12-24 20:55:27,826 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-24 20:55:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-12-24 20:55:27,826 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2023-12-24 20:55:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:55:27,826 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-12-24 20:55:27,826 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-24 20:55:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-12-24 20:55:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 20:55:27,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:55:27,827 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2023-12-24 20:55:27,831 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-24 20:55:28,027 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-24 20:55:28,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:55:28,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:55:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash -182803551, now seen corresponding path program 6 times [2023-12-24 20:55:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:55:28,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463902992] [2023-12-24 20:55:28,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-24 20:55:28,028 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-24 20:55:28,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:55:28,030 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-24 20:55:28,031 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-24 20:55:28,125 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-24 20:55:28,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:55:28,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 20:55:28,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:55:28,153 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-24 20:55:28,158 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-24 20:55:28,180 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-24 20:55:28,204 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-24 20:55:28,225 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-12-24 20:55:28,225 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-24 20:55:28,227 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-24 20:55:28,249 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 20:55:28,249 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-24 20:55:28,299 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 20:55:28,299 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-24 20:55:28,359 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-24 20:55:28,379 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2023-12-24 20:55:28,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-24 20:55:28,382 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-24 20:55:28,398 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2023-12-24 20:55:28,398 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-24 20:55:30,292 INFO L349 Elim1Store]: treesize reduction 32, result has 85.8 percent of original size [2023-12-24 20:55:30,293 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-24 20:55:31,118 INFO L349 Elim1Store]: treesize reduction 40, result has 82.2 percent of original size [2023-12-24 20:55:31,119 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-24 20:56:02,400 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2023-12-24 20:56:02,401 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-24 20:56:02,440 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-24 20:56:02,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:56:02,875 INFO L349 Elim1Store]: treesize reduction 31, result has 76.2 percent of original size [2023-12-24 20:56:02,875 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-24 20:56:03,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:03,255 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-24 20:56:03,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:03,265 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-24 20:56:04,053 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-24 20:56:15,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,024 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-24 20:56:15,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,040 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-24 20:56:15,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,114 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-24 20:56:15,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,127 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-24 20:56:15,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,210 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-24 20:56:15,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,225 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-24 20:56:15,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,296 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-24 20:56:15,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,313 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-24 20:56:15,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,393 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-24 20:56:15,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,408 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-24 20:56:15,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,486 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-24 20:56:15,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,506 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-24 20:56:15,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,583 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-24 20:56:15,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,601 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-24 20:56:15,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,698 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-24 20:56:15,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:15,716 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-24 20:56:20,596 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 [2023-12-24 20:56:22,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:22,962 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 6 treesize of output 4 [2023-12-24 20:56:23,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:23,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 6 treesize of output 4 [2023-12-24 20:56:23,489 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:23,509 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 6 treesize of output 4 [2023-12-24 20:56:23,759 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:23,781 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 6 treesize of output 4 [2023-12-24 20:56:24,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:24,067 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 6 treesize of output 4 [2023-12-24 20:56:24,273 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:24,296 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 6 treesize of output 4 [2023-12-24 20:56:24,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:24,558 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 6 treesize of output 4 [2023-12-24 20:56:24,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 20:56:24,810 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 6 treesize of output 4 [2023-12-24 20:56:25,060 WARN L854 $PredicateComparison]: unable to prove that (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 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_arrayElimArr_25) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse1 (select (select .cse2 .cse3) (_ bv4 32)))) (let ((.cse0 (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_arrayElimArr_26) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21) .cse3) (_ bv4 32))) (bvadd (_ bv4 32) .cse1)))) (or (= .cse0 (_ bv0 32)) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_25 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_26 (_ bv4 32)))) (= .cse0 .cse1))))))) (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 ((.cse6 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_arrayElimArr_37) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse5 (select (select .cse10 .cse6) (_ bv4 32))) (.cse7 (store (store |c_#memory_$Pointer$#1.base| .cse6 v_arrayElimArr_38) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse8 (select (select .cse7 .cse6) (_ bv4 32))) (.cse9 (bvadd (_ bv4 32) .cse5))) (let ((.cse4 (select (select .cse10 .cse8) .cse9))) (or (= .cse4 (_ bv0 32)) (= .cse5 .cse4) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_38 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_37 (_ bv4 32)))) (= .cse6 (select (select .cse7 .cse8) .cse9))))))))) (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 ((.cse16 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| .cse16 v_arrayElimArr_27) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse14 (select (select .cse11 .cse16) (_ bv4 32))) (.cse17 (store (store |c_#memory_$Pointer$#1.base| .cse16 v_arrayElimArr_28) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse12 (select (select .cse17 .cse16) (_ bv4 32))) (.cse13 (bvadd (_ bv4 32) .cse14))) (let ((.cse15 (select (select .cse17 .cse12) .cse13))) (or (= (select (select .cse11 .cse12) .cse13) .cse14) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (= .cse15 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_28 (_ bv4 32)))) (= .cse16 .cse15) (not (= (select v_arrayElimArr_27 (_ bv4 32)) |c_ULTIMATE.start_main_~p~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_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse21 (store (store |c_#memory_$Pointer$#1.offset| .cse20 v_arrayElimArr_31) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22)) (.cse23 (store (store |c_#memory_$Pointer$#1.base| .cse20 v_arrayElimArr_32) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse18 (select (select .cse23 .cse20) (_ bv4 32))) (.cse22 (bvadd (_ bv4 32) (select (select .cse21 .cse20) (_ bv4 32))))) (let ((.cse19 (select (select .cse23 .cse18) .cse22))) (or (= .cse18 .cse19) (= .cse20 .cse19) (not (= (select v_arrayElimArr_31 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (= (select (select .cse21 .cse18) .cse22) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_32 (_ bv4 32)))))))))) (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 ((.cse29 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse26 (store (store |c_#memory_$Pointer$#1.offset| .cse29 v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22)) (.cse28 (store (store |c_#memory_$Pointer$#1.base| .cse29 v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse25 (select (select .cse28 .cse29) (_ bv4 32))) (.cse27 (bvadd (_ bv4 32) (select (select .cse26 .cse29) (_ bv4 32))))) (let ((.cse24 (select (select .cse28 .cse25) .cse27))) (or (= .cse24 .cse25) (= (_ bv0 32) (select (select .cse26 .cse25) .cse27)) (= .cse24 (_ bv0 32)) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_30 (_ bv4 32)))) (not (= (select v_arrayElimArr_29 (_ bv4 32)) |c_ULTIMATE.start_main_~p~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 ((.cse36 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse35 (store (store |c_#memory_$Pointer$#1.offset| .cse36 v_arrayElimArr_23) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22))) (let ((.cse31 (select (select .cse35 .cse36) (_ bv4 32))) (.cse32 (store (store |c_#memory_$Pointer$#1.base| .cse36 v_arrayElimArr_24) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse33 (select (select .cse32 .cse36) (_ bv4 32))) (.cse34 (bvadd (_ bv4 32) .cse31))) (let ((.cse30 (select (select .cse35 .cse33) .cse34))) (or (= .cse30 (_ bv0 32)) (not (= (select v_arrayElimArr_24 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse30 .cse31) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (not (= (select v_arrayElimArr_23 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select .cse32 .cse33) .cse34) (_ bv0 32))))))))) (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 ((.cse41 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse40 (store (store |c_#memory_$Pointer$#1.offset| .cse41 v_arrayElimArr_35) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22)) (.cse38 (store (store |c_#memory_$Pointer$#1.base| .cse41 v_arrayElimArr_36) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse37 (select (select .cse38 .cse41) (_ bv4 32))) (.cse39 (bvadd (_ bv4 32) (select (select .cse40 .cse41) (_ bv4 32))))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_36 (_ bv4 32)))) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (= .cse37 (select (select .cse38 .cse37) .cse39)) (not (= (select v_arrayElimArr_35 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select .cse40 .cse37) .cse39) (_ bv0 32))))))) (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 ((.cse42 (select v_arrayElimArr_21 (_ bv4 32)))) (let ((.cse45 (store (store |c_#memory_$Pointer$#1.base| .cse42 v_arrayElimArr_33) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_21))) (let ((.cse44 (select (select .cse45 .cse42) (_ bv4 32)))) (let ((.cse43 (select (select .cse45 .cse44) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse42 v_arrayElimArr_34) |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_22) .cse42) (_ bv4 32)))))) (or (= .cse42 .cse43) (not (= (select v_arrayElimArr_34 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_22 (_ bv4 32)) (_ bv0 32))) (= .cse43 (_ bv0 32)) (= .cse44 .cse43) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_33 (_ bv4 32))))))))))) is different from false [2023-12-24 20:56:28,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:28,130 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 290 treesize of output 246 [2023-12-24 20:56:28,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:28,210 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 234 treesize of output 162 [2023-12-24 20:56:28,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:56:28,727 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2023-12-24 20:56:28,727 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 984 treesize of output 902 [2023-12-24 20:56:28,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:56:29,190 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-12-24 20:56:29,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 763 treesize of output 737 [2023-12-24 20:56:29,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:29,374 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 252 treesize of output 218 [2023-12-24 20:56:29,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:29,552 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 198 treesize of output 152 [2023-12-24 20:56:29,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:29,729 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 39 treesize of output 35 [2023-12-24 20:56:29,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:29,874 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2023-12-24 20:56:31,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:31,238 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 272 treesize of output 210 [2023-12-24 20:56:31,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:31,310 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 200 treesize of output 162 [2023-12-24 20:56:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:56:31,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:56:31,661 INFO L349 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2023-12-24 20:56:31,662 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 1696 treesize of output 1522 [2023-12-24 20:56:31,722 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 341 treesize of output 311 [2023-12-24 20:56:31,788 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 13 treesize of output 9 [2023-12-24 20:56:31,861 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:56:31,861 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 270 treesize of output 1 [2023-12-24 20:56:31,917 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:56:31,917 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 272 treesize of output 1 [2023-12-24 20:56:31,972 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-24 20:56:31,972 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 189 treesize of output 1 [2023-12-24 20:56:32,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:32,045 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 272 treesize of output 246 [2023-12-24 20:56:32,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:56:32,119 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 236 treesize of output 162 [2023-12-24 20:56:32,154 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 280 treesize of output 274 [2023-12-24 20:56:32,190 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 666 treesize of output 624 [2023-12-24 20:56:32,264 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 13 treesize of output 9 [2023-12-24 20:56:32,296 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-24 20:56:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-12-24 20:56:32,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:56:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463902992] [2023-12-24 20:56:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463902992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:56:32,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:56:32,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-12-24 20:56:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506081033] [2023-12-24 20:56:32,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:56:32,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-24 20:56:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:56:32,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-24 20:56:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=555, Unknown=3, NotChecked=150, Total=812 [2023-12-24 20:56:32,469 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 28 states have internal predecessors, (43), 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-24 20:56:38,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 20:56:45,320 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 20:56:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 20:56:45,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2023-12-24 20:56:45,322 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:56:45,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 1 Unknown, 15 Unchecked, 7.0s Time] [2023-12-24 20:56:45,330 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 (10)] Ended with exit code 0 [2023-12-24 20:56:45,333 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 101 [2023-12-24 20:56:45,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:56:45,523 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2023-12-24 20:56:45,527 INFO L158 Benchmark]: Toolchain (without parser) took 98620.07ms. Allocated memory was 235.9MB in the beginning and 588.3MB in the end (delta: 352.3MB). Free memory was 186.0MB in the beginning and 238.5MB in the end (delta: -52.5MB). Peak memory consumption was 299.8MB. Max. memory is 8.0GB. [2023-12-24 20:56:45,527 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 196.1MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:56:45,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.00ms. Allocated memory is still 235.9MB. Free memory was 185.5MB in the beginning and 167.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 20:56:45,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.75ms. Allocated memory is still 235.9MB. Free memory was 167.7MB in the beginning and 165.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 20:56:45,528 INFO L158 Benchmark]: Boogie Preprocessor took 37.01ms. Allocated memory is still 235.9MB. Free memory was 165.6MB in the beginning and 163.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 20:56:45,528 INFO L158 Benchmark]: RCFGBuilder took 301.90ms. Allocated memory is still 235.9MB. Free memory was 163.0MB in the beginning and 150.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 20:56:45,528 INFO L158 Benchmark]: TraceAbstraction took 97823.38ms. Allocated memory was 235.9MB in the beginning and 588.3MB in the end (delta: 352.3MB). Free memory was 149.8MB in the beginning and 238.5MB in the end (delta: -88.7MB). Peak memory consumption was 263.1MB. Max. memory is 8.0GB. [2023-12-24 20:56:45,529 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.38ms. Allocated memory is still 196.1MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.00ms. Allocated memory is still 235.9MB. Free memory was 185.5MB in the beginning and 167.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.75ms. Allocated memory is still 235.9MB. Free memory was 167.7MB in the beginning and 165.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.01ms. Allocated memory is still 235.9MB. Free memory was 165.6MB in the beginning and 163.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 301.90ms. Allocated memory is still 235.9MB. Free memory was 163.0MB in the beginning and 150.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 97823.38ms. Allocated memory was 235.9MB in the beginning and 588.3MB in the end (delta: 352.3MB). Free memory was 149.8MB in the beginning and 238.5MB in the end (delta: -88.7MB). Peak memory consumption was 263.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...