/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:59:17,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:59:17,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:59:17,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:59:17,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:59:17,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:59:17,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:59:17,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:59:17,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:59:17,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:59:17,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:59:17,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:59:17,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:59:17,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:59:17,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:59:17,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:59:17,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:59:17,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:59:17,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:59:17,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:59:17,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:59:17,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:59:17,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:59:17,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:59:17,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:59:17,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:59:17,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:59:17,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:59:17,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:59:17,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:59:17,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:59:17,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:59:17,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:59:17,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:59:17,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:59:17,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:59:17,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:59:17,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:59:17,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:59:17,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:59:17,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:59:17,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:59:17,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:59:17,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:59:17,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:59:17,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:59:17,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:59:17,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:59:17,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:59:17,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:59:17,811 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:59:17,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:59:17,813 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:59:17,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:59:17,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:59:17,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:59:17,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:59:17,814 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:59:17,814 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:59:17,814 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:59:17,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:59:17,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:59:17,815 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:59:17,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:59:17,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:59:17,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:59:17,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:59:17,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:17,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:59:17,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:59:17,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:59:17,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:59:17,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-15 17:59:18,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:59:18,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:59:18,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:59:18,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:59:18,274 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:59:18,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca-1.i [2022-10-15 17:59:18,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c15c4f/ccc0da663b3f4f3eacdd9512777b6395/FLAG0f0de3e72 [2022-10-15 17:59:19,058 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:59:19,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca-1.i [2022-10-15 17:59:19,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c15c4f/ccc0da663b3f4f3eacdd9512777b6395/FLAG0f0de3e72 [2022-10-15 17:59:19,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c15c4f/ccc0da663b3f4f3eacdd9512777b6395 [2022-10-15 17:59:19,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:59:19,336 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:59:19,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:19,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:59:19,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:59:19,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:19,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3217f03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19, skipping insertion in model container [2022-10-15 17:59:19,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:19,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:59:19,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:59:19,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:19,916 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:59:19,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:20,035 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:59:20,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20 WrapperNode [2022-10-15 17:59:20,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:20,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:20,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:59:20,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:59:20,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,102 INFO L138 Inliner]: procedures = 114, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2022-10-15 17:59:20,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:20,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:59:20,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:59:20,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:59:20,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,132 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:59:20,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:59:20,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:59:20,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:59:20,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (1/1) ... [2022-10-15 17:59:20,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:20,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:20,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:59:20,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:59:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:59:20,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:59:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 17:59:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 17:59:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 17:59:20,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:59:20,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:59:20,360 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:59:20,363 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:59:20,725 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:59:20,737 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:59:20,737 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:59:20,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:20 BoogieIcfgContainer [2022-10-15 17:59:20,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:59:20,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:59:20,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:59:20,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:59:20,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:59:19" (1/3) ... [2022-10-15 17:59:20,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1c48ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:20, skipping insertion in model container [2022-10-15 17:59:20,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:20" (2/3) ... [2022-10-15 17:59:20,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1c48ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:20, skipping insertion in model container [2022-10-15 17:59:20,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:20" (3/3) ... [2022-10-15 17:59:20,759 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet_ll_search-alloca-1.i [2022-10-15 17:59:20,785 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:59:20,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-10-15 17:59:20,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:59:20,878 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@45e1494, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:59:20,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-10-15 17:59:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.84) internal successors, (46), 40 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) [2022-10-15 17:59:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:59:20,892 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:20,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:59:20,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:20,905 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 17:59:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:20,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294881353] [2022-10-15 17:59:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:20,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294881353] [2022-10-15 17:59:21,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294881353] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080730177] [2022-10-15 17:59:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:21,328 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.84) internal successors, (46), 40 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-10-15 17:59:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,408 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-10-15 17:59:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-10-15 17:59:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,421 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:59:21,422 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 17:59:21,424 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 [2022-10-15 17:59:21,429 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 17:59:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-10-15 17:59:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 44 states have internal predecessors, (55), 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) [2022-10-15 17:59:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-10-15 17:59:21,473 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 3 [2022-10-15 17:59:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,474 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-10-15 17:59:21,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-10-15 17:59:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-10-15 17:59:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:59:21,475 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:59:21,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:59:21,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,476 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 17:59:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035471805] [2022-10-15 17:59:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:21,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035471805] [2022-10-15 17:59:21,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035471805] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:21,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802064854] [2022-10-15 17:59:21,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:21,585 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-10-15 17:59:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,695 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-10-15 17:59:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-10-15 17:59:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,699 INFO L225 Difference]: With dead ends: 63 [2022-10-15 17:59:21,700 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 17:59:21,700 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 [2022-10-15 17:59:21,703 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 17:59:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2022-10-15 17:59:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 43 states have internal predecessors, (51), 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) [2022-10-15 17:59:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-10-15 17:59:21,715 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 3 [2022-10-15 17:59:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,716 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-10-15 17:59:21,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-10-15 17:59:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-10-15 17:59:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:59:21,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:59:21,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2022-10-15 17:59:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134615139] [2022-10-15 17:59:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134615139] [2022-10-15 17:59:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134615139] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:21,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787930699] [2022-10-15 17:59:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:21,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:21,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:21,804 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-10-15 17:59:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,889 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-10-15 17:59:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:21,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 [2022-10-15 17:59:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,893 INFO L225 Difference]: With dead ends: 59 [2022-10-15 17:59:21,893 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 17:59:21,893 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 [2022-10-15 17:59:21,898 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 65 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 17:59:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2022-10-15 17:59:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 42 states have internal predecessors, (49), 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) [2022-10-15 17:59:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-10-15 17:59:21,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 6 [2022-10-15 17:59:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,914 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-10-15 17:59:21,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-10-15 17:59:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-10-15 17:59:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:59:21,921 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:59:21,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:21,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,923 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-10-15 17:59:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645190922] [2022-10-15 17:59:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:22,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645190922] [2022-10-15 17:59:22,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645190922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:22,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:22,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:22,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030192038] [2022-10-15 17:59:22,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:22,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:22,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:22,094 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-10-15 17:59:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:22,139 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-10-15 17:59:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:22,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 [2022-10-15 17:59:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:22,141 INFO L225 Difference]: With dead ends: 58 [2022-10-15 17:59:22,141 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 17:59:22,142 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 [2022-10-15 17:59:22,143 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:22,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 17:59:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-10-15 17:59:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 41 states have internal predecessors, (47), 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) [2022-10-15 17:59:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-10-15 17:59:22,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 6 [2022-10-15 17:59:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:22,152 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-10-15 17:59:22,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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) [2022-10-15 17:59:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-10-15 17:59:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:59:22,153 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:22,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:22,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:59:22,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1450908197, now seen corresponding path program 1 times [2022-10-15 17:59:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:22,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284379368] [2022-10-15 17:59:22,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284379368] [2022-10-15 17:59:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284379368] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:59:22,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992652544] [2022-10-15 17:59:22,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:22,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:59:22,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:22,425 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) [2022-10-15 17:59:22,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:59:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:22,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 17:59:22,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:59:22,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 17:59:22,687 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 17:59:22,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 17:59:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:22,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:59:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:22,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992652544] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:59:22,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:59:22,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-10-15 17:59:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067046763] [2022-10-15 17:59:22,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:59:22,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:59:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:22,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:59:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:59:22,830 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:22,906 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-10-15 17:59:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:59:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:59:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:22,908 INFO L225 Difference]: With dead ends: 55 [2022-10-15 17:59:22,909 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 17:59:22,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:59:22,914 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 87 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:22,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 84 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-10-15 17:59:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 17:59:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-10-15 17:59:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 38 states have internal predecessors, (44), 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) [2022-10-15 17:59:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-10-15 17:59:22,930 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2022-10-15 17:59:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:22,930 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-10-15 17:59:22,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-10-15 17:59:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:59:22,933 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:22,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:22,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:59:23,147 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 [2022-10-15 17:59:23,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1450908198, now seen corresponding path program 1 times [2022-10-15 17:59:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:23,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942815456] [2022-10-15 17:59:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942815456] [2022-10-15 17:59:23,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942815456] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:59:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412726017] [2022-10-15 17:59:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:23,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:59:23,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:23,510 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) [2022-10-15 17:59:23,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:59:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:23,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 17:59:23,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:59:23,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 17:59:23,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 17:59:23,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 17:59:23,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-15 17:59:23,734 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 17:59:23,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 17:59:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:23,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:59:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:26,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412726017] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:59:26,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:59:26,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-10-15 17:59:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312425847] [2022-10-15 17:59:26,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:59:26,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 17:59:26,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 17:59:26,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:59:26,131 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2022-10-15 17:59:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:26,263 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-10-15 17:59:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:59:26,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:59:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:26,265 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:59:26,265 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 17:59:26,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:59:26,267 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 102 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:26,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 76 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 14 Unchecked, 0.1s Time] [2022-10-15 17:59:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 17:59:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2022-10-15 17:59:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 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) [2022-10-15 17:59:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-10-15 17:59:26,272 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-10-15 17:59:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:26,272 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-10-15 17:59:26,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2022-10-15 17:59:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-10-15 17:59:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:59:26,274 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:26,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:26,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:59:26,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 17:59:26,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash -858993255, now seen corresponding path program 1 times [2022-10-15 17:59:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:26,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178082860] [2022-10-15 17:59:26,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:26,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178082860] [2022-10-15 17:59:26,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178082860] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:26,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:26,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:59:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953381124] [2022-10-15 17:59:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:26,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:59:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:59:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:59:26,607 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-10-15 17:59:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:26,767 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-10-15 17:59:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:59:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-10-15 17:59:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:26,768 INFO L225 Difference]: With dead ends: 73 [2022-10-15 17:59:26,769 INFO L226 Difference]: Without dead ends: 73 [2022-10-15 17:59:26,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:59:26,770 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 246 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:26,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 44 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-15 17:59:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 34. [2022-10-15 17:59:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 33 states have internal predecessors, (41), 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) [2022-10-15 17:59:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-10-15 17:59:26,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 13 [2022-10-15 17:59:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:26,776 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-10-15 17:59:26,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-10-15 17:59:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-10-15 17:59:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:59:26,777 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:26,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:26,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:59:26,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:26,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash -858993254, now seen corresponding path program 1 times [2022-10-15 17:59:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:26,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80416384] [2022-10-15 17:59:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:26,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:26,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80416384] [2022-10-15 17:59:26,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80416384] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:26,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:26,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:59:26,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811240870] [2022-10-15 17:59:26,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:26,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:59:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:26,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:59:26,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:59:26,945 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-10-15 17:59:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:27,105 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-10-15 17:59:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:59:27,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-10-15 17:59:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:27,107 INFO L225 Difference]: With dead ends: 77 [2022-10-15 17:59:27,107 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 17:59:27,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:59:27,108 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 214 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:27,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 71 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 17:59:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 37. [2022-10-15 17:59:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 36 states have internal predecessors, (44), 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) [2022-10-15 17:59:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-10-15 17:59:27,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 13 [2022-10-15 17:59:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:27,114 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-10-15 17:59:27,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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) [2022-10-15 17:59:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-10-15 17:59:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:59:27,115 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:27,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:27,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:59:27,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash -858608547, now seen corresponding path program 1 times [2022-10-15 17:59:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:27,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545785349] [2022-10-15 17:59:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:27,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545785349] [2022-10-15 17:59:27,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545785349] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:27,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:27,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:59:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693408254] [2022-10-15 17:59:27,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:27,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:59:27,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:27,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:59:27,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:59:27,211 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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) [2022-10-15 17:59:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:27,364 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-10-15 17:59:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:59:27,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:59:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:27,366 INFO L225 Difference]: With dead ends: 77 [2022-10-15 17:59:27,366 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 17:59:27,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:59:27,367 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 159 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:27,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 101 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 17:59:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 37. [2022-10-15 17:59:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-10-15 17:59:27,372 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 15 [2022-10-15 17:59:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:27,372 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-10-15 17:59:27,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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) [2022-10-15 17:59:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-10-15 17:59:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:59:27,373 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:27,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:27,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:59:27,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:59:27,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash -669665376, now seen corresponding path program 1 times [2022-10-15 17:59:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:27,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358601816] [2022-10-15 17:59:27,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:27,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:59:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:27,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:59:27,440 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:59:27,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2022-10-15 17:59:27,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2022-10-15 17:59:27,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2022-10-15 17:59:27,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2022-10-15 17:59:27,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2022-10-15 17:59:27,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2022-10-15 17:59:27,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2022-10-15 17:59:27,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2022-10-15 17:59:27,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2022-10-15 17:59:27,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2022-10-15 17:59:27,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2022-10-15 17:59:27,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2022-10-15 17:59:27,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2022-10-15 17:59:27,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2022-10-15 17:59:27,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2022-10-15 17:59:27,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:59:27,451 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:27,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:59:27,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:59:27 BoogieIcfgContainer [2022-10-15 17:59:27,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:59:27,490 INFO L158 Benchmark]: Toolchain (without parser) took 8159.50ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 130.6MB in the beginning and 167.2MB in the end (delta: -36.5MB). Peak memory consumption was 367.7kB. Max. memory is 8.0GB. [2022-10-15 17:59:27,491 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory was 127.5MB in the beginning and 127.4MB in the end (delta: 91.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:59:27,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.34ms. Allocated memory is still 157.3MB. Free memory was 130.5MB in the beginning and 115.2MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:59:27,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.18ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 113.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:59:27,492 INFO L158 Benchmark]: Boogie Preprocessor took 33.13ms. Allocated memory is still 157.3MB. Free memory was 113.2MB in the beginning and 111.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:27,492 INFO L158 Benchmark]: RCFGBuilder took 607.55ms. Allocated memory is still 157.3MB. Free memory was 111.8MB in the beginning and 128.6MB in the end (delta: -16.9MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:27,493 INFO L158 Benchmark]: TraceAbstraction took 6742.07ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 128.1MB in the beginning and 167.2MB in the end (delta: -39.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:59:27,495 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory was 127.5MB in the beginning and 127.4MB in the end (delta: 91.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 695.34ms. Allocated memory is still 157.3MB. Free memory was 130.5MB in the beginning and 115.2MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.18ms. Allocated memory is still 157.3MB. Free memory was 115.0MB in the beginning and 113.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.13ms. Allocated memory is still 157.3MB. Free memory was 113.2MB in the beginning and 111.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 607.55ms. Allocated memory is still 157.3MB. Free memory was 111.8MB in the beginning and 128.6MB in the end (delta: -16.9MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6742.07ms. Allocated memory was 157.3MB in the beginning and 192.9MB in the end (delta: 35.7MB). Free memory was 128.1MB in the beginning and 167.2MB in the end (delta: -39.1MB). There was no memory consumed. 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 - UnprovableResult [Line: 571]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 571. Possible FailurePath: [L573] int n = __VERIFIER_nondet_int(); [L574] CALL, EXPR init_nondet_ll(n) [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 VAL [\old(n)=0, curr={-1:0}, n=0] [L551] head = curr [L552] int i = 1; VAL [\old(n)=0, curr={-1:0}, head={-1:0}, i=1, n=0] [L552] COND FALSE !(i < n) VAL [\old(n)=0, curr={-1:0}, head={-1:0}, i=1, n=0] [L558] COND FALSE !(__VERIFIER_nondet_int()) [L561] curr->next = ((void *)0) VAL [\old(n)=0, curr={-1:0}, head={-1:0}, i=1, n=0] [L562] return head; VAL [\old(n)=0, \result={-1:0}, curr={-1:0}, head={-1:0}, i=1, n=0] [L574] RET, EXPR init_nondet_ll(n) [L574] node_t* head = init_nondet_ll(n); [L575] CALL safe_search(head, __VERIFIER_nondet_int()) [L566] node_t* curr = head; VAL [\old(i)=0, curr={-1:0}, head={-1:0}, head={-1:0}, i=0] [L567] curr != ((void *)0) && curr->val != i VAL [\old(i)=0, curr={-1:0}, curr != ((void *)0) && curr->val != i=1, head={-1:0}, head={-1:0}, i=0] [L567] EXPR curr->val VAL [\old(i)=0, curr={-1:0}, curr != ((void *)0) && curr->val != i=1, curr->val=0, head={-1:0}, head={-1:0}, i=0] [L567] curr != ((void *)0) && curr->val != i VAL [\old(i)=0, curr={-1:0}, curr != ((void *)0) && curr->val != i=0, curr->val=0, head={-1:0}, head={-1:0}, i=0] [L567] COND FALSE !(curr != ((void *)0) && curr->val != i) [L575] RET safe_search(head, __VERIFIER_nondet_int()) [L576] return 0; VAL [\result=0, head={-1:0}, n=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 939 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 939 mSDsluCounter, 588 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 50 IncrementalHoareTripleChecker+Unchecked, 318 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 270 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=1, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 214 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 118 ConstructedInterpolants, 10 QuantifiedInterpolants, 805 SizeOfPredicates, 8 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 6/18 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: unable to determine feasibility of some traces [2022-10-15 17:59:27,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...