/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/array-fpi/sqm-if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:20:44,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:20:44,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:20:44,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:20:44,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:20:44,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:20:44,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:20:44,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:20:44,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:20:44,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:20:44,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:20:44,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:20:44,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:20:44,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:20:44,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:20:44,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:20:44,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:20:44,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:20:44,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:20:44,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:20:44,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:20:44,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:20:44,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:20:44,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:20:44,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:20:44,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:20:44,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:20:44,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:20:44,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:20:44,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:20:44,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:20:44,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:20:44,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:20:44,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:20:44,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:20:44,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:20:44,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:20:44,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:20:44,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:20:44,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:20:44,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:20:44,702 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 16:20:44,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:20:44,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:20:44,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:20:44,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:20:44,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:20:44,761 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:20:44,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:20:44,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:20:44,764 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:20:44,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:20:44,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:20:44,766 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:20:44,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:20:44,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:20:44,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:20:44,767 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:20:44,767 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:20:44,767 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:20:44,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:20:44,768 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:20:44,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:20:44,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:20:44,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:20:44,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:20:44,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:20:44,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:20:44,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:20:44,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:20:44,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:20:44,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:20:44,771 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 16:20:45,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:20:45,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:20:45,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:20:45,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:20:45,265 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:20:45,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sqm-if.c [2022-10-15 16:20:45,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316e30c74/9e44386338aa4c11ab4817fa197ec0ae/FLAG55d9fef1c [2022-10-15 16:20:45,914 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:20:45,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sqm-if.c [2022-10-15 16:20:45,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316e30c74/9e44386338aa4c11ab4817fa197ec0ae/FLAG55d9fef1c [2022-10-15 16:20:46,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316e30c74/9e44386338aa4c11ab4817fa197ec0ae [2022-10-15 16:20:46,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:20:46,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:20:46,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:20:46,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:20:46,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:20:46,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6d27b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46, skipping insertion in model container [2022-10-15 16:20:46,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:20:46,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:20:46,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sqm-if.c[589,602] [2022-10-15 16:20:46,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:20:46,550 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:20:46,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sqm-if.c[589,602] [2022-10-15 16:20:46,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:20:46,621 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:20:46,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46 WrapperNode [2022-10-15 16:20:46,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:20:46,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:20:46,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:20:46,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:20:46,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,670 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-10-15 16:20:46,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:20:46,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:20:46,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:20:46,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:20:46,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,699 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:20:46,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:20:46,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:20:46,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:20:46,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (1/1) ... [2022-10-15 16:20:46,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:20:46,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:46,755 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 16:20:46,778 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 16:20:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:20:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:20:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:20:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:20:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:20:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:20:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:20:46,931 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:20:46,934 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:20:47,383 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:20:47,394 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:20:47,395 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 16:20:47,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:20:47 BoogieIcfgContainer [2022-10-15 16:20:47,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:20:47,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:20:47,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:20:47,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:20:47,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:20:46" (1/3) ... [2022-10-15 16:20:47,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7135a3bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:20:47, skipping insertion in model container [2022-10-15 16:20:47,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:20:46" (2/3) ... [2022-10-15 16:20:47,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7135a3bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:20:47, skipping insertion in model container [2022-10-15 16:20:47,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:20:47" (3/3) ... [2022-10-15 16:20:47,414 INFO L112 eAbstractionObserver]: Analyzing ICFG sqm-if.c [2022-10-15 16:20:47,440 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:20:47,440 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-15 16:20:47,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:20:47,538 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;@6075d732, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:20:47,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-15 16:20:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.90625) internal successors, (61), 50 states have internal predecessors, (61), 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 16:20:47,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:20:47,556 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:47,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:20:47,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2022-10-15 16:20:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:47,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609063536] [2022-10-15 16:20:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:47,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:47,763 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 16:20:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609063536] [2022-10-15 16:20:47,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609063536] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:47,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:47,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:20:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669283508] [2022-10-15 16:20:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:47,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:47,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:47,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:47,809 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.90625) internal successors, (61), 50 states have internal predecessors, (61), 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 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 16:20:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:47,872 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-10-15 16:20:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:47,875 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 16:20:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:47,884 INFO L225 Difference]: With dead ends: 52 [2022-10-15 16:20:47,884 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 16:20:47,886 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 16:20:47,891 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 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 16:20:47,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:20:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 16:20:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-15 16:20:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 48 states have internal predecessors, (53), 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 16:20:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-10-15 16:20:47,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 4 [2022-10-15 16:20:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:47,932 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-10-15 16:20:47,933 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 16:20:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-10-15 16:20:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:20:47,934 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:47,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:47,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:20:47,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash 179478226, now seen corresponding path program 1 times [2022-10-15 16:20:47,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:47,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552627225] [2022-10-15 16:20:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:48,160 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 16:20:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:48,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552627225] [2022-10-15 16:20:48,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552627225] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:48,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:48,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:20:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055877592] [2022-10-15 16:20:48,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:48,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:48,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:48,171 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:48,251 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-10-15 16:20:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 16:20:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:48,255 INFO L225 Difference]: With dead ends: 45 [2022-10-15 16:20:48,255 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 16:20:48,256 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 16:20:48,258 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:48,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 16:20:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 16:20:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 44 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 16:20:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-10-15 16:20:48,272 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 8 [2022-10-15 16:20:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:48,272 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-10-15 16:20:48,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-10-15 16:20:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:20:48,273 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:48,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:48,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:20:48,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 179478227, now seen corresponding path program 1 times [2022-10-15 16:20:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:48,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887107305] [2022-10-15 16:20:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:48,567 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 16:20:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887107305] [2022-10-15 16:20:48,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887107305] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:48,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:48,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:20:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284491561] [2022-10-15 16:20:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:48,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:20:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:20:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:20:48,571 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:48,658 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-10-15 16:20:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:20:48,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 16:20:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:48,660 INFO L225 Difference]: With dead ends: 44 [2022-10-15 16:20:48,660 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 16:20:48,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:20:48,663 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 128 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:48,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 16:20:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-15 16:20:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-10-15 16:20:48,671 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 8 [2022-10-15 16:20:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:48,671 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-10-15 16:20:48,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-10-15 16:20:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:20:48,672 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:48,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:48,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:20:48,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:48,674 INFO L85 PathProgramCache]: Analyzing trace with hash 179478387, now seen corresponding path program 1 times [2022-10-15 16:20:48,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:48,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647226115] [2022-10-15 16:20:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:48,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:48,746 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 16:20:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:48,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647226115] [2022-10-15 16:20:48,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647226115] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:48,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:48,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:20:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294782818] [2022-10-15 16:20:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:48,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:20:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:20:48,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:48,751 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:48,867 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-10-15 16:20:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:48,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 16:20:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:48,870 INFO L225 Difference]: With dead ends: 65 [2022-10-15 16:20:48,870 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 16:20:48,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:20:48,878 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:48,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 16:20:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2022-10-15 16:20:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.542857142857143) internal successors, (54), 47 states have internal predecessors, (54), 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 16:20:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-10-15 16:20:48,896 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 8 [2022-10-15 16:20:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:48,896 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-10-15 16:20:48,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-10-15 16:20:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:20:48,897 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:48,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:48,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:20:48,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash 678597336, now seen corresponding path program 1 times [2022-10-15 16:20:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:48,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008283278] [2022-10-15 16:20:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:48,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:48,965 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 16:20:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:48,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008283278] [2022-10-15 16:20:48,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008283278] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:48,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:48,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:20:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995696615] [2022-10-15 16:20:48,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:48,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:20:48,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:48,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:20:48,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:20:48,969 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 16:20:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:49,053 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-10-15 16:20:49,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:20:49,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 16:20:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:49,055 INFO L225 Difference]: With dead ends: 60 [2022-10-15 16:20:49,056 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 16:20:49,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:20:49,058 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:49,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 45 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 16:20:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-10-15 16:20:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 48 states have internal predecessors, (53), 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 16:20:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-10-15 16:20:49,065 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2022-10-15 16:20:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:49,066 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-10-15 16:20:49,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 16:20:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-10-15 16:20:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:20:49,067 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:49,067 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:49,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:20:49,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 533126947, now seen corresponding path program 1 times [2022-10-15 16:20:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:49,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437222936] [2022-10-15 16:20:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:49,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437222936] [2022-10-15 16:20:49,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437222936] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235107074] [2022-10-15 16:20:49,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:49,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:49,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 16:20:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:49,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:20:49,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:49,726 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:20:49,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 16:20:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:49,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:20:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:50,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235107074] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:20:50,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:20:50,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-15 16:20:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122800126] [2022-10-15 16:20:50,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:20:50,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:20:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:20:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:20:50,421 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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 16:20:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:51,447 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2022-10-15 16:20:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:20:51,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:20:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:51,449 INFO L225 Difference]: With dead ends: 160 [2022-10-15 16:20:51,449 INFO L226 Difference]: Without dead ends: 160 [2022-10-15 16:20:51,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:20:51,451 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:51,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 115 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 16:20:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-10-15 16:20:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 88. [2022-10-15 16:20:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 87 states have internal predecessors, (116), 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 16:20:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2022-10-15 16:20:51,463 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 12 [2022-10-15 16:20:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:51,464 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2022-10-15 16:20:51,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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 16:20:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2022-10-15 16:20:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:20:51,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:51,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:51,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:20:51,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 16:20:51,680 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1232447112, now seen corresponding path program 1 times [2022-10-15 16:20:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:51,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443622511] [2022-10-15 16:20:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:51,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443622511] [2022-10-15 16:20:51,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443622511] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:51,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:51,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:20:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617109844] [2022-10-15 16:20:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:51,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:20:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:20:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:20:51,772 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:20:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:51,801 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-10-15 16:20:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:20:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-10-15 16:20:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:51,804 INFO L225 Difference]: With dead ends: 84 [2022-10-15 16:20:51,804 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 16:20:51,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:20:51,806 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:51,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 35 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:20:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 16:20:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-10-15 16:20:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.4) internal successors, (105), 83 states have internal predecessors, (105), 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 16:20:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-10-15 16:20:51,824 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 14 [2022-10-15 16:20:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:51,825 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-10-15 16:20:51,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:20:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-10-15 16:20:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:20:51,830 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:51,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:51,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:20:51,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:51,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1232447113, now seen corresponding path program 1 times [2022-10-15 16:20:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:51,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734545250] [2022-10-15 16:20:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:52,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734545250] [2022-10-15 16:20:52,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734545250] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:52,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089752883] [2022-10-15 16:20:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:52,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:52,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 16:20:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:52,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:20:52,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:52,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:20:52,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-10-15 16:20:52,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 16:20:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:20:52,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:20:52,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089752883] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:52,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:20:52,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-10-15 16:20:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577656252] [2022-10-15 16:20:52,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:52,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:20:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:20:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:20:52,182 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:20:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:52,230 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-10-15 16:20:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:20:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-10-15 16:20:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:52,232 INFO L225 Difference]: With dead ends: 83 [2022-10-15 16:20:52,232 INFO L226 Difference]: Without dead ends: 83 [2022-10-15 16:20:52,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:20:52,237 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 69 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:52,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 24 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:20:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-15 16:20:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-10-15 16:20:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.36) internal successors, (102), 82 states have internal predecessors, (102), 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 16:20:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2022-10-15 16:20:52,255 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 14 [2022-10-15 16:20:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:52,256 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-10-15 16:20:52,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:20:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-10-15 16:20:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:20:52,258 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:52,258 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:52,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:20:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-10-15 16:20:52,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1312679882, now seen corresponding path program 1 times [2022-10-15 16:20:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:52,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214581178] [2022-10-15 16:20:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:52,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214581178] [2022-10-15 16:20:52,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214581178] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291143954] [2022-10-15 16:20:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:52,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:52,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:52,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:52,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 16:20:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:52,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 16:20:52,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:52,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:20:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291143954] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:20:52,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:20:52,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-10-15 16:20:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861685887] [2022-10-15 16:20:52,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:20:52,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:20:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:20:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:20:52,744 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:52,938 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-10-15 16:20:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:20:52,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-15 16:20:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:52,940 INFO L225 Difference]: With dead ends: 125 [2022-10-15 16:20:52,940 INFO L226 Difference]: Without dead ends: 125 [2022-10-15 16:20:52,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:20:52,941 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 108 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:52,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 78 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:20:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-10-15 16:20:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2022-10-15 16:20:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 76 states have internal predecessors, (90), 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 16:20:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2022-10-15 16:20:52,948 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 18 [2022-10-15 16:20:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:52,948 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2022-10-15 16:20:52,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:20:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-10-15 16:20:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:20:52,949 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:52,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:52,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 16:20:53,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:53,153 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2038414147, now seen corresponding path program 1 times [2022-10-15 16:20:53,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:53,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556543539] [2022-10-15 16:20:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:20:53,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:53,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556543539] [2022-10-15 16:20:53,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556543539] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:20:53,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:20:53,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:20:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654311590] [2022-10-15 16:20:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:53,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:20:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:20:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:20:53,290 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 16:20:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:53,346 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-10-15 16:20:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:20:53,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-10-15 16:20:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:53,348 INFO L225 Difference]: With dead ends: 86 [2022-10-15 16:20:53,348 INFO L226 Difference]: Without dead ends: 86 [2022-10-15 16:20:53,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:20:53,349 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 74 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:53,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:20:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-15 16:20:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2022-10-15 16:20:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 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 16:20:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-10-15 16:20:53,354 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 19 [2022-10-15 16:20:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:53,354 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-10-15 16:20:53,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 16:20:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-10-15 16:20:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:20:53,356 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:53,356 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:53,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:20:53,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:53,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2021769040, now seen corresponding path program 1 times [2022-10-15 16:20:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:53,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503988672] [2022-10-15 16:20:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:53,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:53,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503988672] [2022-10-15 16:20:53,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503988672] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:53,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986900085] [2022-10-15 16:20:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:53,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:53,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:53,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 16:20:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:53,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:20:53,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:53,827 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 16:20:53,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 16:20:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:53,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:20:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:54,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986900085] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:20:54,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:20:54,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-15 16:20:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381551762] [2022-10-15 16:20:54,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:20:54,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:20:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:54,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:20:54,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:20:54,674 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 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 16:20:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:56,783 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2022-10-15 16:20:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:20:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 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 19 [2022-10-15 16:20:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:56,787 INFO L225 Difference]: With dead ends: 244 [2022-10-15 16:20:56,787 INFO L226 Difference]: Without dead ends: 244 [2022-10-15 16:20:56,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:20:56,788 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 470 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:56,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 131 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-15 16:20:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-15 16:20:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 121. [2022-10-15 16:20:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 120 states have internal predecessors, (148), 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 16:20:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2022-10-15 16:20:56,795 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 19 [2022-10-15 16:20:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:56,796 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2022-10-15 16:20:56,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 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 16:20:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2022-10-15 16:20:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:20:56,797 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:56,797 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] [2022-10-15 16:20:56,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-15 16:20:57,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:57,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash 146771774, now seen corresponding path program 1 times [2022-10-15 16:20:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:57,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906078743] [2022-10-15 16:20:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:57,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-15 16:20:57,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889978616] [2022-10-15 16:20:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:57,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:57,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 16:20:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:57,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:20:57,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:57,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:20:57,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-10-15 16:20:57,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 16:20:57,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:20:57,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:20:57,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-15 16:20:57,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-10-15 16:20:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:57,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:20:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:20:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906078743] [2022-10-15 16:20:57,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-15 16:20:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889978616] [2022-10-15 16:20:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889978616] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:57,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:20:57,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-10-15 16:20:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303283437] [2022-10-15 16:20:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:20:57,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:20:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:20:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:20:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:20:57,686 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 16:20:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:20:58,189 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2022-10-15 16:20:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:20:58,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-10-15 16:20:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:20:58,190 INFO L225 Difference]: With dead ends: 133 [2022-10-15 16:20:58,191 INFO L226 Difference]: Without dead ends: 133 [2022-10-15 16:20:58,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:20:58,192 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:20:58,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:20:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-15 16:20:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2022-10-15 16:20:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 120 states have internal predecessors, (147), 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 16:20:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2022-10-15 16:20:58,197 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 22 [2022-10-15 16:20:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:20:58,198 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2022-10-15 16:20:58,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 16:20:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-10-15 16:20:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:20:58,199 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:20:58,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:20:58,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 16:20:58,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-15 16:20:58,409 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:20:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:20:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash 998313161, now seen corresponding path program 1 times [2022-10-15 16:20:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:20:58,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101482380] [2022-10-15 16:20:58,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:20:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:20:58,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101482380] [2022-10-15 16:20:58,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101482380] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:20:58,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019744358] [2022-10-15 16:20:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:20:58,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:20:58,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:20:58,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:20:58,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 16:20:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:20:58,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2022-10-15 16:20:58,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:20:58,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 16:20:58,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-10-15 16:20:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:20:59,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:21:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:21:00,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019744358] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:21:00,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:21:00,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-10-15 16:21:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079391057] [2022-10-15 16:21:00,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:21:00,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 16:21:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:21:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 16:21:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:21:00,180 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:21:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:21:01,646 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2022-10-15 16:21:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 16:21:01,647 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:21:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:21:01,648 INFO L225 Difference]: With dead ends: 157 [2022-10-15 16:21:01,649 INFO L226 Difference]: Without dead ends: 157 [2022-10-15 16:21:01,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2022-10-15 16:21:01,650 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 122 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:21:01,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 160 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 381 Invalid, 0 Unknown, 69 Unchecked, 0.5s Time] [2022-10-15 16:21:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-15 16:21:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 126. [2022-10-15 16:21:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 125 states have internal predecessors, (152), 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 16:21:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2022-10-15 16:21:01,655 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 24 [2022-10-15 16:21:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:21:01,655 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2022-10-15 16:21:01,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:21:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2022-10-15 16:21:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:21:01,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:21:01,657 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, 1, 1, 1] [2022-10-15 16:21:01,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 16:21:01,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:21:01,871 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:21:01,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:21:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2093395598, now seen corresponding path program 1 times [2022-10-15 16:21:01,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:21:01,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322759544] [2022-10-15 16:21:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:21:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:21:01,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-15 16:21:01,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667216764] [2022-10-15 16:21:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:21:01,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:21:01,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:21:01,891 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:21:01,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 16:21:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:21:01,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:21:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:21:01,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:21:01,984 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:21:01,985 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2022-10-15 16:21:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2022-10-15 16:21:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2022-10-15 16:21:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2022-10-15 16:21:01,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2022-10-15 16:21:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2022-10-15 16:21:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2022-10-15 16:21:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2022-10-15 16:21:01,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2022-10-15 16:21:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2022-10-15 16:21:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2022-10-15 16:21:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2022-10-15 16:21:01,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2022-10-15 16:21:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2022-10-15 16:21:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2022-10-15 16:21:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2022-10-15 16:21:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2022-10-15 16:21:01,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2022-10-15 16:21:02,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:21:02,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:21:02,207 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:21:02,212 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:21:02,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:21:02 BoogieIcfgContainer [2022-10-15 16:21:02,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:21:02,286 INFO L158 Benchmark]: Toolchain (without parser) took 15990.23ms. Allocated memory was 164.6MB in the beginning and 253.8MB in the end (delta: 89.1MB). Free memory was 139.1MB in the beginning and 113.2MB in the end (delta: 25.9MB). Peak memory consumption was 115.7MB. Max. memory is 8.0GB. [2022-10-15 16:21:02,286 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 164.6MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:21:02,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.30ms. Allocated memory is still 164.6MB. Free memory was 139.1MB in the beginning and 128.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:21:02,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.01ms. Allocated memory is still 164.6MB. Free memory was 128.6MB in the beginning and 126.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:21:02,290 INFO L158 Benchmark]: Boogie Preprocessor took 31.41ms. Allocated memory is still 164.6MB. Free memory was 126.9MB in the beginning and 125.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:21:02,290 INFO L158 Benchmark]: RCFGBuilder took 694.17ms. Allocated memory is still 164.6MB. Free memory was 125.5MB in the beginning and 110.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 16:21:02,290 INFO L158 Benchmark]: TraceAbstraction took 14882.27ms. Allocated memory was 164.6MB in the beginning and 253.8MB in the end (delta: 89.1MB). Free memory was 109.8MB in the beginning and 113.2MB in the end (delta: -3.5MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. [2022-10-15 16:21:02,293 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.65ms. Allocated memory is still 164.6MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.30ms. Allocated memory is still 164.6MB. Free memory was 139.1MB in the beginning and 128.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.01ms. Allocated memory is still 164.6MB. Free memory was 128.6MB in the beginning and 126.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.41ms. Allocated memory is still 164.6MB. Free memory was 126.9MB in the beginning and 125.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 694.17ms. Allocated memory is still 164.6MB. Free memory was 125.5MB in the beginning and 110.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14882.27ms. Allocated memory was 164.6MB in the beginning and 253.8MB in the end (delta: 89.1MB). Free memory was 109.8MB in the beginning and 113.2MB in the end (delta: -3.5MB). Peak memory consumption was 86.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] long long i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long *b = malloc(sizeof(long long)*N); [L31] i=0 VAL [a={-1:0}, b={-2:0}, i=0, N=1] [L31] COND TRUE i