/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/heap-data/min_max.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:47:00,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:47:00,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:47:00,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:47:00,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:47:00,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:47:00,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:47:00,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:47:00,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:47:00,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:47:00,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:47:00,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:47:00,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:47:00,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:47:00,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:47:00,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:47:00,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:47:00,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:47:00,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:47:00,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:47:00,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:47:00,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:47:00,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:47:00,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:47:00,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:47:00,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:47:00,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:47:00,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:47:00,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:47:00,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:47:00,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:47:00,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:47:00,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:47:00,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:47:00,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:47:00,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:47:00,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:47:00,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:47:00,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:47:00,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:47:00,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:47:00,747 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:47:00,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:47:00,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:47:00,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:47:00,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:47:00,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:47:00,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:47:00,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:47:00,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:47:00,814 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:47:00,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:47:00,815 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:47:00,816 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:47:00,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:47:00,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:47:00,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:47:00,817 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:47:00,817 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:47:00,817 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:47:00,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:47:00,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:47:00,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:47:00,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:47:00,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:47:00,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:47:00,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:47:00,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:00,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:47:00,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:47:00,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:47:00,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:47:00,820 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:47:01,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:47:01,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:47:01,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:47:01,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:47:01,312 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:47:01,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/min_max.i [2022-10-15 16:47:01,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacc7cc21/9980198fc3324ef6952fa0d937862727/FLAGe0c5ad494 [2022-10-15 16:47:02,228 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:47:02,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/min_max.i [2022-10-15 16:47:02,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacc7cc21/9980198fc3324ef6952fa0d937862727/FLAGe0c5ad494 [2022-10-15 16:47:02,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacc7cc21/9980198fc3324ef6952fa0d937862727 [2022-10-15 16:47:02,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:47:02,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:47:02,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:02,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:47:02,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:47:02,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f905a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02, skipping insertion in model container [2022-10-15 16:47:02,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:47:02,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:47:02,886 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/heap-data/min_max.i[23535,23548] [2022-10-15 16:47:02,894 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/heap-data/min_max.i[23590,23603] [2022-10-15 16:47:02,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:02,915 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:47:02,992 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/heap-data/min_max.i[23535,23548] [2022-10-15 16:47:02,993 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/heap-data/min_max.i[23590,23603] [2022-10-15 16:47:03,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:03,039 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:47:03,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03 WrapperNode [2022-10-15 16:47:03,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:03,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:03,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:47:03,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:47:03,051 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:47:03" (1/1) ... [2022-10-15 16:47:03,083 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:47:03" (1/1) ... [2022-10-15 16:47:03,120 INFO L138 Inliner]: procedures = 121, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-10-15 16:47:03,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:03,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:47:03,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:47:03,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:47:03,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,184 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:47:03,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:47:03,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:47:03,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:47:03,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:03,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:03,244 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:47:03,259 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:47:03,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:47:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:47:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:47:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:47:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:47:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:47:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:47:03,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:47:03,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:47:03,464 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:47:03,466 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:47:03,928 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:47:03,945 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:47:03,945 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:47:03,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:03 BoogieIcfgContainer [2022-10-15 16:47:03,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:47:03,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:47:03,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:47:03,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:47:03,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:47:02" (1/3) ... [2022-10-15 16:47:03,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2aab2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:03, skipping insertion in model container [2022-10-15 16:47:03,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (2/3) ... [2022-10-15 16:47:03,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2aab2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:03, skipping insertion in model container [2022-10-15 16:47:03,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:03" (3/3) ... [2022-10-15 16:47:03,967 INFO L112 eAbstractionObserver]: Analyzing ICFG min_max.i [2022-10-15 16:47:03,995 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:47:03,996 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-10-15 16:47:04,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:47:04,101 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;@38f4e3ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:47:04,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-10-15 16:47:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 49 states have internal predecessors, (57), 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:47:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:04,132 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:04,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 28695846, now seen corresponding path program 1 times [2022-10-15 16:47:04,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147391611] [2022-10-15 16:47:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:04,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:04,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147391611] [2022-10-15 16:47:04,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147391611] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:04,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:04,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140293006] [2022-10-15 16:47:04,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:04,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:04,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:04,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:04,643 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 49 states have internal predecessors, (57), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:04,806 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-10-15 16:47:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:04,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:04,822 INFO L225 Difference]: With dead ends: 68 [2022-10-15 16:47:04,822 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 16:47:04,825 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:47:04,834 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:04,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 16:47:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2022-10-15 16:47:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 41 states have internal predecessors, (45), 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:47:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-10-15 16:47:04,891 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 5 [2022-10-15 16:47:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:04,892 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-10-15 16:47:04,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-10-15 16:47:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:04,893 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:04,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:47:04,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2022-10-15 16:47:04,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539255619] [2022-10-15 16:47:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,102 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:47:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539255619] [2022-10-15 16:47:05,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539255619] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113360661] [2022-10-15 16:47:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:05,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:05,108 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,165 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-10-15 16:47:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:05,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,167 INFO L225 Difference]: With dead ends: 58 [2022-10-15 16:47:05,168 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 16:47:05,168 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:47:05,170 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 64 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 16:47:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2022-10-15 16:47:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 35 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:47:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-10-15 16:47:05,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 5 [2022-10-15 16:47:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,178 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-10-15 16:47:05,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-10-15 16:47:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:47:05,179 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:47:05,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1806881100, now seen corresponding path program 1 times [2022-10-15 16:47:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217505495] [2022-10-15 16:47:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,211 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:47:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217505495] [2022-10-15 16:47:05,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217505495] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287816021] [2022-10-15 16:47:05,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:05,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:05,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:05,215 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,251 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-10-15 16:47:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:47:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,254 INFO L225 Difference]: With dead ends: 57 [2022-10-15 16:47:05,254 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 16:47:05,254 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:47:05,257 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 16:47:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2022-10-15 16:47:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-10-15 16:47:05,267 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 7 [2022-10-15 16:47:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,268 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-10-15 16:47:05,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-10-15 16:47:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:47:05,269 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:47:05,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1806881134, now seen corresponding path program 1 times [2022-10-15 16:47:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194283840] [2022-10-15 16:47:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,352 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:47:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194283840] [2022-10-15 16:47:05,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194283840] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167251818] [2022-10-15 16:47:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:05,358 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,432 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-10-15 16:47:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 16:47:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,435 INFO L225 Difference]: With dead ends: 44 [2022-10-15 16:47:05,438 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 16:47:05,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:05,440 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 16:47:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-10-15 16:47:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-10-15 16:47:05,459 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 7 [2022-10-15 16:47:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,459 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-10-15 16:47:05,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-10-15 16:47:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:47:05,463 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,464 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:47:05,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1655573109, now seen corresponding path program 1 times [2022-10-15 16:47:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268638564] [2022-10-15 16:47:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268638564] [2022-10-15 16:47:05,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268638564] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:47:05,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947306357] [2022-10-15 16:47:05,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:47:05,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:47:05,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:05,635 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,748 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-10-15 16:47:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:47:05,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:47:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,755 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:47:05,755 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:47:05,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:05,763 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 55 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:47:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-10-15 16:47:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.4) internal successors, (42), 38 states have internal predecessors, (42), 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:47:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-10-15 16:47:05,774 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 17 [2022-10-15 16:47:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,775 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-10-15 16:47:05,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-10-15 16:47:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:47:05,776 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,776 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:47:05,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1655573075, now seen corresponding path program 1 times [2022-10-15 16:47:05,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327141716] [2022-10-15 16:47:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327141716] [2022-10-15 16:47:05,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327141716] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:47:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383117336] [2022-10-15 16:47:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:47:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:47:05,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:05,956 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,045 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-10-15 16:47:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:47:06,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:47:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,047 INFO L225 Difference]: With dead ends: 43 [2022-10-15 16:47:06,047 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 16:47:06,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:06,049 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 78 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 37 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 16:47:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-10-15 16:47:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 37 states have internal predecessors, (42), 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:47:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-10-15 16:47:06,055 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2022-10-15 16:47:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,056 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-10-15 16:47:06,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-10-15 16:47:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:47:06,057 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,057 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:06,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:47:06,058 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:06,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1655573074, now seen corresponding path program 1 times [2022-10-15 16:47:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846076513] [2022-10-15 16:47:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846076513] [2022-10-15 16:47:06,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846076513] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:47:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168638602] [2022-10-15 16:47:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:47:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:47:06,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:06,311 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,428 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-10-15 16:47:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:47:06,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:47:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,431 INFO L225 Difference]: With dead ends: 50 [2022-10-15 16:47:06,431 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 16:47:06,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:06,438 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 106 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 16:47:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-10-15 16:47:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-10-15 16:47:06,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 17 [2022-10-15 16:47:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,461 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-10-15 16:47:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-10-15 16:47:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:47:06,466 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,466 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:06,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:47:06,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash 686646865, now seen corresponding path program 1 times [2022-10-15 16:47:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608041240] [2022-10-15 16:47:06,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608041240] [2022-10-15 16:47:06,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608041240] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:47:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082277099] [2022-10-15 16:47:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:47:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:47:06,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:06,821 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:47:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,956 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-10-15 16:47:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:47:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:47:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,957 INFO L225 Difference]: With dead ends: 55 [2022-10-15 16:47:06,957 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 16:47:06,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:47:06,960 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 95 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 48 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 16:47:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-10-15 16:47:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.302325581395349) internal successors, (56), 49 states have internal predecessors, (56), 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:47:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-10-15 16:47:06,977 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2022-10-15 16:47:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,977 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-10-15 16:47:06,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:47:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-10-15 16:47:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 16:47:06,985 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,986 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:06,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:47:06,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1557326160, now seen corresponding path program 1 times [2022-10-15 16:47:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820795941] [2022-10-15 16:47:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820795941] [2022-10-15 16:47:07,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820795941] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 16:47:07,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563475744] [2022-10-15 16:47:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:47:07,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:47:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:47:07,472 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,627 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-10-15 16:47:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:47:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 16:47:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,629 INFO L225 Difference]: With dead ends: 84 [2022-10-15 16:47:07,629 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 16:47:07,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:47:07,633 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 117 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 115 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 16:47:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2022-10-15 16:47:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-10-15 16:47:07,654 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 21 [2022-10-15 16:47:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,655 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-10-15 16:47:07,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-10-15 16:47:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 16:47:07,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,657 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:47:07,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash 576002256, now seen corresponding path program 1 times [2022-10-15 16:47:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877562370] [2022-10-15 16:47:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877562370] [2022-10-15 16:47:08,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877562370] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:47:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337912712] [2022-10-15 16:47:08,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:47:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:47:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:47:08,137 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,284 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-10-15 16:47:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:47:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 16:47:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,287 INFO L225 Difference]: With dead ends: 63 [2022-10-15 16:47:08,287 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 16:47:08,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:47:08,290 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 74 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 99 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 16:47:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2022-10-15 16:47:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-15 16:47:08,294 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 21 [2022-10-15 16:47:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,294 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-15 16:47:08,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-15 16:47:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:47:08,296 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,296 INFO L195 NwaCegarLoop]: trace histogram [2, 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:47:08,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:47:08,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:08,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1941694350, now seen corresponding path program 1 times [2022-10-15 16:47:08,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:08,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656512519] [2022-10-15 16:47:08,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:08,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:08,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656512519] [2022-10-15 16:47:08,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656512519] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:47:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50489068] [2022-10-15 16:47:08,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:47:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:47:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:47:08,739 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,987 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-10-15 16:47:08,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:47:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 16:47:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,989 INFO L225 Difference]: With dead ends: 78 [2022-10-15 16:47:08,989 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 16:47:08,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:47:08,991 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 112 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 130 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 16:47:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2022-10-15 16:47:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 57 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:47:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-10-15 16:47:08,996 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 23 [2022-10-15 16:47:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,996 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-10-15 16:47:08,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-10-15 16:47:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:47:08,998 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,998 INFO L195 NwaCegarLoop]: trace histogram [2, 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:47:08,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:47:08,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash -512486766, now seen corresponding path program 1 times [2022-10-15 16:47:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:09,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653871458] [2022-10-15 16:47:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:09,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:09,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653871458] [2022-10-15 16:47:09,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653871458] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:09,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:09,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 16:47:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971328927] [2022-10-15 16:47:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:09,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 16:47:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 16:47:09,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:47:09,523 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:09,788 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-10-15 16:47:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:47:09,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 16:47:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:09,789 INFO L225 Difference]: With dead ends: 78 [2022-10-15 16:47:09,789 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 16:47:09,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:47:09,791 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 78 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:09,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 203 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 16:47:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2022-10-15 16:47:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.255813953488372) internal successors, (54), 49 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:47:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-10-15 16:47:09,795 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 23 [2022-10-15 16:47:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:09,796 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-10-15 16:47:09,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-10-15 16:47:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:47:09,798 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:09,798 INFO L195 NwaCegarLoop]: trace histogram [2, 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:47:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:47:09,799 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 16:47:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -392911742, now seen corresponding path program 1 times [2022-10-15 16:47:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:09,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849462453] [2022-10-15 16:47:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:47:09,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:47:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:47:09,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:47:09,900 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:47:09,902 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (20 of 21 remaining) [2022-10-15 16:47:09,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-10-15 16:47:09,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-10-15 16:47:09,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-10-15 16:47:09,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-10-15 16:47:09,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-10-15 16:47:09,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-10-15 16:47:09,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-10-15 16:47:09,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-10-15 16:47:09,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-10-15 16:47:09,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-10-15 16:47:09,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-10-15 16:47:09,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-10-15 16:47:09,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-10-15 16:47:09,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-10-15 16:47:09,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (5 of 21 remaining) [2022-10-15 16:47:09,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2022-10-15 16:47:09,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2022-10-15 16:47:09,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (2 of 21 remaining) [2022-10-15 16:47:09,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2022-10-15 16:47:09,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2022-10-15 16:47:09,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:47:09,924 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:09,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:47:09,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:47:09 BoogieIcfgContainer [2022-10-15 16:47:09,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:47:09,991 INFO L158 Benchmark]: Toolchain (without parser) took 7508.12ms. Allocated memory was 163.6MB in the beginning and 208.7MB in the end (delta: 45.1MB). Free memory was 137.1MB in the beginning and 117.8MB in the end (delta: 19.4MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2022-10-15 16:47:09,991 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory was 133.2MB in the beginning and 133.1MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:47:09,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.40ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 120.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 16:47:09,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.08ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 118.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:47:09,993 INFO L158 Benchmark]: Boogie Preprocessor took 71.18ms. Allocated memory is still 163.6MB. Free memory was 118.9MB in the beginning and 117.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:47:09,993 INFO L158 Benchmark]: RCFGBuilder took 756.80ms. Allocated memory is still 163.6MB. Free memory was 117.4MB in the beginning and 139.5MB in the end (delta: -22.1MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-10-15 16:47:09,994 INFO L158 Benchmark]: TraceAbstraction took 6034.47ms. Allocated memory was 163.6MB in the beginning and 208.7MB in the end (delta: 45.1MB). Free memory was 139.0MB in the beginning and 117.8MB in the end (delta: 21.3MB). Peak memory consumption was 67.9MB. Max. memory is 8.0GB. [2022-10-15 16:47:09,996 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.19ms. Allocated memory is still 163.6MB. Free memory was 133.2MB in the beginning and 133.1MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 550.40ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 120.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.08ms. Allocated memory is still 163.6MB. Free memory was 120.8MB in the beginning and 118.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.18ms. Allocated memory is still 163.6MB. Free memory was 118.9MB in the beginning and 117.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 756.80ms. Allocated memory is still 163.6MB. Free memory was 117.4MB in the beginning and 139.5MB in the end (delta: -22.1MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6034.47ms. Allocated memory was 163.6MB in the beginning and 208.7MB in the end (delta: 45.1MB). Free memory was 139.0MB in the beginning and 117.8MB in the end (delta: 21.3MB). Peak memory consumption was 67.9MB. 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: 572]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 572. Possible FailurePath: [L573] Node *l = ((void *)0); [L574] int min = 0x7fffffff, max = -0x7fffffff; VAL [l={0:0}, max=-2147483647, min=2147483647] [L575] COND TRUE __VERIFIER_nondet_int() [L576] Node *p = malloc(sizeof(*p)); [L577] p->val = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=2147483647, l={0:0}, max=-2147483647, min=2147483647, p={-1:0}] [L578] p->next=l VAL [l={0:0}, max=-2147483647, min=2147483647, p={-1:0}] [L578] l=p VAL [l={-1:0}, max=-2147483647, min=2147483647, p={-1:0}] [L579] EXPR p->val VAL [l={-1:0}, max=-2147483647, min=2147483647, p={-1:0}, p->val=2147483647] [L579] COND FALSE !(min > p->val) [L582] EXPR p->val VAL [l={-1:0}, max=-2147483647, min=2147483647, p={-1:0}, p->val=2147483647] [L582] COND TRUE max < p->val [L583] EXPR p->val VAL [l={-1:0}, max=-2147483647, min=2147483647, p={-1:0}, p->val=2147483647] [L583] max = p->val [L575] COND FALSE !(__VERIFIER_nondet_int()) [L586] Node *i = l; VAL [i={-1:0}, l={-1:0}, max=2147483647, min=2147483647, p={-1:0}] [L587] COND TRUE i != ((void *)0) VAL [i={-1:0}, l={-1:0}, max=2147483647, min=2147483647, p={-1:0}] [L588] EXPR i->val VAL [i={-1:0}, i->val=2147483647, l={-1:0}, max=2147483647, min=2147483647, p={-1:0}] [L588] COND FALSE !(i->val < min) [L590] EXPR i->val VAL [i={-1:0}, i->val=2147483647, l={-1:0}, max=2147483647, min=2147483647, p={-1:0}] [L590] COND FALSE !(i->val > max) [L592] EXPR i->next VAL [i={-1:0}, i->next={0:0}, l={-1:0}, max=2147483647, min=2147483647, p={-1:0}] [L592] i = i->next [L587] COND FALSE !(i != ((void *)0)) VAL [i={0:0}, l={-1:0}, max=2147483647, min=2147483647, p={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 735 mSDsluCounter, 1073 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 693 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 925 IncrementalHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 380 mSDtfsCounter, 925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 177 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:47:10,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...