/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/forester-heap/dll-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:15:34,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:15:34,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 03:15:34,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:15:34,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:15:34,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:15:34,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:15:34,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:15:34,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:15:34,593 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:15:34,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:15:34,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:15:34,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:15:34,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:15:34,596 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:15:34,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:15:34,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:15:34,596 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:15:34,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:15:34,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:15:34,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:15:34,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:15:34,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:15:34,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:15:34,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:15:34,598 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:15:34,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:15:34,598 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:15:34,599 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:15:34,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:15:34,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:15:34,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:15:34,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:15:34,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:15:34,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:15:34,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:15:34,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:15:34,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:15:34,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:15:34,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:15:34,601 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:15:34,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:15:34,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:15:34,602 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 03:15:34,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:15:34,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:15:34,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:15:34,861 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:15:34,861 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:15:34,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted-2.i [2023-12-21 03:15:36,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:15:36,229 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:15:36,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i [2023-12-21 03:15:36,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5814587f5/0764b0de719d475ca3f794a2e3f23750/FLAG820e5b794 [2023-12-21 03:15:36,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5814587f5/0764b0de719d475ca3f794a2e3f23750 [2023-12-21 03:15:36,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:15:36,256 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:15:36,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:15:36,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:15:36,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:15:36,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2155cd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36, skipping insertion in model container [2023-12-21 03:15:36,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:15:36,558 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[22384,22397] [2023-12-21 03:15:36,567 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[22614,22627] [2023-12-21 03:15:36,573 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[22989,23002] [2023-12-21 03:15:36,575 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[23053,23066] [2023-12-21 03:15:36,579 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[23184,23197] [2023-12-21 03:15:36,579 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[23248,23261] [2023-12-21 03:15:36,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:15:36,592 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:15:36,633 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[22384,22397] [2023-12-21 03:15:36,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[22614,22627] [2023-12-21 03:15:36,638 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[22989,23002] [2023-12-21 03:15:36,638 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[23053,23066] [2023-12-21 03:15:36,639 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[23184,23197] [2023-12-21 03:15:36,640 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-2.i[23248,23261] [2023-12-21 03:15:36,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:15:36,669 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:15:36,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36 WrapperNode [2023-12-21 03:15:36,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:15:36,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:15:36,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:15:36,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:15:36,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,731 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 196 [2023-12-21 03:15:36,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:15:36,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:15:36,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:15:36,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:15:36,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,792 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2023-12-21 03:15:36,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:15:36,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:15:36,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:15:36,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:15:36,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (1/1) ... [2023-12-21 03:15:36,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:15:36,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:15:36,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 03:15:36,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 03:15:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:15:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:15:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:15:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:15:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:15:36,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:15:36,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:15:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:15:36,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:15:36,978 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:15:36,979 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:15:37,226 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:15:37,274 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:15:37,274 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-12-21 03:15:37,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:15:37 BoogieIcfgContainer [2023-12-21 03:15:37,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:15:37,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:15:37,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:15:37,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:15:37,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:15:36" (1/3) ... [2023-12-21 03:15:37,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b5002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:15:37, skipping insertion in model container [2023-12-21 03:15:37,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:15:36" (2/3) ... [2023-12-21 03:15:37,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b5002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:15:37, skipping insertion in model container [2023-12-21 03:15:37,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:15:37" (3/3) ... [2023-12-21 03:15:37,281 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2023-12-21 03:15:37,300 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:15:37,300 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-12-21 03:15:37,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:15:37,352 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;@1f043261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:15:37,352 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-21 03:15:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 52 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-21 03:15:37,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:15:37,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-21 03:15:37,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-21 03:15:37,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:15:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 246459149, now seen corresponding path program 1 times [2023-12-21 03:15:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:15:37,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186790534] [2023-12-21 03:15:37,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:15:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:15:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:15:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:15:37,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:15:37,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186790534] [2023-12-21 03:15:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186790534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:15:37,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:15:37,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:15:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905727626] [2023-12-21 03:15:37,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:15:37,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 03:15:37,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:15:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 03:15:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:15:37,602 INFO L87 Difference]: Start difference. First operand has 53 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 52 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:15:37,633 INFO L93 Difference]: Finished difference Result 101 states and 167 transitions. [2023-12-21 03:15:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 03:15:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-21 03:15:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:15:37,641 INFO L225 Difference]: With dead ends: 101 [2023-12-21 03:15:37,641 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 03:15:37,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:15:37,646 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:15:37,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:15:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 03:15:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-21 03:15:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.372093023255814) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2023-12-21 03:15:37,673 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 5 [2023-12-21 03:15:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:15:37,673 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2023-12-21 03:15:37,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2023-12-21 03:15:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-21 03:15:37,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:15:37,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-21 03:15:37,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:15:37,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-21 03:15:37,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:15:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash -967789872, now seen corresponding path program 1 times [2023-12-21 03:15:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:15:37,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265013365] [2023-12-21 03:15:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:15:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:15:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:15:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:15:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:15:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265013365] [2023-12-21 03:15:37,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265013365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:15:37,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:15:37,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:15:37,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790812288] [2023-12-21 03:15:37,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:15:37,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:15:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:15:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:15:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:15:37,733 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:15:37,789 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2023-12-21 03:15:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:15:37,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-21 03:15:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:15:37,792 INFO L225 Difference]: With dead ends: 102 [2023-12-21 03:15:37,792 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 03:15:37,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:15:37,794 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:15:37,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:15:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 03:15:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-12-21 03:15:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 52 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-21 03:15:37,811 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 6 [2023-12-21 03:15:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:15:37,811 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-21 03:15:37,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-21 03:15:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 03:15:37,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:15:37,812 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:15:37,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:15:37,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-21 03:15:37,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:15:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -25720539, now seen corresponding path program 1 times [2023-12-21 03:15:37,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:15:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900223169] [2023-12-21 03:15:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:15:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:15:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:15:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:15:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:15:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900223169] [2023-12-21 03:15:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900223169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:15:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:15:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:15:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924682335] [2023-12-21 03:15:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:15:37,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:15:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:15:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:15:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:15:37,965 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:15:38,087 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2023-12-21 03:15:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:15:38,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 03:15:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:15:38,089 INFO L225 Difference]: With dead ends: 86 [2023-12-21 03:15:38,089 INFO L226 Difference]: Without dead ends: 84 [2023-12-21 03:15:38,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:15:38,092 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 135 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:15:38,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 61 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:15:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-21 03:15:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 51. [2023-12-21 03:15:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-12-21 03:15:38,109 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 10 [2023-12-21 03:15:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:15:38,109 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-12-21 03:15:38,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-12-21 03:15:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 03:15:38,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:15:38,110 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:15:38,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:15:38,111 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-21 03:15:38,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:15:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash 246593115, now seen corresponding path program 1 times [2023-12-21 03:15:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:15:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272217407] [2023-12-21 03:15:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:15:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:15:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:15:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:15:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:15:38,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272217407] [2023-12-21 03:15:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272217407] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:15:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052442238] [2023-12-21 03:15:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:15:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:15:38,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:15:38,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:15:38,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 03:15:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:15:39,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 03:15:39,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:15:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:15:39,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:39,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:39,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2023-12-21 03:15:39,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:39,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:39,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2023-12-21 03:15:39,167 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-21 03:15:39,168 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 25 treesize of output 18 [2023-12-21 03:15:39,177 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:15:39,178 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 15 treesize of output 15 [2023-12-21 03:15:39,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:39,188 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 16 treesize of output 11 [2023-12-21 03:15:39,241 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-21 03:15:39,242 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-12-21 03:15:39,247 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 24 treesize of output 11 [2023-12-21 03:15:39,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 03:15:39,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-21 03:15:39,459 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-21 03:15:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:15:39,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:15:39,555 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 69 treesize of output 49 [2023-12-21 03:15:39,564 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_169 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_168 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_168) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2023-12-21 03:15:39,625 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-21 03:15:39,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 212 [2023-12-21 03:15:39,679 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2023-12-21 03:15:39,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 182 [2023-12-21 03:15:39,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:15:39,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 248 [2023-12-21 03:15:39,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 169 [2023-12-21 03:15:39,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:15:39,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 242 [2023-12-21 03:15:39,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 182 [2023-12-21 03:15:40,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:15:40,618 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 29 treesize of output 29 [2023-12-21 03:15:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:15:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052442238] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:15:40,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:15:40,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-12-21 03:15:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234156702] [2023-12-21 03:15:40,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:15:40,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 03:15:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:15:40,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 03:15:40,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2023-12-21 03:15:40,680 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:15:41,232 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2023-12-21 03:15:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 03:15:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-21 03:15:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:15:41,234 INFO L225 Difference]: With dead ends: 108 [2023-12-21 03:15:41,235 INFO L226 Difference]: Without dead ends: 106 [2023-12-21 03:15:41,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=336, Unknown=1, NotChecked=38, Total=462 [2023-12-21 03:15:41,236 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 131 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 03:15:41,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 439 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 351 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2023-12-21 03:15:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-21 03:15:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 69. [2023-12-21 03:15:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.359375) internal successors, (87), 68 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2023-12-21 03:15:41,245 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 20 [2023-12-21 03:15:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:15:41,245 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2023-12-21 03:15:41,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 03:15:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2023-12-21 03:15:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 03:15:41,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:15:41,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:15:41,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 03:15:41,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:15:41,452 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-21 03:15:41,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:15:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1618331757, now seen corresponding path program 1 times [2023-12-21 03:15:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:15:41,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716868024] [2023-12-21 03:15:41,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:15:41,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:15:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:15:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:15:41,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:15:41,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716868024] [2023-12-21 03:15:41,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716868024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:15:41,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100589048] [2023-12-21 03:15:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:15:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:15:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:15:41,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:15:41,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 03:15:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:15:42,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-21 03:15:42,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:15:42,049 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 5 [2023-12-21 03:15:42,084 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-21 03:15:42,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2023-12-21 03:15:42,100 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:15:42,100 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 2 case distinctions, treesize of input 43 treesize of output 26 [2023-12-21 03:15:42,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 03:15:42,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 03:15:42,136 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-12-21 03:15:42,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2023-12-21 03:15:42,151 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 03:15:42,152 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 2 case distinctions, treesize of input 43 treesize of output 26 [2023-12-21 03:15:42,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 03:15:42,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-21 03:15:42,174 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:15:42,174 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 11 treesize of output 11 [2023-12-21 03:15:42,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-21 03:15:42,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:42,189 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 24 treesize of output 24 [2023-12-21 03:15:42,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:15:42,243 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:15:42,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2023-12-21 03:15:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 25 [2023-12-21 03:15:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:15:42,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:15:42,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_266 (Array Int Int))) (or (forall ((v_ArrVal_265 (Array Int Int))) (or (not (= v_ArrVal_265 (store .cse0 .cse1 (select v_ArrVal_265 .cse1)))) (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_266))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) (not (= v_ArrVal_266 (store .cse3 .cse1 (select v_ArrVal_266 .cse1)))))) (forall ((v_ArrVal_266 (Array Int Int))) (or (forall ((v_ArrVal_265 (Array Int Int))) (or (not (= v_ArrVal_265 (store .cse0 .cse1 (select v_ArrVal_265 .cse1)))) (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_265))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) (not (= v_ArrVal_266 (store .cse3 .cse1 (select v_ArrVal_266 .cse1)))))))) is different from false [2023-12-21 03:15:42,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:15:42,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 589 treesize of output 462 [2023-12-21 03:15:42,602 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2023-12-21 03:15:42,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 350 [2023-12-21 03:15:42,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:15:42,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 172269 treesize of output 168225 [2023-12-21 03:15:47,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:15:47,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 25669 treesize of output 25259 [2023-12-21 03:15:48,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:15:48,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 17609 treesize of output 16005 [2023-12-21 03:15:49,858 INFO L349 Elim1Store]: treesize reduction 832, result has 28.5 percent of original size [2023-12-21 03:15:49,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 12 new quantified variables, introduced 38 case distinctions, treesize of input 15725 treesize of output 15989 [2023-12-21 03:15:55,031 INFO L224 Elim1Store]: Index analysis took 204 ms [2023-12-21 03:15:55,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:55,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:55,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:15:55,581 INFO L349 Elim1Store]: treesize reduction 604, result has 6.1 percent of original size [2023-12-21 03:15:55,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 19 case distinctions, treesize of input 119 treesize of output 165 [2023-12-21 03:16:03,554 INFO L224 Elim1Store]: Index analysis took 145 ms [2023-12-21 03:16:03,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:16:03,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:16:03,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:16:03,977 INFO L349 Elim1Store]: treesize reduction 604, result has 6.1 percent of original size [2023-12-21 03:16:03,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 19 case distinctions, treesize of input 119 treesize of output 165 [2023-12-21 03:16:04,766 INFO L224 Elim1Store]: Index analysis took 207 ms [2023-12-21 03:16:04,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:16:04,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:16:04,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:16:05,293 INFO L349 Elim1Store]: treesize reduction 604, result has 6.1 percent of original size [2023-12-21 03:16:05,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 19 case distinctions, treesize of input 119 treesize of output 165 [2023-12-21 03:17:29,097 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 2363 DAG size of output: 6265 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 03:21:22,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-21 03:21:22,690 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-21 03:21:22,691 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 03:21:22,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:21:22,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:21:22,892 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 75 more [2023-12-21 03:21:22,897 INFO L158 Benchmark]: Toolchain (without parser) took 346640.38ms. Allocated memory was 355.5MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 292.0MB in the beginning and 1.2GB in the end (delta: -954.7MB). Peak memory consumption was 934.9MB. Max. memory is 8.0GB. [2023-12-21 03:21:22,897 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:21:22,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.85ms. Allocated memory is still 355.5MB. Free memory was 291.6MB in the beginning and 272.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-21 03:21:22,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.74ms. Allocated memory is still 355.5MB. Free memory was 272.4MB in the beginning and 270.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:21:22,898 INFO L158 Benchmark]: Boogie Preprocessor took 77.67ms. Allocated memory is still 355.5MB. Free memory was 270.0MB in the beginning and 266.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 03:21:22,898 INFO L158 Benchmark]: RCFGBuilder took 463.92ms. Allocated memory is still 355.5MB. Free memory was 266.8MB in the beginning and 317.0MB in the end (delta: -50.2MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. [2023-12-21 03:21:22,899 INFO L158 Benchmark]: TraceAbstraction took 345619.62ms. Allocated memory was 355.5MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 316.5MB in the beginning and 1.2GB in the end (delta: -930.1MB). Peak memory consumption was 958.4MB. Max. memory is 8.0GB. [2023-12-21 03:21:22,905 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.10ms. Allocated memory is still 213.9MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 412.85ms. Allocated memory is still 355.5MB. Free memory was 291.6MB in the beginning and 272.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.74ms. Allocated memory is still 355.5MB. Free memory was 272.4MB in the beginning and 270.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.67ms. Allocated memory is still 355.5MB. Free memory was 270.0MB in the beginning and 266.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 463.92ms. Allocated memory is still 355.5MB. Free memory was 266.8MB in the beginning and 317.0MB in the end (delta: -50.2MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. * TraceAbstraction took 345619.62ms. Allocated memory was 355.5MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 316.5MB in the beginning and 1.2GB in the end (delta: -930.1MB). Peak memory consumption was 958.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...