/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex8.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 18:00:30,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 18:00:30,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 18:00:30,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 18:00:30,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 18:00:30,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 18:00:30,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 18:00:30,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 18:00:30,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 18:00:30,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 18:00:30,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 18:00:30,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 18:00:30,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 18:00:30,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 18:00:30,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 18:00:30,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 18:00:30,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 18:00:30,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 18:00:30,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 18:00:30,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 18:00:30,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 18:00:30,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 18:00:30,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 18:00:30,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 18:00:30,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 18:00:30,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 18:00:30,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 18:00:30,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 18:00:30,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 18:00:30,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 18:00:30,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 18:00:30,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 18:00:30,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 18:00:30,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 18:00:30,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 18:00:30,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 18:00:30,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 18:00:30,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 18:00:30,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 18:00:30,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 18:00:30,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 18:00:30,901 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 18:00:30,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 18:00:30,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 18:00:30,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 18:00:30,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 18:00:30,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 18:00:30,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 18:00:30,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 18:00:30,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 18:00:30,976 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 18:00:30,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 18:00:30,977 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 18:00:30,978 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 18:00:30,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 18:00:30,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 18:00:30,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 18:00:30,978 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 18:00:30,979 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 18:00:30,979 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 18:00:30,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 18:00:30,979 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 18:00:30,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 18:00:30,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 18:00:30,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 18:00:30,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 18:00:30,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 18:00:30,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:00:30,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 18:00:30,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 18:00:30,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 18:00:30,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 18:00:30,983 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 18:00:31,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 18:00:31,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 18:00:31,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 18:00:31,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 18:00:31,520 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 18:00:31,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex8.i [2022-10-15 18:00:31,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3fc4b6b/82daeb595f97453590099865631e3f6a/FLAGb9172a915 [2022-10-15 18:00:32,407 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 18:00:32,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex8.i [2022-10-15 18:00:32,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3fc4b6b/82daeb595f97453590099865631e3f6a/FLAGb9172a915 [2022-10-15 18:00:32,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3fc4b6b/82daeb595f97453590099865631e3f6a [2022-10-15 18:00:32,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 18:00:32,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 18:00:32,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 18:00:32,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 18:00:32,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 18:00:32,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:00:32" (1/1) ... [2022-10-15 18:00:32,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8da61ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:32, skipping insertion in model container [2022-10-15 18:00:32,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:00:32" (1/1) ... [2022-10-15 18:00:32,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 18:00:32,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 18:00:32,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:00:32,979 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 18:00:32,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:00:33,018 INFO L208 MainTranslator]: Completed translation [2022-10-15 18:00:33,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33 WrapperNode [2022-10-15 18:00:33,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 18:00:33,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 18:00:33,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 18:00:33,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 18:00:33,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,066 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2022-10-15 18:00:33,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 18:00:33,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 18:00:33,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 18:00:33,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 18:00:33,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,093 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 18:00:33,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 18:00:33,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 18:00:33,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 18:00:33,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (1/1) ... [2022-10-15 18:00:33,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:00:33,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:00:33,153 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 18:00:33,162 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 18:00:33,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 18:00:33,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 18:00:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-10-15 18:00:33,239 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-10-15 18:00:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-10-15 18:00:33,239 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-10-15 18:00:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 18:00:33,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 18:00:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 18:00:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 18:00:33,390 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 18:00:33,393 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 18:00:33,718 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 18:00:33,739 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 18:00:33,739 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 18:00:33,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:00:33 BoogieIcfgContainer [2022-10-15 18:00:33,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 18:00:33,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 18:00:33,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 18:00:33,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 18:00:33,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:00:32" (1/3) ... [2022-10-15 18:00:33,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63633d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:00:33, skipping insertion in model container [2022-10-15 18:00:33,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:33" (2/3) ... [2022-10-15 18:00:33,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63633d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:00:33, skipping insertion in model container [2022-10-15 18:00:33,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:00:33" (3/3) ... [2022-10-15 18:00:33,784 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex8.i [2022-10-15 18:00:33,848 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 18:00:33,848 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-10-15 18:00:33,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 18:00:33,985 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;@521dbb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 18:00:33,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-10-15 18:00:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 24 states have (on average 1.875) internal successors, (45), 45 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 18:00:34,013 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:34,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 18:00:34,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2022-10-15 18:00:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:34,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221176022] [2022-10-15 18:00:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:34,653 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 18:00:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221176022] [2022-10-15 18:00:34,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221176022] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:34,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:34,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220834226] [2022-10-15 18:00:34,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:34,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:34,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:34,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:34,732 INFO L87 Difference]: Start difference. First operand has 50 states, 24 states have (on average 1.875) internal successors, (45), 45 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:34,897 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-10-15 18:00:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:34,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 18:00:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:34,922 INFO L225 Difference]: With dead ends: 49 [2022-10-15 18:00:34,923 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 18:00:34,927 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 18:00:34,942 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:34,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 18:00:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 18:00:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.826086956521739) internal successors, (42), 42 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-10-15 18:00:35,023 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 3 [2022-10-15 18:00:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:35,024 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-10-15 18:00:35,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-10-15 18:00:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 18:00:35,025 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:35,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 18:00:35,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 18:00:35,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2022-10-15 18:00:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:35,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283621046] [2022-10-15 18:00:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:35,176 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 18:00:35,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:35,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283621046] [2022-10-15 18:00:35,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283621046] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:35,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:35,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495022814] [2022-10-15 18:00:35,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:35,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:35,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:35,183 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:35,274 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-10-15 18:00:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:35,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 18:00:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:35,279 INFO L225 Difference]: With dead ends: 46 [2022-10-15 18:00:35,279 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 18:00:35,280 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 18:00:35,282 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:35,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 18:00:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 18:00:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 41 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-10-15 18:00:35,293 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 3 [2022-10-15 18:00:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:35,294 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-10-15 18:00:35,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-10-15 18:00:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 18:00:35,295 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:35,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 18:00:35,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 18:00:35,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash 63046790, now seen corresponding path program 1 times [2022-10-15 18:00:35,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:35,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685041475] [2022-10-15 18:00:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:35,354 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 18:00:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:35,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685041475] [2022-10-15 18:00:35,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685041475] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:35,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:35,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148996718] [2022-10-15 18:00:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:35,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:35,358 INFO L87 Difference]: Start difference. First operand 46 states and 47 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 18:00:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:35,405 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-10-15 18:00:35,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:35,406 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 18:00:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:35,407 INFO L225 Difference]: With dead ends: 45 [2022-10-15 18:00:35,408 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 18:00:35,408 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 18:00:35,410 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:35,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 18:00:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 18:00:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 40 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-10-15 18:00:35,420 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 5 [2022-10-15 18:00:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:35,421 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-10-15 18:00:35,421 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 18:00:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-10-15 18:00:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 18:00:35,422 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:35,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 18:00:35,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 18:00:35,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 63046791, now seen corresponding path program 1 times [2022-10-15 18:00:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843198569] [2022-10-15 18:00:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:35,525 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 18:00:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:35,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843198569] [2022-10-15 18:00:35,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843198569] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:35,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:35,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170008457] [2022-10-15 18:00:35,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:35,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:35,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:35,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:35,530 INFO L87 Difference]: Start difference. First operand 45 states and 46 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 18:00:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:35,565 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-10-15 18:00:35,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:35,566 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 18:00:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:35,567 INFO L225 Difference]: With dead ends: 44 [2022-10-15 18:00:35,568 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 18:00:35,568 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 18:00:35,570 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:35,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 18:00:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-15 18:00:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 39 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2022-10-15 18:00:35,579 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 5 [2022-10-15 18:00:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:35,579 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2022-10-15 18:00:35,580 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 18:00:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-10-15 18:00:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 18:00:35,581 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:35,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:35,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 18:00:35,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1836583599, now seen corresponding path program 1 times [2022-10-15 18:00:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:35,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120744192] [2022-10-15 18:00:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:35,734 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 18:00:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:35,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120744192] [2022-10-15 18:00:35,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120744192] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:35,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:35,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:00:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031100167] [2022-10-15 18:00:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:35,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:00:35,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:00:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:00:35,739 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:35,905 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-10-15 18:00:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:00:35,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 18:00:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:35,917 INFO L225 Difference]: With dead ends: 66 [2022-10-15 18:00:35,917 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 18:00:35,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:35,925 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:35,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 66 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 18:00:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2022-10-15 18:00:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-15 18:00:35,960 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 9 [2022-10-15 18:00:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:35,962 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-15 18:00:35,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-15 18:00:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 18:00:35,964 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:35,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:35,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 18:00:35,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1836583598, now seen corresponding path program 1 times [2022-10-15 18:00:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:35,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515501411] [2022-10-15 18:00:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:36,232 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 18:00:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:36,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515501411] [2022-10-15 18:00:36,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515501411] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:36,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:36,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 18:00:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744857807] [2022-10-15 18:00:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:36,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 18:00:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 18:00:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:36,236 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:36,373 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-10-15 18:00:36,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:00:36,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 18:00:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:36,375 INFO L225 Difference]: With dead ends: 64 [2022-10-15 18:00:36,375 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 18:00:36,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 18:00:36,377 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:36,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 18:00:36,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-10-15 18:00:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-10-15 18:00:36,386 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 9 [2022-10-15 18:00:36,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:36,387 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-10-15 18:00:36,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-10-15 18:00:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 18:00:36,388 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:36,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:36,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 18:00:36,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:36,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1099516747, now seen corresponding path program 1 times [2022-10-15 18:00:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:36,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754469708] [2022-10-15 18:00:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:36,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:36,540 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 18:00:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:36,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754469708] [2022-10-15 18:00:36,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754469708] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:36,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:36,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:00:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175839409] [2022-10-15 18:00:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:36,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:00:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:36,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:00:36,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:00:36,546 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:36,658 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-10-15 18:00:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:00:36,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 18:00:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:36,661 INFO L225 Difference]: With dead ends: 62 [2022-10-15 18:00:36,661 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 18:00:36,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:36,663 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:36,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 76 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 18:00:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-10-15 18:00:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-10-15 18:00:36,685 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 10 [2022-10-15 18:00:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:36,686 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-10-15 18:00:36,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-10-15 18:00:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 18:00:36,688 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:36,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:36,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 18:00:36,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1099516746, now seen corresponding path program 1 times [2022-10-15 18:00:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632275608] [2022-10-15 18:00:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:36,990 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 18:00:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:36,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632275608] [2022-10-15 18:00:36,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632275608] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:36,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:36,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:00:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3981992] [2022-10-15 18:00:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:36,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:00:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:00:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:00:36,994 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:37,116 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-10-15 18:00:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 18:00:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 18:00:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:37,118 INFO L225 Difference]: With dead ends: 62 [2022-10-15 18:00:37,118 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 18:00:37,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:37,119 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:37,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 97 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 18:00:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-10-15 18:00:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 47 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-10-15 18:00:37,127 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2022-10-15 18:00:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:37,127 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-10-15 18:00:37,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-10-15 18:00:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 18:00:37,128 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:37,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:37,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 18:00:37,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:37,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2012136891, now seen corresponding path program 1 times [2022-10-15 18:00:37,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:37,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071640903] [2022-10-15 18:00:37,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:37,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:37,238 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 18:00:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:37,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071640903] [2022-10-15 18:00:37,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071640903] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:37,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:37,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519005042] [2022-10-15 18:00:37,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:37,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:37,244 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:37,281 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-10-15 18:00:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:37,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 18:00:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:37,283 INFO L225 Difference]: With dead ends: 53 [2022-10-15 18:00:37,283 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 18:00:37,283 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 18:00:37,286 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:37,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 18:00:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-15 18:00:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-10-15 18:00:37,295 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 13 [2022-10-15 18:00:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:37,296 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-10-15 18:00:37,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-10-15 18:00:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 18:00:37,297 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:37,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:37,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 18:00:37,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2012136890, now seen corresponding path program 1 times [2022-10-15 18:00:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:37,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297788050] [2022-10-15 18:00:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:37,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:37,411 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 18:00:37,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:37,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297788050] [2022-10-15 18:00:37,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297788050] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:37,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:37,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411197993] [2022-10-15 18:00:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:37,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:37,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:37,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:37,416 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:37,451 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-10-15 18:00:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 18:00:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:37,453 INFO L225 Difference]: With dead ends: 52 [2022-10-15 18:00:37,453 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 18:00:37,454 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 18:00:37,456 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:37,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 18:00:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 18:00:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.393939393939394) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-10-15 18:00:37,470 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 13 [2022-10-15 18:00:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:37,470 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-10-15 18:00:37,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-10-15 18:00:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 18:00:37,472 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:37,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:37,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 18:00:37,472 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2048280836, now seen corresponding path program 1 times [2022-10-15 18:00:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:37,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103254109] [2022-10-15 18:00:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 18:00:37,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 18:00:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 18:00:37,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 18:00:37,586 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 18:00:37,587 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-10-15 18:00:37,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-10-15 18:00:37,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-10-15 18:00:37,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-10-15 18:00:37,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-10-15 18:00:37,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-10-15 18:00:37,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-10-15 18:00:37,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-10-15 18:00:37,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-10-15 18:00:37,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr8ASSERT_VIOLATIONMEMORY_FREE (10 of 20 remaining) [2022-10-15 18:00:37,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr9ASSERT_VIOLATIONMEMORY_FREE (9 of 20 remaining) [2022-10-15 18:00:37,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2022-10-15 18:00:37,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-10-15 18:00:37,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-10-15 18:00:37,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-10-15 18:00:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-10-15 18:00:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-10-15 18:00:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2022-10-15 18:00:37,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2022-10-15 18:00:37,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 20 remaining) [2022-10-15 18:00:37,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 18:00:37,603 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:37,611 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 18:00:37,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:00:37 BoogieIcfgContainer [2022-10-15 18:00:37,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 18:00:37,654 INFO L158 Benchmark]: Toolchain (without parser) took 4885.24ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 126.4MB in the beginning and 156.8MB in the end (delta: -30.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 18:00:37,655 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 18:00:37,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.22ms. Allocated memory is still 151.0MB. Free memory was 126.1MB in the beginning and 116.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 18:00:37,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.26ms. Allocated memory is still 151.0MB. Free memory was 116.7MB in the beginning and 115.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 18:00:37,665 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 114.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 18:00:37,665 INFO L158 Benchmark]: RCFGBuilder took 640.28ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 100.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 18:00:37,667 INFO L158 Benchmark]: TraceAbstraction took 3901.42ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 99.8MB in the beginning and 156.8MB in the end (delta: -57.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 18:00:37,669 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.30ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.22ms. Allocated memory is still 151.0MB. Free memory was 126.1MB in the beginning and 116.7MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.26ms. Allocated memory is still 151.0MB. Free memory was 116.7MB in the beginning and 115.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 114.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 640.28ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 100.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3901.42ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 99.8MB in the beginning and 156.8MB in the end (delta: -57.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 39]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 39. Possible FailurePath: [L41] int *p1 = malloc(sizeof(int)); [L42] int *p2 = malloc(sizeof(int)); [L44] *p1 = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, p1={-2:0}, p2={-3:0}] [L45] *p2 = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, p1={-2:0}, p2={-3:0}] [L47] CALL f(p1,p2) VAL [p={-2:0}, q={-3:0}] [L13] EXPR \read(*p) VAL [\read(*p)=-1, p={-2:0}, p={-2:0}, q={-3:0}, q={-3:0}] [L13] EXPR \read(*q) VAL [\read(*p)=-1, \read(*q)=0, p={-2:0}, p={-2:0}, q={-3:0}, q={-3:0}] [L13] COND TRUE *p + *q < 0 [L47] RET f(p1,p2) VAL [p1={-2:0}, p2={-3: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: 21]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 704 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 371 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 18:00:37,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...