/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:50:55,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:50:55,226 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-15 21:50:55,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:50:55,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:50:55,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:50:55,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:50:55,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:50:55,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:50:55,262 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:50:55,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:50:55,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:50:55,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:50:55,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:50:55,273 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:50:55,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:50:55,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:50:55,274 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:50:55,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:50:55,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:50:55,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:50:55,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:50:55,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:50:55,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:50:55,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:50:55,278 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:50:55,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:50:55,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:50:55,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:50:55,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:50:55,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:50:55,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:50:55,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:55,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:50:55,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:50:55,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:50:55,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:50:55,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:50:55,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:50:55,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:50:55,280 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:50:55,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:50:55,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:50:55,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:50:55,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:50:55,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:50:55,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:50:55,466 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:50:55,466 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:50:55,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2023-12-15 21:50:56,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:50:56,637 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:50:56,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2023-12-15 21:50:56,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4929698/5689c5de688f4b86bd483db97d7e92f9/FLAG4a8793efd [2023-12-15 21:50:56,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4929698/5689c5de688f4b86bd483db97d7e92f9 [2023-12-15 21:50:56,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:50:56,666 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:50:56,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:56,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:50:56,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:50:56,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:56,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39502dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56, skipping insertion in model container [2023-12-15 21:50:56,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:56,724 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:50:56,930 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/sll-buckets-1.i[22663,22676] [2023-12-15 21:50:56,934 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/sll-buckets-1.i[22734,22747] [2023-12-15 21:50:56,935 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/sll-buckets-1.i[22862,22875] [2023-12-15 21:50:56,937 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/sll-buckets-1.i[23275,23288] [2023-12-15 21:50:56,938 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/sll-buckets-1.i[23364,23377] [2023-12-15 21:50:56,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:56,946 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:50:56,969 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/sll-buckets-1.i[22663,22676] [2023-12-15 21:50:56,969 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/sll-buckets-1.i[22734,22747] [2023-12-15 21:50:56,970 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/sll-buckets-1.i[22862,22875] [2023-12-15 21:50:56,972 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/sll-buckets-1.i[23275,23288] [2023-12-15 21:50:56,973 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/sll-buckets-1.i[23364,23377] [2023-12-15 21:50:56,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:56,992 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:50:56,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56 WrapperNode [2023-12-15 21:50:56,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:56,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:56,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:50:56,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:50:56,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,025 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2023-12-15 21:50:57,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:57,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:50:57,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:50:57,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:50:57,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,046 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2023-12-15 21:50:57,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:50:57,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:50:57,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:50:57,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:50:57,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (1/1) ... [2023-12-15 21:50:57,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:57,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:57,109 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-15 21:50:57,127 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-15 21:50:57,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:50:57,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:50:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:50:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:50:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:50:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:50:57,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:50:57,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:50:57,247 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:50:57,248 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:50:57,407 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:50:57,428 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:50:57,428 INFO L309 CfgBuilder]: Removed 15 assume(true) statements. [2023-12-15 21:50:57,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:57 BoogieIcfgContainer [2023-12-15 21:50:57,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:50:57,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:50:57,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:50:57,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:50:57,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:50:56" (1/3) ... [2023-12-15 21:50:57,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236bbf34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:57, skipping insertion in model container [2023-12-15 21:50:57,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:56" (2/3) ... [2023-12-15 21:50:57,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236bbf34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:57, skipping insertion in model container [2023-12-15 21:50:57,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:57" (3/3) ... [2023-12-15 21:50:57,434 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2023-12-15 21:50:57,456 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:50:57,456 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-12-15 21:50:57,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:50:57,490 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;@a56ac64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:50:57,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-15 21:50:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 40 states have internal predecessors, (68), 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-15 21:50:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 21:50:57,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:57,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:57,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 21:50:57,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash 271680228, now seen corresponding path program 1 times [2023-12-15 21:50:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789206043] [2023-12-15 21:50:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:57,849 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-15 21:50:57,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:57,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789206043] [2023-12-15 21:50:57,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789206043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:57,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:57,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408276352] [2023-12-15 21:50:57,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:57,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:57,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:57,900 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 40 states have internal predecessors, (68), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-15 21:50:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:57,992 INFO L93 Difference]: Finished difference Result 107 states and 183 transitions. [2023-12-15 21:50:57,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:50:57,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-12-15 21:50:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:58,000 INFO L225 Difference]: With dead ends: 107 [2023-12-15 21:50:58,000 INFO L226 Difference]: Without dead ends: 65 [2023-12-15 21:50:58,004 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-15 21:50:58,006 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 94 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:58,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 71 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-15 21:50:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2023-12-15 21:50:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 39 states have internal predecessors, (48), 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-15 21:50:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-12-15 21:50:58,035 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 7 [2023-12-15 21:50:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:58,035 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-12-15 21:50:58,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-15 21:50:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2023-12-15 21:50:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-15 21:50:58,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:58,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:58,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:50:58,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 21:50:58,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:58,039 INFO L85 PathProgramCache]: Analyzing trace with hash -131581983, now seen corresponding path program 1 times [2023-12-15 21:50:58,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:58,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613826913] [2023-12-15 21:50:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:58,129 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-15 21:50:58,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:58,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613826913] [2023-12-15 21:50:58,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613826913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:58,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:58,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710954214] [2023-12-15 21:50:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:58,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:58,132 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-15 21:50:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:58,183 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2023-12-15 21:50:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-12-15 21:50:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:58,184 INFO L225 Difference]: With dead ends: 44 [2023-12-15 21:50:58,184 INFO L226 Difference]: Without dead ends: 42 [2023-12-15 21:50:58,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-15 21:50:58,186 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:58,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-15 21:50:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-12-15 21:50:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 37 states have internal predecessors, (46), 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-15 21:50:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-12-15 21:50:58,190 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 8 [2023-12-15 21:50:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:58,190 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-12-15 21:50:58,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-15 21:50:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2023-12-15 21:50:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:50:58,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:58,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:58,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:50:58,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 21:50:58,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 215961798, now seen corresponding path program 1 times [2023-12-15 21:50:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839209357] [2023-12-15 21:50:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:58,609 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-15 21:50:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839209357] [2023-12-15 21:50:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839209357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:58,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:58,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:58,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107275429] [2023-12-15 21:50:58,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:58,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:50:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:50:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:58,620 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:58,780 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2023-12-15 21:50:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:50:58,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 21:50:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:58,783 INFO L225 Difference]: With dead ends: 60 [2023-12-15 21:50:58,783 INFO L226 Difference]: Without dead ends: 49 [2023-12-15 21:50:58,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:50:58,786 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:58,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 89 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-15 21:50:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-12-15 21:50:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.3) internal successors, (52), 42 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-15 21:50:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-12-15 21:50:58,800 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 9 [2023-12-15 21:50:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:58,800 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-12-15 21:50:58,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-12-15 21:50:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:50:58,801 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:58,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:58,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:50:58,801 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 21:50:58,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash -908178552, now seen corresponding path program 1 times [2023-12-15 21:50:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707623378] [2023-12-15 21:50:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:58,853 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-15 21:50:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707623378] [2023-12-15 21:50:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707623378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:58,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517988894] [2023-12-15 21:50:58,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:58,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:58,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:58,856 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-15 21:50:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:58,914 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2023-12-15 21:50:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:58,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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 9 [2023-12-15 21:50:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:58,915 INFO L225 Difference]: With dead ends: 44 [2023-12-15 21:50:58,915 INFO L226 Difference]: Without dead ends: 42 [2023-12-15 21:50:58,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-15 21:50:58,915 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:58,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-15 21:50:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-12-15 21:50:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 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-15 21:50:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2023-12-15 21:50:58,922 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2023-12-15 21:50:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:58,923 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2023-12-15 21:50:58,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-15 21:50:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2023-12-15 21:50:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-15 21:50:58,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:58,925 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:58,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:50:58,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 21:50:58,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1837347927, now seen corresponding path program 1 times [2023-12-15 21:50:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006292727] [2023-12-15 21:50:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:59,492 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-15 21:50:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006292727] [2023-12-15 21:50:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006292727] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914158532] [2023-12-15 21:50:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:59,496 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-15 21:50:59,501 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-15 21:50:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:59,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-15 21:50:59,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:59,674 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 32 treesize of output 36 [2023-12-15 21:50:59,682 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 32 treesize of output 36 [2023-12-15 21:50:59,715 INFO L349 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2023-12-15 21:50:59,715 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 2 case distinctions, treesize of input 70 treesize of output 79 [2023-12-15 21:50:59,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:59,740 INFO L349 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2023-12-15 21:50:59,741 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 2 case distinctions, treesize of input 31 treesize of output 45 [2023-12-15 21:50:59,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2023-12-15 21:50:59,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-12-15 21:50:59,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 19 [2023-12-15 21:50:59,787 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 14 treesize of output 10 [2023-12-15 21:50:59,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 19 [2023-12-15 21:50:59,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2023-12-15 21:50:59,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2023-12-15 21:51:00,560 INFO L349 Elim1Store]: treesize reduction 192, result has 28.6 percent of original size [2023-12-15 21:51:00,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 48 case distinctions, treesize of input 242 treesize of output 235 [2023-12-15 21:51:00,678 INFO L349 Elim1Store]: treesize reduction 280, result has 32.2 percent of original size [2023-12-15 21:51:00,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 198 treesize of output 294 Received shutdown request... [2023-12-15 21:52:08,145 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:52:08,145 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:52:08,320 WARN L235 SmtUtils]: Removed 3 from assertion stack [2023-12-15 21:52:08,322 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-12-15 21:52:08,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:52:08,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:08,532 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 15 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18936 for 62378ms.. [2023-12-15 21:52:08,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-15 21:52:08,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-15 21:52:08,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-15 21:52:08,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-15 21:52:08,536 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-15 21:52:08,541 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:52:08,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:52:08 BoogieIcfgContainer [2023-12-15 21:52:08,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:52:08,546 INFO L158 Benchmark]: Toolchain (without parser) took 71880.25ms. Allocated memory was 207.6MB in the beginning and 865.1MB in the end (delta: 657.5MB). Free memory was 157.1MB in the beginning and 695.1MB in the end (delta: -538.0MB). Peak memory consumption was 527.1MB. Max. memory is 8.0GB. [2023-12-15 21:52:08,546 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 207.6MB. Free memory was 155.8MB in the beginning and 155.6MB in the end (delta: 164.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:52:08,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.17ms. Allocated memory is still 207.6MB. Free memory was 156.8MB in the beginning and 137.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 21:52:08,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.19ms. Allocated memory is still 207.6MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:52:08,550 INFO L158 Benchmark]: Boogie Preprocessor took 49.93ms. Allocated memory is still 207.6MB. Free memory was 135.4MB in the beginning and 132.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:52:08,551 INFO L158 Benchmark]: RCFGBuilder took 352.32ms. Allocated memory is still 207.6MB. Free memory was 132.6MB in the beginning and 112.3MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 21:52:08,552 INFO L158 Benchmark]: TraceAbstraction took 71115.45ms. Allocated memory was 207.6MB in the beginning and 865.1MB in the end (delta: 657.5MB). Free memory was 111.7MB in the beginning and 695.1MB in the end (delta: -583.4MB). Peak memory consumption was 481.0MB. Max. memory is 8.0GB. [2023-12-15 21:52:08,555 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.50ms. Allocated memory is still 207.6MB. Free memory was 155.8MB in the beginning and 155.6MB in the end (delta: 164.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 325.17ms. Allocated memory is still 207.6MB. Free memory was 156.8MB in the beginning and 137.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.19ms. Allocated memory is still 207.6MB. Free memory was 137.8MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.93ms. Allocated memory is still 207.6MB. Free memory was 135.4MB in the beginning and 132.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.32ms. Allocated memory is still 207.6MB. Free memory was 132.6MB in the beginning and 112.3MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 71115.45ms. Allocated memory was 207.6MB in the beginning and 865.1MB in the end (delta: 657.5MB). Free memory was 111.7MB in the beginning and 695.1MB in the end (delta: -583.4MB). Peak memory consumption was 481.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1061). Cancelled while NwaCegarLoop was analyzing trace of length 15 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18936 for 62378ms.. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1034). Cancelled while NwaCegarLoop was analyzing trace of length 15 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18936 for 62378ms.. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1035). Cancelled while NwaCegarLoop was analyzing trace of length 15 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18936 for 62378ms.. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1038). Cancelled while NwaCegarLoop was analyzing trace of length 15 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18936 for 62378ms.. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1064). Cancelled while NwaCegarLoop was analyzing trace of length 15 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 18936 for 62378ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 71.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 139 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown