/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-alloca/b.10-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:57:08,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:57:08,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:57:08,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:57:08,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:57:08,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:57:08,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:57:08,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:57:08,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:57:08,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:57:08,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:57:08,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:57:08,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:57:08,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:57:08,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:57:08,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:57:08,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:57:08,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:57:08,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:57:08,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:57:08,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:57:08,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:57:08,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:57:08,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:57:08,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:57:08,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:57:08,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:57:08,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:57:08,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:57:08,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:57:08,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:57:08,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:57:08,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:57:08,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:57:08,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:57:08,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:57:08,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:57:08,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:57:08,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:57:08,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:57:08,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:57:08,401 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:57:08,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:57:08,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:57:08,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:57:08,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:57:08,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:57:08,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:57:08,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:57:08,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:57:08,456 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:57:08,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:57:08,457 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:57:08,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:57:08,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:57:08,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:57:08,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:57:08,458 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:57:08,458 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:57:08,459 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:57:08,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:57:08,459 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:57:08,459 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:57:08,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:57:08,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:57:08,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:57:08,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:57:08,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:57:08,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:57:08,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:57:08,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:57:08,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:57:08,462 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:57:08,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:57:08,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:57:08,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:57:08,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:57:08,917 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:57:08,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2022-10-15 17:57:09,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74493d08b/f231ba7578ac47d1b525b07d69840554/FLAG6956a4280 [2022-10-15 17:57:09,648 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:57:09,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2022-10-15 17:57:09,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74493d08b/f231ba7578ac47d1b525b07d69840554/FLAG6956a4280 [2022-10-15 17:57:09,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74493d08b/f231ba7578ac47d1b525b07d69840554 [2022-10-15 17:57:09,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:57:09,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:57:09,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:57:09,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:57:09,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:57:09,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:57:09" (1/1) ... [2022-10-15 17:57:09,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7692fb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:09, skipping insertion in model container [2022-10-15 17:57:09,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:57:09" (1/1) ... [2022-10-15 17:57:09,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:57:10,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:57:10,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:57:10,455 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:57:10,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:57:10,588 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:57:10,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10 WrapperNode [2022-10-15 17:57:10,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:57:10,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:57:10,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:57:10,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:57:10,607 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:57:10" (1/1) ... [2022-10-15 17:57:10,642 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:57:10" (1/1) ... [2022-10-15 17:57:10,693 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2022-10-15 17:57:10,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:57:10,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:57:10,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:57:10,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:57:10,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,747 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:57:10,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:57:10,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:57:10,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:57:10,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (1/1) ... [2022-10-15 17:57:10,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:57:10,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:10,796 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:57:10,819 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:57:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:57:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:57:10,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:57:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:57:10,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:57:10,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:57:11,040 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:57:11,043 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:57:11,542 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:57:11,550 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:57:11,551 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 17:57:11,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:57:11 BoogieIcfgContainer [2022-10-15 17:57:11,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:57:11,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:57:11,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:57:11,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:57:11,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:57:09" (1/3) ... [2022-10-15 17:57:11,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9a9335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:57:11, skipping insertion in model container [2022-10-15 17:57:11,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:10" (2/3) ... [2022-10-15 17:57:11,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9a9335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:57:11, skipping insertion in model container [2022-10-15 17:57:11,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:57:11" (3/3) ... [2022-10-15 17:57:11,563 INFO L112 eAbstractionObserver]: Analyzing ICFG b.10-alloca.i [2022-10-15 17:57:11,586 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:57:11,586 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-10-15 17:57:11,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:57:11,656 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;@f1965dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:57:11,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-10-15 17:57:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 41 states have (on average 2.097560975609756) internal successors, (86), 78 states have internal predecessors, (86), 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:57:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:57:11,689 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:11,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:57:11,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 17:57:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507009704] [2022-10-15 17:57:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:12,418 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:57:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:12,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507009704] [2022-10-15 17:57:12,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507009704] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:12,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:12,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175406086] [2022-10-15 17:57:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:12,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:12,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:12,480 INFO L87 Difference]: Start difference. First operand has 79 states, 41 states have (on average 2.097560975609756) internal successors, (86), 78 states have internal predecessors, (86), 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:57:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:12,646 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-10-15 17:57:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:12,649 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:57:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:12,659 INFO L225 Difference]: With dead ends: 70 [2022-10-15 17:57:12,660 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 17:57:12,662 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:57:12,666 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:12,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 17:57:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-15 17:57:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.85) internal successors, (74), 67 states have internal predecessors, (74), 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:57:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-10-15 17:57:12,714 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 3 [2022-10-15 17:57:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:12,715 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-10-15 17:57:12,715 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:57:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-10-15 17:57:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:57:12,716 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:12,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:57:12,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:57:12,717 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 17:57:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:12,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246909013] [2022-10-15 17:57:12,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:12,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:12,957 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:57:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:12,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246909013] [2022-10-15 17:57:12,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246909013] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:12,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:12,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872891024] [2022-10-15 17:57:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:12,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:12,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:12,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:12,964 INFO L87 Difference]: Start difference. First operand 68 states and 74 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:57:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:13,060 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-10-15 17:57:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:13,061 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:57:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:13,067 INFO L225 Difference]: With dead ends: 59 [2022-10-15 17:57:13,068 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 17:57:13,073 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:57:13,076 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:13,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 17:57:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-10-15 17:57:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.625) internal successors, (65), 58 states have internal predecessors, (65), 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:57:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-10-15 17:57:13,103 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 3 [2022-10-15 17:57:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:13,104 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-10-15 17:57:13,104 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:57:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-10-15 17:57:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:57:13,105 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:13,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:57:13,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:57:13,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-10-15 17:57:13,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582102584] [2022-10-15 17:57:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:13,319 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:57:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:13,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582102584] [2022-10-15 17:57:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582102584] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:13,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518734010] [2022-10-15 17:57:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:13,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:13,337 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:57:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:13,458 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-10-15 17:57:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-10-15 17:57:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:13,465 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:57:13,465 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 17:57:13,466 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:57:13,468 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:13,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 17:57:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 17:57:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.45) internal successors, (58), 51 states have internal predecessors, (58), 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:57:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-10-15 17:57:13,488 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 4 [2022-10-15 17:57:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:13,488 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-10-15 17:57:13,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:57:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-10-15 17:57:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:57:13,493 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:13,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:57:13,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:57:13,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-10-15 17:57:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:13,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23559076] [2022-10-15 17:57:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:13,749 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:57:13,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:13,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23559076] [2022-10-15 17:57:13,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23559076] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:13,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891326501] [2022-10-15 17:57:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:13,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:13,759 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:57:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:13,820 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-10-15 17:57:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:13,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-10-15 17:57:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:13,824 INFO L225 Difference]: With dead ends: 45 [2022-10-15 17:57:13,824 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 17:57:13,824 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:57:13,837 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:13,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 17:57:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 17:57:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-10-15 17:57:13,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 4 [2022-10-15 17:57:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:13,852 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-10-15 17:57:13,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:57:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-10-15 17:57:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 17:57:13,853 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:13,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 17:57:13,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:57:13,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-10-15 17:57:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769997966] [2022-10-15 17:57:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:13,986 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:57:13,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:13,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769997966] [2022-10-15 17:57:13,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769997966] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:13,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:13,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:13,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926083471] [2022-10-15 17:57:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:13,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:13,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:13,990 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,030 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-10-15 17:57:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:14,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 17:57:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,032 INFO L225 Difference]: With dead ends: 43 [2022-10-15 17:57:14,032 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 17:57:14,033 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:57:14,034 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 17:57:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-10-15 17:57:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-10-15 17:57:14,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 5 [2022-10-15 17:57:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,040 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-10-15 17:57:14,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-10-15 17:57:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 17:57:14,041 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 17:57:14,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:57:14,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-10-15 17:57:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954521951] [2022-10-15 17:57:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,136 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:57:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954521951] [2022-10-15 17:57:14,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954521951] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494076421] [2022-10-15 17:57:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:14,140 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,173 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-10-15 17:57:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:14,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 17:57:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,175 INFO L225 Difference]: With dead ends: 41 [2022-10-15 17:57:14,175 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 17:57:14,175 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:57:14,176 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 17:57:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-10-15 17:57:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-10-15 17:57:14,182 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 5 [2022-10-15 17:57:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,182 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-10-15 17:57:14,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-10-15 17:57:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:57:14,183 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:14,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:57:14,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1871814777, now seen corresponding path program 1 times [2022-10-15 17:57:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404153229] [2022-10-15 17:57:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,252 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:57:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404153229] [2022-10-15 17:57:14,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404153229] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:57:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764208896] [2022-10-15 17:57:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:14,255 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:57:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,294 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-10-15 17:57:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:57:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-10-15 17:57:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,296 INFO L225 Difference]: With dead ends: 56 [2022-10-15 17:57:14,296 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 17:57:14,297 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:57:14,298 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 17:57:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2022-10-15 17:57:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-10-15 17:57:14,304 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 17 [2022-10-15 17:57:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,304 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-10-15 17:57:14,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:57:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-10-15 17:57:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:57:14,306 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:14,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:57:14,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1427152758, now seen corresponding path program 1 times [2022-10-15 17:57:14,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290133098] [2022-10-15 17:57:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,376 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:57:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290133098] [2022-10-15 17:57:14,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290133098] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:57:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409483937] [2022-10-15 17:57:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:14,380 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,411 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-10-15 17:57:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:57:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:57:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,413 INFO L225 Difference]: With dead ends: 49 [2022-10-15 17:57:14,413 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 17:57:14,413 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:57:14,414 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 124 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 17:57:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-10-15 17:57:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-10-15 17:57:14,419 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-10-15 17:57:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,420 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-10-15 17:57:14,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-10-15 17:57:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 17:57:14,421 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:14,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:57:14,422 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1814683072, now seen corresponding path program 1 times [2022-10-15 17:57:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291235069] [2022-10-15 17:57:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,614 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:57:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291235069] [2022-10-15 17:57:14,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291235069] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:57:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94915603] [2022-10-15 17:57:14,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:57:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:57:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:57:14,618 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:57:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,842 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-10-15 17:57:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:57:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2022-10-15 17:57:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,844 INFO L225 Difference]: With dead ends: 85 [2022-10-15 17:57:14,844 INFO L226 Difference]: Without dead ends: 85 [2022-10-15 17:57:14,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:57:14,846 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 128 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 182 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-10-15 17:57:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-10-15 17:57:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 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:57:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-10-15 17:57:14,854 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 21 [2022-10-15 17:57:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,855 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-10-15 17:57:14,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:57:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-10-15 17:57:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 17:57:14,857 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:14,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:57:14,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-10-15 17:57:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 843563454, now seen corresponding path program 1 times [2022-10-15 17:57:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568089718] [2022-10-15 17:57:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:15,662 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:57:15,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:15,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568089718] [2022-10-15 17:57:15,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568089718] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:15,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:15,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:57:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851640236] [2022-10-15 17:57:15,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:15,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:57:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:15,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:57:15,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:57:15,693 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:57:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:15,757 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-10-15 17:57:15,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:57:15,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-10-15 17:57:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:15,759 INFO L225 Difference]: With dead ends: 71 [2022-10-15 17:57:15,759 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:57:15,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:57:15,760 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:15,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:57:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:57:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:57:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:57:15,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-10-15 17:57:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:15,763 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:57:15,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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:57:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:57:15,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:57:15,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 37 remaining) [2022-10-15 17:57:15,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2022-10-15 17:57:15,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2022-10-15 17:57:15,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2022-10-15 17:57:15,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2022-10-15 17:57:15,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2022-10-15 17:57:15,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2022-10-15 17:57:15,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2022-10-15 17:57:15,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2022-10-15 17:57:15,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2022-10-15 17:57:15,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2022-10-15 17:57:15,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2022-10-15 17:57:15,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 37 remaining) [2022-10-15 17:57:15,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2022-10-15 17:57:15,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2022-10-15 17:57:15,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2022-10-15 17:57:15,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2022-10-15 17:57:15,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2022-10-15 17:57:15,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2022-10-15 17:57:15,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2022-10-15 17:57:15,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2022-10-15 17:57:15,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2022-10-15 17:57:15,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2022-10-15 17:57:15,775 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2022-10-15 17:57:15,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2022-10-15 17:57:15,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2022-10-15 17:57:15,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2022-10-15 17:57:15,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2022-10-15 17:57:15,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2022-10-15 17:57:15,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 37 remaining) [2022-10-15 17:57:15,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2022-10-15 17:57:15,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2022-10-15 17:57:15,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2022-10-15 17:57:15,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 37 remaining) [2022-10-15 17:57:15,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2022-10-15 17:57:15,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2022-10-15 17:57:15,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (0 of 37 remaining) [2022-10-15 17:57:15,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:57:15,784 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:15,788 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:57:15,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:57:15 BoogieIcfgContainer [2022-10-15 17:57:15,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:57:15,794 INFO L158 Benchmark]: Toolchain (without parser) took 5824.01ms. Allocated memory was 154.1MB in the beginning and 190.8MB in the end (delta: 36.7MB). Free memory was 127.2MB in the beginning and 163.3MB in the end (delta: -36.1MB). Peak memory consumption was 1.7MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,795 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 154.1MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:57:15,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.09ms. Allocated memory is still 154.1MB. Free memory was 127.0MB in the beginning and 111.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.50ms. Allocated memory is still 154.1MB. Free memory was 111.1MB in the beginning and 109.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,796 INFO L158 Benchmark]: Boogie Preprocessor took 56.26ms. Allocated memory is still 154.1MB. Free memory was 109.2MB in the beginning and 107.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,796 INFO L158 Benchmark]: RCFGBuilder took 801.37ms. Allocated memory is still 154.1MB. Free memory was 107.9MB in the beginning and 124.1MB in the end (delta: -16.2MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,797 INFO L158 Benchmark]: TraceAbstraction took 4237.54ms. Allocated memory was 154.1MB in the beginning and 190.8MB in the end (delta: 36.7MB). Free memory was 123.1MB in the beginning and 163.3MB in the end (delta: -40.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:57:15,799 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.78ms. Allocated memory is still 154.1MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 612.09ms. Allocated memory is still 154.1MB. Free memory was 127.0MB in the beginning and 111.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 102.50ms. Allocated memory is still 154.1MB. Free memory was 111.1MB in the beginning and 109.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.26ms. Allocated memory is still 154.1MB. Free memory was 109.2MB in the beginning and 107.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 801.37ms. Allocated memory is still 154.1MB. Free memory was 107.9MB in the beginning and 124.1MB in the end (delta: -16.2MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4237.54ms. Allocated memory was 154.1MB in the beginning and 190.8MB in the end (delta: 36.7MB). Free memory was 123.1MB in the beginning and 163.3MB in the end (delta: -40.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 79 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 528 mSDsluCounter, 690 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 375 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 41, 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, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 37 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-15 17:57:15,869 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...