/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/list_search-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 20:54:08,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 20:54:08,240 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:54:08,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 20:54:08,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 20:54:08,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 20:54:08,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 20:54:08,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 20:54:08,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 20:54:08,273 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 20:54:08,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 20:54:08,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 20:54:08,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 20:54:08,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 20:54:08,276 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 20:54:08,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 20:54:08,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 20:54:08,276 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 20:54:08,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 20:54:08,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 20:54:08,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 20:54:08,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 20:54:08,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 20:54:08,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 20:54:08,278 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 20:54:08,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 20:54:08,278 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 20:54:08,278 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 20:54:08,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 20:54:08,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 20:54:08,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 20:54:08,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 20:54:08,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 20:54:08,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 20:54:08,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:54:08,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 20:54:08,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 20:54:08,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 20:54:08,280 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 20:54:08,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 20:54:08,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 20:54:08,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 20:54:08,281 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 20:54:08,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 20:54:08,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 20:54:08,281 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 20:54:08,281 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:54:08,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 20:54:08,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 20:54:08,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 20:54:08,449 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 20:54:08,449 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 20:54:08,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-1.i [2023-12-24 20:54:09,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 20:54:09,834 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 20:54:09,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i [2023-12-24 20:54:09,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4ed32a4/7a2672a667ae45389a50fb4b7686fd5b/FLAG2894d062e [2023-12-24 20:54:09,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4ed32a4/7a2672a667ae45389a50fb4b7686fd5b [2023-12-24 20:54:09,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 20:54:09,859 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 20:54:09,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 20:54:09,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 20:54:09,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 20:54:09,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:54:09" (1/1) ... [2023-12-24 20:54:09,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515a0248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:09, skipping insertion in model container [2023-12-24 20:54:09,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 08:54:09" (1/1) ... [2023-12-24 20:54:09,909 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:54:10,059 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/list_search-1.i[813,826] [2023-12-24 20:54:10,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:54:10,216 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-24 20:54:10,231 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 20:54:10,234 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/list_search-1.i[813,826] [2023-12-24 20:54:10,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:54:10,267 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 20:54:10,276 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/list_search-1.i[813,826] [2023-12-24 20:54:10,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 20:54:10,333 INFO L206 MainTranslator]: Completed translation [2023-12-24 20:54:10,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10 WrapperNode [2023-12-24 20:54:10,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 20:54:10,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 20:54:10,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 20:54:10,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 20:54:10,340 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:54:10" (1/1) ... [2023-12-24 20:54:10,367 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:54:10" (1/1) ... [2023-12-24 20:54:10,381 INFO L138 Inliner]: procedures = 128, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2023-12-24 20:54:10,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 20:54:10,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 20:54:10,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 20:54:10,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 20:54:10,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,427 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-12-24 20:54:10,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 20:54:10,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 20:54:10,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 20:54:10,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 20:54:10,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (1/1) ... [2023-12-24 20:54:10,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 20:54:10,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 20:54:10,477 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:54:10,484 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:54:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2023-12-24 20:54:10,500 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 20:54:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 20:54:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 20:54:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 20:54:10,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 20:54:10,589 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 20:54:10,591 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 20:54:10,811 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 20:54:10,835 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 20:54:10,835 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 20:54:10,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:54:10 BoogieIcfgContainer [2023-12-24 20:54:10,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 20:54:10,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 20:54:10,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 20:54:10,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 20:54:10,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 08:54:09" (1/3) ... [2023-12-24 20:54:10,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1702d7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:54:10, skipping insertion in model container [2023-12-24 20:54:10,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 08:54:10" (2/3) ... [2023-12-24 20:54:10,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1702d7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 08:54:10, skipping insertion in model container [2023-12-24 20:54:10,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 08:54:10" (3/3) ... [2023-12-24 20:54:10,842 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2023-12-24 20:54:10,878 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 20:54:10,878 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 20:54:10,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 20:54:10,914 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;@55642441, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 20:54:10,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 20:54:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:54:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 20:54:10,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:10,923 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:10,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:10,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1970383394, now seen corresponding path program 1 times [2023-12-24 20:54:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:10,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917641254] [2023-12-24 20:54:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:54:10,939 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:54:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:10,941 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:54:10,942 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:54:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:54:11,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 20:54:11,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-24 20:54:11,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:54:11,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917641254] [2023-12-24 20:54:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917641254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:54:11,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:54:11,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 20:54:11,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636199149] [2023-12-24 20:54:11,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:54:11,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 20:54:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:11,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 20:54:11,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 20:54:11,202 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 20:54:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:11,222 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-12-24 20:54:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 20:54:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2023-12-24 20:54:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:11,228 INFO L225 Difference]: With dead ends: 32 [2023-12-24 20:54:11,228 INFO L226 Difference]: Without dead ends: 20 [2023-12-24 20:54:11,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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:54:11,233 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:11,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 20:54:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-24 20:54:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-24 20:54:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:54:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-24 20:54:11,258 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 29 [2023-12-24 20:54:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:11,260 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-24 20:54:11,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 20:54:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-24 20:54:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 20:54:11,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:11,263 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:11,268 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:54:11,468 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:54:11,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:11,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:11,470 INFO L85 PathProgramCache]: Analyzing trace with hash -961709975, now seen corresponding path program 1 times [2023-12-24 20:54:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:11,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927258332] [2023-12-24 20:54:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:54:11,471 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:54:11,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:11,472 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:54:11,473 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:54:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:54:11,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 20:54:11,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 20:54:11,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 20:54:11,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927258332] [2023-12-24 20:54:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927258332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:54:11,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:54:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-12-24 20:54:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123088593] [2023-12-24 20:54:11,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:54:11,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 20:54:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:11,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 20:54:11,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 20:54:11,758 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 20:54:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:11,938 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2023-12-24 20:54:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 20:54:11,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2023-12-24 20:54:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:11,941 INFO L225 Difference]: With dead ends: 41 [2023-12-24 20:54:11,941 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 20:54:11,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-24 20:54:11,942 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:11,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 20:54:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 20:54:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-12-24 20:54:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-24 20:54:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-24 20:54:11,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 31 [2023-12-24 20:54:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:11,951 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-24 20:54:11,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 20:54:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-24 20:54:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 20:54:11,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:11,953 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:11,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 20:54:12,158 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:54:12,159 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:12,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2138016675, now seen corresponding path program 1 times [2023-12-24 20:54:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414027119] [2023-12-24 20:54:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:54:12,165 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:54:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:12,166 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:54:12,167 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:54:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:54:12,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 20:54:12,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:12,511 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 51 treesize of output 19 [2023-12-24 20:54:12,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:12,638 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 66 treesize of output 32 [2023-12-24 20:54:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 20:54:12,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:54:12,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414027119] [2023-12-24 20:54:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414027119] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:54:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:54:12,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 20:54:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794951220] [2023-12-24 20:54:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:54:12,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 20:54:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 20:54:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-24 20:54:12,652 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 20:54:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:12,932 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-12-24 20:54:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 20:54:12,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-12-24 20:54:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:12,933 INFO L225 Difference]: With dead ends: 33 [2023-12-24 20:54:12,933 INFO L226 Difference]: Without dead ends: 29 [2023-12-24 20:54:12,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-24 20:54:12,934 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:12,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 20:54:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-24 20:54:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-24 20:54:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-24 20:54:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-24 20:54:12,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2023-12-24 20:54:12,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:12,939 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-24 20:54:12,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 20:54:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-24 20:54:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 20:54:12,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:12,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:12,948 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:54:13,140 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:54:13,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:13,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2139863717, now seen corresponding path program 1 times [2023-12-24 20:54:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127528037] [2023-12-24 20:54:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:54:13,142 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:54:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:13,145 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:54:13,146 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:54:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:54:13,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 20:54:13,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 20:54:13,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 20:54:13,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127528037] [2023-12-24 20:54:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127528037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 20:54:13,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 20:54:13,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 20:54:13,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362636316] [2023-12-24 20:54:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 20:54:13,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 20:54:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:13,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 20:54:13,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 20:54:13,333 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 20:54:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:13,506 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-12-24 20:54:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 20:54:13,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-12-24 20:54:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:13,507 INFO L225 Difference]: With dead ends: 35 [2023-12-24 20:54:13,507 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 20:54:13,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-24 20:54:13,508 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:13,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 66 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 20:54:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 20:54:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-24 20:54:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-24 20:54:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-12-24 20:54:13,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 31 [2023-12-24 20:54:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:13,512 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-12-24 20:54:13,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-24 20:54:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-12-24 20:54:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 20:54:13,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:13,513 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:13,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 20:54:13,719 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:54:13,719 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:13,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash -497212319, now seen corresponding path program 1 times [2023-12-24 20:54:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787250425] [2023-12-24 20:54:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:54:13,720 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:54:13,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:13,721 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:54:13,723 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:54:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:54:14,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-24 20:54:14,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:14,067 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:54:14,099 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 51 treesize of output 19 [2023-12-24 20:54:14,252 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:54:14,260 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:54:14,350 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 20:54:14,351 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 41 treesize of output 38 [2023-12-24 20:54:14,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2023-12-24 20:54:14,385 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 20:54:14,385 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 17 treesize of output 17 [2023-12-24 20:54:14,537 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 48 treesize of output 32 [2023-12-24 20:54:14,542 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 32 treesize of output 20 [2023-12-24 20:54:14,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:14,598 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 66 treesize of output 32 [2023-12-24 20:54:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 20:54:14,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:14,969 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_45 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 8)))) (or (not (= (select |c_#valid| v_~head~0.base_45) (_ bv0 1))) (not (= (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_45 v_ArrVal_605) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd c_~head~0.offset (_ bv3 32))) (select .cse0 (bvadd c_~head~0.offset (_ bv2 32)))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 32)))) (select .cse0 c_~head~0.offset))) (_ bv2 32))))) is different from false [2023-12-24 20:54:14,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787250425] [2023-12-24 20:54:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787250425] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:54:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [253621609] [2023-12-24 20:54:14,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:54:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:54:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:54:15,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:54:15,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 20:54:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:54:15,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 20:54:15,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:15,471 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:54:15,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-12-24 20:54:15,753 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:54:15,758 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:54:15,831 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 20:54:15,831 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 17 treesize of output 17 [2023-12-24 20:54:15,837 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 53 treesize of output 30 [2023-12-24 20:54:16,043 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 36 [2023-12-24 20:54:16,053 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:54:16,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:16,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 13 [2023-12-24 20:54:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 20:54:16,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:16,389 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array (_ BitVec 32) (_ BitVec 8))) (v_~head~0.base_51 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~head~0.base_51))) (not (= (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_51 v_ArrVal_757) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd c_~head~0.offset (_ bv3 32))) (select .cse0 (bvadd c_~head~0.offset (_ bv2 32)))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 32)))) (select .cse0 c_~head~0.offset))) (_ bv2 32))))) is different from false [2023-12-24 20:54:16,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [253621609] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:54:16,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:54:16,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-12-24 20:54:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015347381] [2023-12-24 20:54:16,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:54:16,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-24 20:54:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-24 20:54:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=541, Unknown=2, NotChecked=94, Total=702 [2023-12-24 20:54:16,393 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 20:54:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:18,466 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-12-24 20:54:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 20:54:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2023-12-24 20:54:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:18,468 INFO L225 Difference]: With dead ends: 39 [2023-12-24 20:54:18,468 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 20:54:18,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=982, Unknown=2, NotChecked=130, Total=1260 [2023-12-24 20:54:18,469 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:18,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 154 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 20:54:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 20:54:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-12-24 20:54:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-24 20:54:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-12-24 20:54:18,475 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 34 [2023-12-24 20:54:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-12-24 20:54:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 20:54:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-12-24 20:54:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 20:54:18,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:18,476 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:18,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-24 20:54:18,692 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:54:18,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:54:18,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:18,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -495365277, now seen corresponding path program 1 times [2023-12-24 20:54:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:18,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931922798] [2023-12-24 20:54:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 20:54:18,895 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:54:18,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:18,896 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:54:18,897 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:54:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 20:54:19,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 20:54:19,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:19,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:54:19,241 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 16 treesize of output 8 [2023-12-24 20:54:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 20:54:19,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 20:54:19,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:19,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931922798] [2023-12-24 20:54:19,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931922798] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 20:54:19,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:54:19,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2023-12-24 20:54:19,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692597845] [2023-12-24 20:54:19,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:54:19,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 20:54:19,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:19,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 20:54:19,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-12-24 20:54:19,476 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-24 20:54:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:20,366 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2023-12-24 20:54:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 20:54:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-12-24 20:54:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:20,367 INFO L225 Difference]: With dead ends: 42 [2023-12-24 20:54:20,368 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 20:54:20,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 20:54:20,369 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 84 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:20,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 92 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 20:54:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 20:54:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-12-24 20:54:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:54:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-12-24 20:54:20,373 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 34 [2023-12-24 20:54:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:20,374 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-12-24 20:54:20,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-24 20:54:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-12-24 20:54:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-24 20:54:20,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:20,376 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:20,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 20:54:20,581 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:54:20,582 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:20,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1103031011, now seen corresponding path program 2 times [2023-12-24 20:54:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:20,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623011823] [2023-12-24 20:54:20,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:54:20,592 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:54:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:20,601 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:54:20,636 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:54:21,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:54:21,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:54:21,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-24 20:54:21,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:21,044 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:54:21,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2023-12-24 20:54:21,225 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:54:21,233 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:54:21,328 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2023-12-24 20:54:21,329 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 23 treesize of output 35 [2023-12-24 20:54:21,344 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 31 treesize of output 20 [2023-12-24 20:54:21,518 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:54:21,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2023-12-24 20:54:21,553 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:54:21,738 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-24 20:54:21,738 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:54:21,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:54:21,756 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 70 treesize of output 47 [2023-12-24 20:54:21,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:54:21,769 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2023-12-24 20:54:21,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-12-24 20:54:21,776 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 39 treesize of output 24 [2023-12-24 20:54:22,208 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 20:54:22,209 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 69 treesize of output 36 [2023-12-24 20:54:22,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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:54:22,306 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-12-24 20:54:22,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 42 [2023-12-24 20:54:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:54:22,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:23,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:23,232 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 128 treesize of output 123 [2023-12-24 20:54:23,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:23,247 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 128 treesize of output 123 [2023-12-24 20:54:23,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:23,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 20:54:23,323 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 8))) (v_~head~0.base_75 (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_4 (_ bv4 32)) c_~head~0.base)) (not (= (_ bv2 32) (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_75 v_DerPreprocessor_7) (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_75 v_arrayElimArr_4) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_75 v_arrayElimArr_5) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd (_ bv1 32) .cse1))) (select .cse0 .cse1)))))) (not (= (_ bv3 8) (select v_DerPreprocessor_7 (_ bv0 32)))) (not (= (select |c_#valid| v_~head~0.base_75) (_ bv0 1))) (not (= (select v_DerPreprocessor_7 (_ bv2 32)) (_ bv0 8))) (not (= c_~head~0.offset (select v_arrayElimArr_5 (_ bv4 32)))))) is different from false [2023-12-24 20:54:23,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623011823] [2023-12-24 20:54:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623011823] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:54:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [807419603] [2023-12-24 20:54:23,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:54:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:54:23,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:54:23,337 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:54:23,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 20:54:23,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:54:23,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:54:23,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-24 20:54:23,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 20:54:23,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-12-24 20:54:24,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 43 [2023-12-24 20:54:24,226 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:54:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 20:54:24,441 INFO L349 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2023-12-24 20:54:24,441 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 23 treesize of output 35 [2023-12-24 20:54:24,469 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 53 treesize of output 30 [2023-12-24 20:54:24,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2023-12-24 20:54:24,697 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:54:24,710 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:54:25,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:54:25,006 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 84 treesize of output 55 [2023-12-24 20:54:25,041 INFO L349 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2023-12-24 20:54:25,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 70 [2023-12-24 20:54:25,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:54:25,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:54:25,073 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2023-12-24 20:54:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2023-12-24 20:54:25,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:54:25,108 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:54:25,842 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 20:54:25,843 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 116 treesize of output 63 [2023-12-24 20:54:25,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 20:54:25,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:54:26,054 INFO L349 Elim1Store]: treesize reduction 68, result has 16.0 percent of original size [2023-12-24 20:54:26,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 6 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 78 treesize of output 46 [2023-12-24 20:54:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:54:26,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:26,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:26,618 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 128 treesize of output 123 [2023-12-24 20:54:26,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:26,631 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 128 treesize of output 123 [2023-12-24 20:54:26,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:26,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-12-24 20:54:26,714 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 8))) (v_~head~0.base_81 (_ BitVec 32)) (v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_DerPreprocessor_12 (_ bv2 32)) (_ bv0 8))) (not (= (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (store |c_#memory_int#1| v_~head~0.base_81 v_DerPreprocessor_12) (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_81 v_arrayElimArr_10) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| v_~head~0.base_81 v_arrayElimArr_11) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd .cse1 (_ bv1 32)))) (select .cse0 .cse1)))) (_ bv2 32))) (not (= (select v_DerPreprocessor_12 (_ bv0 32)) (_ bv3 8))) (not (= (_ bv0 8) (select v_DerPreprocessor_12 (_ bv1 32)))) (not (= c_~head~0.offset (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select v_DerPreprocessor_12 (_ bv3 32)) (_ bv0 8))) (not (= c_~head~0.base (select v_arrayElimArr_10 (_ bv4 32)))) (not (= (select |c_#valid| v_~head~0.base_81) (_ bv0 1))))) is different from false [2023-12-24 20:54:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [807419603] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:54:26,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:54:26,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2023-12-24 20:54:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970410850] [2023-12-24 20:54:26,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:54:26,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-24 20:54:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-24 20:54:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1305, Unknown=2, NotChecked=146, Total=1560 [2023-12-24 20:54:26,719 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 34 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-24 20:54:34,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 20:54:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:39,022 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-12-24 20:54:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 20:54:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 37 [2023-12-24 20:54:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:39,023 INFO L225 Difference]: With dead ends: 44 [2023-12-24 20:54:39,023 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 20:54:39,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=257, Invalid=2401, Unknown=2, NotChecked=202, Total=2862 [2023-12-24 20:54:39,025 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:39,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 212 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-12-24 20:54:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 20:54:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2023-12-24 20:54:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:54:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-12-24 20:54:39,031 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 37 [2023-12-24 20:54:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:39,031 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-12-24 20:54:39,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 30 states have internal predecessors, (48), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-24 20:54:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-12-24 20:54:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-24 20:54:39,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:39,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:39,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 20:54:39,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-24 20:54:39,432 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 20:54:39,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:39,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1104878053, now seen corresponding path program 2 times [2023-12-24 20:54:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:39,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181284785] [2023-12-24 20:54:39,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:54:39,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:54:39,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:39,435 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:54:39,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 20:54:39,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:54:39,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:54:39,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-24 20:54:39,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:39,775 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:54:39,793 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:54:39,907 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:54:39,916 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:54:39,991 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 20:54:39,991 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 17 treesize of output 17 [2023-12-24 20:54:39,998 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 16 [2023-12-24 20:54:40,104 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 7 treesize of output 3 [2023-12-24 20:54:40,185 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 20:54:40,185 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 32 treesize of output 15 [2023-12-24 20:54:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:54:40,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:40,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:40,542 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 16 treesize of output 20 [2023-12-24 20:54:40,556 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_87 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 (_ bv4 32)) c_~head~0.base)) (not (= (select |c_#valid| v_~head~0.base_87) (_ bv0 1))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_87 v_arrayElimArr_13) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2023-12-24 20:54:40,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 20:54:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181284785] [2023-12-24 20:54:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181284785] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:54:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1492123308] [2023-12-24 20:54:40,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 20:54:40,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 20:54:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 20:54:40,559 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 20:54:40,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-24 20:54:40,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 20:54:40,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 20:54:40,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 20:54:40,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 20:54:41,001 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:54:41,011 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:54:41,063 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:54:41,070 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:54:41,105 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-12-24 20:54:41,105 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 17 treesize of output 17 [2023-12-24 20:54:41,111 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 16 [2023-12-24 20:54:41,147 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 7 treesize of output 3 [2023-12-24 20:54:41,198 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 20:54:41,199 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 32 treesize of output 15 [2023-12-24 20:54:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 20:54:41,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 20:54:41,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 20:54:41,374 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 16 treesize of output 20 [2023-12-24 20:54:41,435 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_93 (_ BitVec 32))) (or (not (= c_~head~0.base (select v_arrayElimArr_15 (_ bv4 32)))) (not (= (select |c_#valid| v_~head~0.base_93) (_ bv0 1))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_93 v_arrayElimArr_15) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2023-12-24 20:54:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1492123308] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 20:54:41,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 20:54:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2023-12-24 20:54:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211802669] [2023-12-24 20:54:41,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 20:54:41,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 20:54:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 20:54:41,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 20:54:41,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=377, Unknown=2, NotChecked=78, Total=506 [2023-12-24 20:54:41,438 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-24 20:54:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 20:54:43,996 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-12-24 20:54:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 20:54:43,996 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2023-12-24 20:54:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 20:54:43,997 INFO L225 Difference]: With dead ends: 45 [2023-12-24 20:54:43,997 INFO L226 Difference]: Without dead ends: 38 [2023-12-24 20:54:43,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=238, Invalid=1328, Unknown=2, NotChecked=154, Total=1722 [2023-12-24 20:54:43,998 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 20:54:43,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 119 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 20:54:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-24 20:54:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-12-24 20:54:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 20:54:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-12-24 20:54:44,004 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 37 [2023-12-24 20:54:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 20:54:44,005 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-12-24 20:54:44,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-24 20:54:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-12-24 20:54:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-24 20:54:44,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 20:54:44,005 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 20:54:44,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 20:54:44,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-12-24 20:54:44,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 20:54:44,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 20:54:44,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 20:54:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -184910559, now seen corresponding path program 3 times [2023-12-24 20:54:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 20:54:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064126438] [2023-12-24 20:54:44,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 20:54:44,428 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:54:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 20:54:44,429 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 20:54:44,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 20:54:45,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 20:54:45,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-24 20:54:45,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-24 20:54:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-24 20:54:45,730 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-24 20:54:45,730 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-24 20:54:45,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 20:54:45,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 20:54:45,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 20:54:45,935 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-12-24 20:54:45,938 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 20:54:45,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 08:54:45 BoogieIcfgContainer [2023-12-24 20:54:45,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 20:54:45,968 INFO L158 Benchmark]: Toolchain (without parser) took 36108.69ms. Allocated memory was 295.7MB in the beginning and 426.8MB in the end (delta: 131.1MB). Free memory was 240.4MB in the beginning and 274.1MB in the end (delta: -33.7MB). Peak memory consumption was 100.0MB. Max. memory is 8.0GB. [2023-12-24 20:54:45,968 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 217.1MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 20:54:45,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.66ms. Allocated memory is still 295.7MB. Free memory was 239.9MB in the beginning and 217.3MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-24 20:54:45,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.52ms. Allocated memory is still 295.7MB. Free memory was 217.3MB in the beginning and 215.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 20:54:45,968 INFO L158 Benchmark]: Boogie Preprocessor took 64.91ms. Allocated memory is still 295.7MB. Free memory was 215.7MB in the beginning and 212.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 20:54:45,968 INFO L158 Benchmark]: RCFGBuilder took 388.05ms. Allocated memory is still 295.7MB. Free memory was 212.6MB in the beginning and 195.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 20:54:45,969 INFO L158 Benchmark]: TraceAbstraction took 35130.56ms. Allocated memory was 295.7MB in the beginning and 426.8MB in the end (delta: 131.1MB). Free memory was 195.3MB in the beginning and 274.1MB in the end (delta: -78.8MB). Peak memory consumption was 54.9MB. Max. memory is 8.0GB. [2023-12-24 20:54:45,969 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.13ms. Allocated memory is still 217.1MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.66ms. Allocated memory is still 295.7MB. Free memory was 239.9MB in the beginning and 217.3MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.52ms. Allocated memory is still 295.7MB. Free memory was 217.3MB in the beginning and 215.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.91ms. Allocated memory is still 295.7MB. Free memory was 215.7MB in the beginning and 212.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 388.05ms. Allocated memory is still 295.7MB. Free memory was 212.6MB in the beginning and 195.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 35130.56ms. Allocated memory was 295.7MB in the beginning and 426.8MB in the end (delta: 131.1MB). Free memory was 195.3MB in the beginning and 274.1MB in the end (delta: -78.8MB). Peak memory consumption was 54.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, k=2, l={-2147483646:0}, l={6:7}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(head)={0:0}, \old(k)=2, head={0:0}, k=2, l={-2147483646:0}, l={6:7}] [L550] head = l [L551] return 0; [L556] RET insert_list(mylist,2) VAL [head={-2147483646:0}, mylist={6:7}] [L557] CALL insert_list(mylist,5) VAL [\old(head)={-2147483646:0}, \old(k)=5, head={-2147483646:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={-2147483646:0}, \old(k)=5, head={-2147483646:0}, k=5, l={3:0}, l={6:7}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={-2147483646:0}, \old(k)=5, head={-2147483646:0}, k=5, l={3:0}, l={6:7}] [L550] head = l [L551] return 0; [L557] RET insert_list(mylist,5) VAL [head={3:0}, mylist={6:7}] [L558] CALL insert_list(mylist,1) VAL [\old(head)={3:0}, \old(k)=1, head={3:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={3:0}, \old(k)=1, head={3:0}, k=1, l={1073741825:0}, l={6:7}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={3:0}, \old(k)=1, head={3:0}, k=1, l={1073741825:0}, l={6:7}] [L550] head = l [L551] return 0; [L558] RET insert_list(mylist,1) VAL [head={1073741825:0}, mylist={6:7}] [L559] CALL insert_list(mylist,3) VAL [\old(head)={1073741825:0}, \old(k)=3, head={1073741825:0}, l={6:7}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)={1073741825:0}, \old(k)=3, head={1073741825:0}, k=3, l={-2147483647:0}, l={6:7}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)={1073741825:0}, \old(k)=3, head={1073741825:0}, k=3, l={-2147483647:0}, l={6:7}] [L550] head = l [L551] return 0; [L559] RET insert_list(mylist,3) VAL [head={-2147483647:0}, mylist={6:7}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={-2147483647:0}] [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={-2147483647:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={-2147483647:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={1073741825:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={1073741825:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={3:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483647:0}, l={3:0}] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483646:0}, l={-2147483647:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={-2147483647:0}, k=2, l={-2147483646:0}, l={-2147483647:0}] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, head={-2147483647:0}] [L15] reach_error() VAL [\old(cond)=0, cond=0, head={-2147483647:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 14.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 796 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 673 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1671 IncrementalHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 123 mSDtfsCounter, 1671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=7, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 424 ConstructedInterpolants, 16 QuantifiedInterpolants, 5774 SizeOfPredicates, 130 NumberOfNonLiveVariables, 3462 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 247/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-24 20:54:45,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...