/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_ex11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 18:00:21,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 18:00:21,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 18:00:21,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 18:00:21,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 18:00:21,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 18:00:21,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 18:00:21,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 18:00:21,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 18:00:21,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 18:00:21,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 18:00:21,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 18:00:21,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 18:00:21,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 18:00:21,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 18:00:21,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 18:00:21,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 18:00:21,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 18:00:21,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 18:00:21,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 18:00:21,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 18:00:21,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 18:00:21,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 18:00:21,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 18:00:21,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 18:00:21,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 18:00:21,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 18:00:21,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 18:00:21,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 18:00:21,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 18:00:21,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 18:00:21,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 18:00:21,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 18:00:21,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 18:00:21,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 18:00:21,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 18:00:21,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 18:00:21,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 18:00:21,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 18:00:21,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 18:00:21,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 18:00:21,883 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:21,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 18:00:21,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 18:00:21,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 18:00:21,912 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 18:00:21,913 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 18:00:21,913 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 18:00:21,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 18:00:21,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 18:00:21,914 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 18:00:21,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 18:00:21,914 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 18:00:21,915 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 18:00:21,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 18:00:21,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 18:00:21,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 18:00:21,915 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 18:00:21,916 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 18:00:21,916 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 18:00:21,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 18:00:21,916 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 18:00:21,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 18:00:21,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 18:00:21,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 18:00:21,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 18:00:21,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 18:00:21,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:00:21,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 18:00:21,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 18:00:21,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 18:00:21,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 18:00:21,918 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:22,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 18:00:22,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 18:00:22,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 18:00:22,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 18:00:22,313 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 18:00:22,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.i [2022-10-15 18:00:22,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d315d34/8f3dd59dc7f34248a8b9cb40d01559f3/FLAG384b7637f [2022-10-15 18:00:23,064 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 18:00:23,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.i [2022-10-15 18:00:23,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d315d34/8f3dd59dc7f34248a8b9cb40d01559f3/FLAG384b7637f [2022-10-15 18:00:23,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d315d34/8f3dd59dc7f34248a8b9cb40d01559f3 [2022-10-15 18:00:23,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 18:00:23,432 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 18:00:23,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 18:00:23,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 18:00:23,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 18:00:23,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8826df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23, skipping insertion in model container [2022-10-15 18:00:23,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 18:00:23,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 18:00:23,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:00:23,660 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 18:00:23,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:00:23,696 INFO L208 MainTranslator]: Completed translation [2022-10-15 18:00:23,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23 WrapperNode [2022-10-15 18:00:23,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 18:00:23,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 18:00:23,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 18:00:23,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 18:00:23,711 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:23" (1/1) ... [2022-10-15 18:00:23,725 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:23" (1/1) ... [2022-10-15 18:00:23,749 INFO L138 Inliner]: procedures = 11, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-10-15 18:00:23,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 18:00:23,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 18:00:23,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 18:00:23,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 18:00:23,762 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:23" (1/1) ... [2022-10-15 18:00:23,763 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:23" (1/1) ... [2022-10-15 18:00:23,765 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:23" (1/1) ... [2022-10-15 18:00:23,765 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:23" (1/1) ... [2022-10-15 18:00:23,789 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:23" (1/1) ... [2022-10-15 18:00:23,801 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:23" (1/1) ... [2022-10-15 18:00:23,802 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:23" (1/1) ... [2022-10-15 18:00:23,807 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:23" (1/1) ... [2022-10-15 18:00:23,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 18:00:23,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 18:00:23,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 18:00:23,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 18:00:23,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:00:23,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:00:23,853 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:23,866 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:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 18:00:23,913 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-10-15 18:00:23,914 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-10-15 18:00:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 18:00:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 18:00:23,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 18:00:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 18:00:23,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 18:00:23,996 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 18:00:23,999 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 18:00:24,392 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 18:00:24,405 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 18:00:24,405 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 18:00:24,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:00:24 BoogieIcfgContainer [2022-10-15 18:00:24,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 18:00:24,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 18:00:24,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 18:00:24,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 18:00:24,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:00:23" (1/3) ... [2022-10-15 18:00:24,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e49cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:00:24, skipping insertion in model container [2022-10-15 18:00:24,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (2/3) ... [2022-10-15 18:00:24,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e49cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:00:24, skipping insertion in model container [2022-10-15 18:00:24,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:00:24" (3/3) ... [2022-10-15 18:00:24,419 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex11.i [2022-10-15 18:00:24,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 18:00:24,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-10-15 18:00:24,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 18:00:24,576 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;@34ba5469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 18:00:24,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-10-15 18:00:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 18:00:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 18:00:24,613 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:24,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 18:00:24,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 18:00:24,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 63619, now seen corresponding path program 1 times [2022-10-15 18:00:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:24,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404003817] [2022-10-15 18:00:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:24,914 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:24,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:24,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404003817] [2022-10-15 18:00:24,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404003817] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:24,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:24,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:24,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910777598] [2022-10-15 18:00:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:24,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:24,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:24,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:24,967 INFO L87 Difference]: Start difference. First operand has 70 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,112 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-10-15 18:00:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:25,118 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:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,133 INFO L225 Difference]: With dead ends: 70 [2022-10-15 18:00:25,134 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 18:00:25,139 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:25,145 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 81 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 18:00:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-10-15 18:00:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 18:00:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-10-15 18:00:25,214 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 3 [2022-10-15 18:00:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,214 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-10-15 18:00:25,214 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:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-10-15 18:00:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 18:00:25,215 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 18:00:25,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 18:00:25,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 18:00:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash 63620, now seen corresponding path program 1 times [2022-10-15 18:00:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:25,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241527358] [2022-10-15 18:00:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:25,367 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:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241527358] [2022-10-15 18:00:25,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241527358] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:25,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:25,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029415069] [2022-10-15 18:00:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:25,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:25,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:25,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:25,373 INFO L87 Difference]: Start difference. First operand 64 states and 68 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:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,485 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-10-15 18:00:25,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:25,486 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:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,489 INFO L225 Difference]: With dead ends: 81 [2022-10-15 18:00:25,490 INFO L226 Difference]: Without dead ends: 81 [2022-10-15 18:00:25,490 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:25,492 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-10-15 18:00:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2022-10-15 18:00:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 67 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 18:00:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-10-15 18:00:25,506 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 3 [2022-10-15 18:00:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,507 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-10-15 18:00:25,507 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:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-10-15 18:00:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 18:00:25,508 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:25,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 18:00:25,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 18:00:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1375746615, now seen corresponding path program 1 times [2022-10-15 18:00:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:25,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432441904] [2022-10-15 18:00:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:25,658 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:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432441904] [2022-10-15 18:00:25,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432441904] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:25,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:25,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709926258] [2022-10-15 18:00:25,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:25,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:25,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:25,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:25,665 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,749 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-10-15 18:00:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:25,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 18:00:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,753 INFO L225 Difference]: With dead ends: 71 [2022-10-15 18:00:25,753 INFO L226 Difference]: Without dead ends: 71 [2022-10-15 18:00:25,753 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:25,758 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-10-15 18:00:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-10-15 18:00:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.697674418604651) internal successors, (73), 65 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 18:00:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2022-10-15 18:00:25,781 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 7 [2022-10-15 18:00:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,784 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2022-10-15 18:00:25,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-10-15 18:00:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 18:00:25,785 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:25,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 18:00:25,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 18:00:25,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1375746614, now seen corresponding path program 1 times [2022-10-15 18:00:25,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:25,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125012515] [2022-10-15 18:00:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:26,026 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:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125012515] [2022-10-15 18:00:26,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125012515] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:26,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:26,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:26,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961384727] [2022-10-15 18:00:26,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:26,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:26,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:26,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:26,031 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:26,071 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-10-15 18:00:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 18:00:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:26,074 INFO L225 Difference]: With dead ends: 69 [2022-10-15 18:00:26,074 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 18:00:26,074 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:26,076 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:26,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 98 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 18:00:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-10-15 18:00:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 18:00:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-10-15 18:00:26,087 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 7 [2022-10-15 18:00:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:26,087 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-10-15 18:00:26,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-10-15 18:00:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 18:00:26,088 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:26,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 18:00:26,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 18:00:26,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 301526988, now seen corresponding path program 1 times [2022-10-15 18:00:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25969760] [2022-10-15 18:00:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:26,139 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:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:26,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25969760] [2022-10-15 18:00:26,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25969760] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:26,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:26,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245385267] [2022-10-15 18:00:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:26,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:26,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:26,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:26,143 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:26,174 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-10-15 18:00:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:26,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 18:00:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:26,176 INFO L225 Difference]: With dead ends: 66 [2022-10-15 18:00:26,177 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 18:00:26,177 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:26,179 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 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:26,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 79 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:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 18:00:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-10-15 18:00:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 18:00:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-10-15 18:00:26,189 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 8 [2022-10-15 18:00:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:26,190 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-10-15 18:00:26,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-10-15 18:00:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 18:00:26,191 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:26,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 18:00:26,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 18:00:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2004630415, now seen corresponding path program 1 times [2022-10-15 18:00:26,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257401177] [2022-10-15 18:00:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:26,368 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:26,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:26,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257401177] [2022-10-15 18:00:26,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257401177] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:26,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:26,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 18:00:26,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354661393] [2022-10-15 18:00:26,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:26,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 18:00:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 18:00:26,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 18:00:26,372 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:26,466 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-10-15 18:00:26,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 18:00:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 18:00:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:26,468 INFO L225 Difference]: With dead ends: 69 [2022-10-15 18:00:26,468 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 18:00:26,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:00:26,470 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:26,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 18:00:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-15 18:00:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 61 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 18:00:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-10-15 18:00:26,480 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 10 [2022-10-15 18:00:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:26,480 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-10-15 18:00:26,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-10-15 18:00:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 18:00:26,482 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:26,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 18:00:26,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 18:00:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2041705573, now seen corresponding path program 1 times [2022-10-15 18:00:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468859979] [2022-10-15 18:00:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 18:00:26,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 18:00:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 18:00:26,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 18:00:26,537 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 18:00:26,539 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 30 remaining) [2022-10-15 18:00:26,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2022-10-15 18:00:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2022-10-15 18:00:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2022-10-15 18:00:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2022-10-15 18:00:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr4ASSERT_VIOLATIONMEMORY_FREE (24 of 30 remaining) [2022-10-15 18:00:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr5ASSERT_VIOLATIONMEMORY_FREE (23 of 30 remaining) [2022-10-15 18:00:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr6ASSERT_VIOLATIONMEMORY_FREE (22 of 30 remaining) [2022-10-15 18:00:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2022-10-15 18:00:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2022-10-15 18:00:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2022-10-15 18:00:26,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2022-10-15 18:00:26,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr11ASSERT_VIOLATIONMEMORY_FREE (17 of 30 remaining) [2022-10-15 18:00:26,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr12ASSERT_VIOLATIONMEMORY_FREE (16 of 30 remaining) [2022-10-15 18:00:26,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location recErr13ASSERT_VIOLATIONMEMORY_FREE (15 of 30 remaining) [2022-10-15 18:00:26,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2022-10-15 18:00:26,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2022-10-15 18:00:26,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2022-10-15 18:00:26,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2022-10-15 18:00:26,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2022-10-15 18:00:26,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2022-10-15 18:00:26,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2022-10-15 18:00:26,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2022-10-15 18:00:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2022-10-15 18:00:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2022-10-15 18:00:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2022-10-15 18:00:26,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2022-10-15 18:00:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (2 of 30 remaining) [2022-10-15 18:00:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (1 of 30 remaining) [2022-10-15 18:00:26,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (0 of 30 remaining) [2022-10-15 18:00:26,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 18:00:26,555 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,561 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 18:00:26,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:00:26 BoogieIcfgContainer [2022-10-15 18:00:26,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 18:00:26,592 INFO L158 Benchmark]: Toolchain (without parser) took 3165.15ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 125.3MB in the beginning and 153.8MB in the end (delta: -28.5MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2022-10-15 18:00:26,593 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 18:00:26,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.81ms. Allocated memory is still 151.0MB. Free memory was 125.1MB in the beginning and 115.8MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 18:00:26,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.19ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 114.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 18:00:26,595 INFO L158 Benchmark]: Boogie Preprocessor took 59.29ms. Allocated memory is still 151.0MB. Free memory was 114.3MB in the beginning and 113.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 18:00:26,595 INFO L158 Benchmark]: RCFGBuilder took 595.14ms. Allocated memory is still 151.0MB. Free memory was 113.0MB in the beginning and 98.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 18:00:26,596 INFO L158 Benchmark]: TraceAbstraction took 2180.50ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 97.7MB in the beginning and 153.8MB in the end (delta: -56.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 18:00:26,598 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.23ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.81ms. Allocated memory is still 151.0MB. Free memory was 125.1MB in the beginning and 115.8MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.19ms. Allocated memory is still 151.0MB. Free memory was 115.8MB in the beginning and 114.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.29ms. Allocated memory is still 151.0MB. Free memory was 114.3MB in the beginning and 113.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 595.14ms. Allocated memory is still 151.0MB. Free memory was 113.0MB in the beginning and 98.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2180.50ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 97.7MB in the beginning and 153.8MB in the end (delta: -56.1MB). 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: 24]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 24. Possible FailurePath: [L25] int *qq = malloc(sizeof(int)); [L26] *qq = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=2, qq={-2:0}] [L28] EXPR \read(*qq) VAL [\read(*qq)=2, qq={-2:0}] [L28] COND TRUE *qq > 1 [L29] int *pp = malloc(sizeof(int)); [L30] *pp = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, pp={-3:0}, qq={-2:0}] [L32] EXPR \read(*pp) VAL [\read(*pp)=-1, pp={-3:0}, qq={-2:0}] [L32] COND TRUE *pp < 0 [L33] return 0; VAL [\result=0, pp={-3:0}, qq={-2: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: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: 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: 17]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 17]: 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. - 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: 39]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 568 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 203 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 341 mSDtfsCounter, 203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=2, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:26,652 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...