/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/cll_search-alloca-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:59:00,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:59:00,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:59:00,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:59:00,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:59:00,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:59:00,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:59:00,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:59:00,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:59:00,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:59:00,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:59:00,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:59:00,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:59:00,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:59:00,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:59:00,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:59:00,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:59:00,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:59:00,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:59:00,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:59:00,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:59:00,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:59:00,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:59:00,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:59:00,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:59:00,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:59:00,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:59:00,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:59:00,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:59:00,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:59:00,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:59:00,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:59:00,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:59:00,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:59:00,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:59:00,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:59:00,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:59:00,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:59:00,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:59:00,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:59:00,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:59:00,728 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:00,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:59:00,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:59:00,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:59:00,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:59:00,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:59:00,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:59:00,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:59:00,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:59:00,761 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:59:00,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:59:00,762 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:59:00,762 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:59:00,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:59:00,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:59:00,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:59:00,763 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:59:00,763 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:59:00,763 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:59:00,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:59:00,763 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:59:00,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:59:00,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:59:00,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:59:00,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:59:00,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:59:00,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:00,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:59:00,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:59:00,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:59:00,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:59:00,766 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:01,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:59:01,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:59:01,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:59:01,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:59:01,210 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:59:01,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2022-10-15 17:59:01,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714c3234b/35837386b3ef4fc99d5e04558518a77e/FLAG939067bb0 [2022-10-15 17:59:02,125 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:59:02,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2022-10-15 17:59:02,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714c3234b/35837386b3ef4fc99d5e04558518a77e/FLAG939067bb0 [2022-10-15 17:59:02,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/714c3234b/35837386b3ef4fc99d5e04558518a77e [2022-10-15 17:59:02,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:59:02,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:59:02,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:02,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:59:02,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:59:02,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:02" (1/1) ... [2022-10-15 17:59:02,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac2465c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:02, skipping insertion in model container [2022-10-15 17:59:02,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:02" (1/1) ... [2022-10-15 17:59:02,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:59:02,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:59:02,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:02,962 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:59:03,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:03,093 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:59:03,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:03 WrapperNode [2022-10-15 17:59:03,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:03,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:03,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:59:03,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:59:03,108 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:03" (1/1) ... [2022-10-15 17:59:03,157 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:03" (1/1) ... [2022-10-15 17:59:03,190 INFO L138 Inliner]: procedures = 114, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-10-15 17:59:03,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:03,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:59:03,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:59:03,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:59:03,204 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:03" (1/1) ... [2022-10-15 17:59:03,204 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:03" (1/1) ... [2022-10-15 17:59:03,216 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:03" (1/1) ... [2022-10-15 17:59:03,217 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:03" (1/1) ... [2022-10-15 17:59:03,235 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:03" (1/1) ... [2022-10-15 17:59:03,241 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:03" (1/1) ... [2022-10-15 17:59:03,247 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:03" (1/1) ... [2022-10-15 17:59:03,254 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:03" (1/1) ... [2022-10-15 17:59:03,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:59:03,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:59:03,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:59:03,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:59:03,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:03" (1/1) ... [2022-10-15 17:59:03,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:03,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:03,303 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:03,317 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:03,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:59:03,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:59:03,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 17:59:03,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 17:59:03,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 17:59:03,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:59:03,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:59:03,472 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:59:03,475 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:59:03,834 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:59:03,842 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:59:03,848 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:59:03,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:03 BoogieIcfgContainer [2022-10-15 17:59:03,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:59:03,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:59:03,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:59:03,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:59:03,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:59:02" (1/3) ... [2022-10-15 17:59:03,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526e2efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:03, skipping insertion in model container [2022-10-15 17:59:03,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:03" (2/3) ... [2022-10-15 17:59:03,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526e2efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:03, skipping insertion in model container [2022-10-15 17:59:03,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:03" (3/3) ... [2022-10-15 17:59:03,863 INFO L112 eAbstractionObserver]: Analyzing ICFG cll_search-alloca-2.i [2022-10-15 17:59:03,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:59:03,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-10-15 17:59:03,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:59:03,975 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;@21ab814b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:59:03,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-10-15 17:59:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.894736842105263) internal successors, (36), 32 states have internal predecessors, (36), 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:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:59:03,989 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:03,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:59:03,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 17:59:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:04,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129258835] [2022-10-15 17:59:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:04,375 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:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:04,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129258835] [2022-10-15 17:59:04,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129258835] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:04,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:04,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:04,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037611851] [2022-10-15 17:59:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:04,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:04,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:04,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:04,433 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.894736842105263) internal successors, (36), 32 states have internal predecessors, (36), 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:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:04,536 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-10-15 17:59:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:04,540 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:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:04,550 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:59:04,550 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:59:04,552 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:04,558 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:04,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:59:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-10-15 17:59:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 33 states have internal predecessors, (40), 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:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-10-15 17:59:04,608 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 3 [2022-10-15 17:59:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:04,609 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-10-15 17:59:04,609 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:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-10-15 17:59:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:59:04,610 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:04,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:59:04,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:59:04,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 17:59:04,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:04,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829959903] [2022-10-15 17:59:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:04,779 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:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:04,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829959903] [2022-10-15 17:59:04,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829959903] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:04,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:04,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863266918] [2022-10-15 17:59:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:04,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:04,787 INFO L87 Difference]: Start difference. First operand 34 states and 40 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:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:04,872 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-10-15 17:59:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:04,873 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:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:04,876 INFO L225 Difference]: With dead ends: 49 [2022-10-15 17:59:04,876 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 17:59:04,881 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:04,883 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:04,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 17:59:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-10-15 17:59:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 32 states have internal predecessors, (37), 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:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-10-15 17:59:04,900 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 3 [2022-10-15 17:59:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:04,902 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-10-15 17:59:04,903 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:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-10-15 17:59:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:59:04,904 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:04,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:59:04,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:59:04,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2022-10-15 17:59:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:04,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259967880] [2022-10-15 17:59:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:05,053 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:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:05,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259967880] [2022-10-15 17:59:05,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259967880] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:05,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:05,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834416903] [2022-10-15 17:59:05,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:05,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:05,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:05,057 INFO L87 Difference]: Start difference. First operand 33 states and 37 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:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:05,104 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-10-15 17:59:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:05,105 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:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:05,106 INFO L225 Difference]: With dead ends: 45 [2022-10-15 17:59:05,106 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 17:59:05,107 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:05,108 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:05,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 42 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 17:59:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2022-10-15 17:59:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 31 states have internal predecessors, (35), 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:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-10-15 17:59:05,117 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 6 [2022-10-15 17:59:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:05,118 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-10-15 17:59:05,118 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:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-10-15 17:59:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:59:05,120 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:05,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:59:05,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:59:05,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:05,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:05,122 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-10-15 17:59:05,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:05,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255953806] [2022-10-15 17:59:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:05,317 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:05,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255953806] [2022-10-15 17:59:05,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255953806] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:05,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:05,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476661570] [2022-10-15 17:59:05,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:05,325 INFO L87 Difference]: Start difference. First operand 32 states and 35 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:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:05,388 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-10-15 17:59:05,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:05,389 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:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:05,390 INFO L225 Difference]: With dead ends: 44 [2022-10-15 17:59:05,390 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 17:59:05,391 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:05,395 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:05,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 17:59:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-10-15 17:59:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 30 states have internal predecessors, (33), 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:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-10-15 17:59:05,407 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 6 [2022-10-15 17:59:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:05,407 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-10-15 17:59:05,408 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:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-10-15 17:59:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:59:05,408 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:05,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:05,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:59:05,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1840342287, now seen corresponding path program 1 times [2022-10-15 17:59:05,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:05,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631830921] [2022-10-15 17:59:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:05,569 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:05,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:05,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631830921] [2022-10-15 17:59:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631830921] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:05,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:59:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781061177] [2022-10-15 17:59:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:05,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:59:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:59:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:59:05,572 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:05,740 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-10-15 17:59:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:59:05,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 17:59:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:05,742 INFO L225 Difference]: With dead ends: 47 [2022-10-15 17:59:05,742 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 17:59:05,745 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:05,747 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:05,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 29 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 17:59:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-10-15 17:59:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-10-15 17:59:05,758 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 9 [2022-10-15 17:59:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:05,759 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-10-15 17:59:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-10-15 17:59:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:59:05,760 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:05,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:59:05,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1840342288, now seen corresponding path program 1 times [2022-10-15 17:59:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:05,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649593651] [2022-10-15 17:59:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:05,988 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:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:05,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649593651] [2022-10-15 17:59:05,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649593651] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:05,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:05,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:59:05,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552624110] [2022-10-15 17:59:05,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:05,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:59:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:59:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:59:05,991 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:06,192 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-10-15 17:59:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:59:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 17:59:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:06,193 INFO L225 Difference]: With dead ends: 57 [2022-10-15 17:59:06,193 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 17:59:06,194 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:06,195 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 146 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:06,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 47 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 17:59:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2022-10-15 17:59:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 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:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-10-15 17:59:06,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 9 [2022-10-15 17:59:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:06,201 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-10-15 17:59:06,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-10-15 17:59:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:59:06,202 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:06,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:06,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:59:06,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:06,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 462445437, now seen corresponding path program 1 times [2022-10-15 17:59:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:06,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868788920] [2022-10-15 17:59:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:06,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868788920] [2022-10-15 17:59:06,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868788920] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:06,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:06,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:59:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726593956] [2022-10-15 17:59:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:06,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:59:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:59:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:59:06,264 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:06,312 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-10-15 17:59:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:59:06,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-10-15 17:59:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:06,314 INFO L225 Difference]: With dead ends: 46 [2022-10-15 17:59:06,314 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 17:59:06,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:59:06,315 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:06,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 17:59:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-10-15 17:59:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-10-15 17:59:06,320 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2022-10-15 17:59:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:06,321 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-10-15 17:59:06,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-10-15 17:59:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:59:06,322 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:06,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:06,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:59:06,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash 462445438, now seen corresponding path program 1 times [2022-10-15 17:59:06,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:06,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653878695] [2022-10-15 17:59:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:06,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:06,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653878695] [2022-10-15 17:59:06,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653878695] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:06,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:06,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:59:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046323694] [2022-10-15 17:59:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:06,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:59:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:06,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:59:06,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:59:06,433 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:06,494 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-10-15 17:59:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:59:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-10-15 17:59:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:06,495 INFO L225 Difference]: With dead ends: 44 [2022-10-15 17:59:06,496 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 17:59:06,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:59:06,497 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:06,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 17:59:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2022-10-15 17:59:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-10-15 17:59:06,501 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2022-10-15 17:59:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:06,502 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-10-15 17:59:06,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-10-15 17:59:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:59:06,503 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:06,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:06,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:59:06,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:59:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash 379550814, now seen corresponding path program 1 times [2022-10-15 17:59:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:06,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355286134] [2022-10-15 17:59:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:06,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:59:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:06,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:59:06,562 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:59:06,563 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-10-15 17:59:06,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2022-10-15 17:59:06,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-10-15 17:59:06,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-10-15 17:59:06,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-10-15 17:59:06,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-10-15 17:59:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-10-15 17:59:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-10-15 17:59:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2022-10-15 17:59:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2022-10-15 17:59:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2022-10-15 17:59:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2022-10-15 17:59:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 13 remaining) [2022-10-15 17:59:06,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:59:06,573 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:06,578 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:59:06,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:59:06 BoogieIcfgContainer [2022-10-15 17:59:06,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:59:06,611 INFO L158 Benchmark]: Toolchain (without parser) took 4234.16ms. Allocated memory is still 151.0MB. Free memory was 124.1MB in the beginning and 78.0MB in the end (delta: 46.0MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. [2022-10-15 17:59:06,611 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 125.8MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:59:06,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.57ms. Allocated memory is still 151.0MB. Free memory was 123.9MB in the beginning and 108.4MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:59:06,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.30ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 106.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:06,613 INFO L158 Benchmark]: Boogie Preprocessor took 67.86ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 105.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:59:06,613 INFO L158 Benchmark]: RCFGBuilder took 591.45ms. Allocated memory is still 151.0MB. Free memory was 105.1MB in the beginning and 126.1MB in the end (delta: -20.9MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2022-10-15 17:59:06,613 INFO L158 Benchmark]: TraceAbstraction took 2755.26ms. Allocated memory is still 151.0MB. Free memory was 125.6MB in the beginning and 78.0MB in the end (delta: 47.6MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. [2022-10-15 17:59:06,615 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.35ms. Allocated memory is still 125.8MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 708.57ms. Allocated memory is still 151.0MB. Free memory was 123.9MB in the beginning and 108.4MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.30ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 106.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.86ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 105.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 591.45ms. Allocated memory is still 151.0MB. Free memory was 105.1MB in the beginning and 126.1MB in the end (delta: -20.9MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2755.26ms. Allocated memory is still 151.0MB. Free memory was 125.6MB in the beginning and 78.0MB in the end (delta: 47.6MB). Peak memory consumption was 47.4MB. 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: 568]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 568. Possible FailurePath: [L570] int n = __VERIFIER_nondet_int(); [L571] CALL, EXPR init_cll(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] curr->next = head VAL [\old(n)=0, curr={-1:0}, head={-1:0}, i=1, n=0] [L559] return head; VAL [\old(n)=0, \result={-1:0}, curr={-1:0}, head={-1:0}, i=1, n=0] [L571] RET, EXPR init_cll(n) [L571] node_t* head = init_cll(n); [L572] CALL search(head, __VERIFIER_nondet_int()) [L563] node_t* curr = head; VAL [\old(i)=0, curr={-1:0}, head={-1:0}, head={-1:0}, i=0] [L564] EXPR curr->val VAL [\old(i)=0, curr={-1:0}, curr->val=0, head={-1:0}, head={-1:0}, i=0] [L564] COND FALSE !(curr->val != i) [L572] RET search(head, __VERIFIER_nondet_int()) [L573] 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 277 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 167 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, InterpolantAutomatonStates: 39, 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, 8 MinimizatonAttempts, 120 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2/2 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:06,671 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...