/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 04:38:10,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 04:38:10,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 04:38:10,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 04:38:10,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 04:38:10,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 04:38:10,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 04:38:10,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 04:38:10,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 04:38:10,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 04:38:10,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 04:38:10,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 04:38:10,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 04:38:10,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 04:38:10,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 04:38:10,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 04:38:10,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 04:38:10,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 04:38:10,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 04:38:10,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 04:38:10,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 04:38:10,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 04:38:10,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 04:38:10,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 04:38:10,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 04:38:10,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 04:38:10,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 04:38:10,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 04:38:10,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 04:38:10,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 04:38:10,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 04:38:10,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 04:38:10,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 04:38:10,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 04:38:10,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 04:38:10,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 04:38:10,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 04:38:10,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 04:38:10,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 04:38:10,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 04:38:10,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 04:38:10,968 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-16 04:38:11,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 04:38:11,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 04:38:11,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 04:38:11,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 04:38:11,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 04:38:11,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 04:38:11,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 04:38:11,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 04:38:11,033 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 04:38:11,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 04:38:11,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 04:38:11,034 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 04:38:11,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 04:38:11,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 04:38:11,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 04:38:11,035 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 04:38:11,035 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 04:38:11,035 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 04:38:11,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 04:38:11,036 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 04:38:11,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 04:38:11,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 04:38:11,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 04:38:11,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 04:38:11,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 04:38:11,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:38:11,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 04:38:11,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 04:38:11,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 04:38:11,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 04:38:11,038 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-16 04:38:11,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 04:38:11,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 04:38:11,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 04:38:11,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 04:38:11,482 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 04:38:11,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca.i [2022-10-16 04:38:11,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fc6ec76/ee1a5ed9518e4f7792c1fa68845317dd/FLAG58040554b [2022-10-16 04:38:12,299 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 04:38:12,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca.i [2022-10-16 04:38:12,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fc6ec76/ee1a5ed9518e4f7792c1fa68845317dd/FLAG58040554b [2022-10-16 04:38:12,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fc6ec76/ee1a5ed9518e4f7792c1fa68845317dd [2022-10-16 04:38:12,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 04:38:12,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 04:38:12,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 04:38:12,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 04:38:12,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 04:38:12,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:38:12" (1/1) ... [2022-10-16 04:38:12,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ec9f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:12, skipping insertion in model container [2022-10-16 04:38:12,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:38:12" (1/1) ... [2022-10-16 04:38:12,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 04:38:12,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 04:38:12,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:38:12,971 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 04:38:13,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:38:13,095 INFO L208 MainTranslator]: Completed translation [2022-10-16 04:38:13,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13 WrapperNode [2022-10-16 04:38:13,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 04:38:13,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 04:38:13,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 04:38:13,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 04:38:13,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,171 INFO L138 Inliner]: procedures = 109, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-10-16 04:38:13,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 04:38:13,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 04:38:13,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 04:38:13,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 04:38:13,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,199 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 04:38:13,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 04:38:13,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 04:38:13,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 04:38:13,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (1/1) ... [2022-10-16 04:38:13,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:38:13,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:38:13,247 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-16 04:38:13,254 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-16 04:38:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 04:38:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 04:38:13,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 04:38:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 04:38:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 04:38:13,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 04:38:13,440 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 04:38:13,443 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 04:38:13,923 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 04:38:13,938 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 04:38:13,941 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 04:38:13,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:38:13 BoogieIcfgContainer [2022-10-16 04:38:13,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 04:38:13,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 04:38:13,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 04:38:13,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 04:38:13,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:38:12" (1/3) ... [2022-10-16 04:38:13,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e314923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:38:13, skipping insertion in model container [2022-10-16 04:38:13,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:13" (2/3) ... [2022-10-16 04:38:13,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e314923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:38:13, skipping insertion in model container [2022-10-16 04:38:13,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:38:13" (3/3) ... [2022-10-16 04:38:13,961 INFO L112 eAbstractionObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig7-alloca.i [2022-10-16 04:38:13,990 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 04:38:13,990 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-10-16 04:38:14,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 04:38:14,063 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;@5c4a2537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 04:38:14,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-10-16 04:38:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 60 states have internal predecessors, (63), 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-16 04:38:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 04:38:14,076 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:14,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 04:38:14,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-16 04:38:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:14,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085230612] [2022-10-16 04:38:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:15,287 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-16 04:38:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:15,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085230612] [2022-10-16 04:38:15,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085230612] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:15,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:15,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770304882] [2022-10-16 04:38:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:15,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:15,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:15,343 INFO L87 Difference]: Start difference. First operand has 61 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:15,424 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-10-16 04:38:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:15,427 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-16 04:38:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:15,438 INFO L225 Difference]: With dead ends: 57 [2022-10-16 04:38:15,439 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 04:38:15,441 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-16 04:38:15,446 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:15,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 28 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 04:38:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-10-16 04:38:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 28 states have (on average 2.0) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-10-16 04:38:15,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 3 [2022-10-16 04:38:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:15,514 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-10-16 04:38:15,514 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-16 04:38:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-10-16 04:38:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 04:38:15,515 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:15,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 04:38:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 04:38:15,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-16 04:38:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:15,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836734492] [2022-10-16 04:38:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:15,917 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-16 04:38:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:15,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836734492] [2022-10-16 04:38:15,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836734492] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:15,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:15,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770773731] [2022-10-16 04:38:15,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:15,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:15,922 INFO L87 Difference]: Start difference. First operand 55 states and 56 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-16 04:38:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:15,972 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-10-16 04:38:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:15,972 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-16 04:38:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:15,974 INFO L225 Difference]: With dead ends: 51 [2022-10-16 04:38:15,974 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 04:38:15,975 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-16 04:38:15,977 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:15,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 04:38:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-10-16 04:38:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 50 states have internal predecessors, (52), 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-16 04:38:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-10-16 04:38:15,985 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 3 [2022-10-16 04:38:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:15,986 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-10-16 04:38:15,986 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-16 04:38:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-10-16 04:38:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 04:38:15,987 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:15,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 04:38:15,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 04:38:15,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:15,989 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-10-16 04:38:15,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:15,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447642446] [2022-10-16 04:38:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:15,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:16,547 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-16 04:38:16,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:16,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447642446] [2022-10-16 04:38:16,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447642446] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:16,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:16,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202225562] [2022-10-16 04:38:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:38:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:38:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:16,552 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:16,639 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-10-16 04:38:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:16,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-16 04:38:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:16,642 INFO L225 Difference]: With dead ends: 50 [2022-10-16 04:38:16,642 INFO L226 Difference]: Without dead ends: 50 [2022-10-16 04:38:16,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:16,648 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:16,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-16 04:38:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-16 04:38:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2022-10-16 04:38:16,663 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 4 [2022-10-16 04:38:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:16,663 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-10-16 04:38:16,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-10-16 04:38:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 04:38:16,664 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:16,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 04:38:16,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 04:38:16,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-10-16 04:38:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:16,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824050322] [2022-10-16 04:38:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:17,248 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-16 04:38:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:17,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824050322] [2022-10-16 04:38:17,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824050322] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:17,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:17,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324850851] [2022-10-16 04:38:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:17,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:17,253 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:17,311 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-10-16 04:38:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-16 04:38:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:17,314 INFO L225 Difference]: With dead ends: 49 [2022-10-16 04:38:17,314 INFO L226 Difference]: Without dead ends: 49 [2022-10-16 04:38:17,315 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-16 04:38:17,323 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 26 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-16 04:38:17,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 26 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-16 04:38:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-16 04:38:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 48 states have internal predecessors, (50), 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-16 04:38:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-10-16 04:38:17,334 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 4 [2022-10-16 04:38:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:17,335 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-10-16 04:38:17,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-10-16 04:38:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 04:38:17,338 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:17,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 04:38:17,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 04:38:17,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-10-16 04:38:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:17,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979483271] [2022-10-16 04:38:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:17,545 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-16 04:38:17,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:17,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979483271] [2022-10-16 04:38:17,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979483271] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:17,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:17,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38178875] [2022-10-16 04:38:17,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:17,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:17,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:17,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:17,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:17,551 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 04:38:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:17,612 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-10-16 04:38:17,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:17,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-16 04:38:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:17,615 INFO L225 Difference]: With dead ends: 45 [2022-10-16 04:38:17,615 INFO L226 Difference]: Without dead ends: 45 [2022-10-16 04:38:17,618 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-16 04:38:17,622 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:17,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-16 04:38:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-16 04:38:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 44 states have internal predecessors, (46), 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-16 04:38:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-10-16 04:38:17,632 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 6 [2022-10-16 04:38:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:17,632 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-10-16 04:38:17,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 04:38:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-10-16 04:38:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 04:38:17,633 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:17,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 04:38:17,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 04:38:17,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-10-16 04:38:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:17,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451060564] [2022-10-16 04:38:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:17,936 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-16 04:38:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:17,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451060564] [2022-10-16 04:38:17,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451060564] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:17,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:17,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784321443] [2022-10-16 04:38:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:17,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:17,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:17,941 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 04:38:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:17,983 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-10-16 04:38:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-16 04:38:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:17,988 INFO L225 Difference]: With dead ends: 41 [2022-10-16 04:38:17,988 INFO L226 Difference]: Without dead ends: 41 [2022-10-16 04:38:17,989 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-16 04:38:17,992 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:17,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-16 04:38:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-10-16 04:38:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.5) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-10-16 04:38:18,012 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 6 [2022-10-16 04:38:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:18,012 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-10-16 04:38:18,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-16 04:38:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-10-16 04:38:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 04:38:18,014 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:18,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:18,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 04:38:18,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026919, now seen corresponding path program 1 times [2022-10-16 04:38:18,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:18,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189995964] [2022-10-16 04:38:18,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:18,496 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-16 04:38:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:18,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189995964] [2022-10-16 04:38:18,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189995964] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:18,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:18,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954304788] [2022-10-16 04:38:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:18,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:38:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:38:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:18,500 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:18,556 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-10-16 04:38:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 04:38:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:18,557 INFO L225 Difference]: With dead ends: 40 [2022-10-16 04:38:18,559 INFO L226 Difference]: Without dead ends: 40 [2022-10-16 04:38:18,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:18,564 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:18,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 19 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-16 04:38:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-16 04:38:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-10-16 04:38:18,574 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 7 [2022-10-16 04:38:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:18,575 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-10-16 04:38:18,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-10-16 04:38:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 04:38:18,575 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:18,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:18,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 04:38:18,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026920, now seen corresponding path program 1 times [2022-10-16 04:38:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:18,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324501777] [2022-10-16 04:38:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:18,958 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-16 04:38:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:18,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324501777] [2022-10-16 04:38:18,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324501777] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:18,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:18,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322770970] [2022-10-16 04:38:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:18,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:18,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:18,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:18,962 INFO L87 Difference]: Start difference. First operand 40 states and 41 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-16 04:38:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:19,001 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-10-16 04:38:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:19,005 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-16 04:38:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:19,005 INFO L225 Difference]: With dead ends: 39 [2022-10-16 04:38:19,006 INFO L226 Difference]: Without dead ends: 39 [2022-10-16 04:38:19,006 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-16 04:38:19,007 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:19,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-16 04:38:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-16 04:38:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 38 states have internal predecessors, (40), 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-16 04:38:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-10-16 04:38:19,012 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 7 [2022-10-16 04:38:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:19,014 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-10-16 04:38:19,014 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-16 04:38:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-10-16 04:38:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 04:38:19,015 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:19,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:19,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 04:38:19,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1837048424, now seen corresponding path program 1 times [2022-10-16 04:38:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479323042] [2022-10-16 04:38:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:19,256 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-16 04:38:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:19,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479323042] [2022-10-16 04:38:19,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479323042] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:19,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:19,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132774917] [2022-10-16 04:38:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:19,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:19,260 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-16 04:38:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:19,305 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-10-16 04:38:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-10-16 04:38:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:19,307 INFO L225 Difference]: With dead ends: 36 [2022-10-16 04:38:19,307 INFO L226 Difference]: Without dead ends: 36 [2022-10-16 04:38:19,308 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-16 04:38:19,311 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:19,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-16 04:38:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-16 04:38:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 35 states have internal predecessors, (37), 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-16 04:38:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-10-16 04:38:19,326 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 9 [2022-10-16 04:38:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:19,326 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-10-16 04:38:19,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-16 04:38:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-10-16 04:38:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 04:38:19,328 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:19,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 04:38:19,329 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1837048425, now seen corresponding path program 1 times [2022-10-16 04:38:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:19,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021001708] [2022-10-16 04:38:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:19,882 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-16 04:38:19,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:19,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021001708] [2022-10-16 04:38:19,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021001708] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:19,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:19,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:19,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122890130] [2022-10-16 04:38:19,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:19,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:38:19,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:19,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:38:19,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:19,885 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-16 04:38:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:19,956 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-10-16 04:38:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:19,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-10-16 04:38:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:19,958 INFO L225 Difference]: With dead ends: 33 [2022-10-16 04:38:19,958 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 04:38:19,958 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-16 04:38:19,959 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:19,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 04:38:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-16 04:38:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-10-16 04:38:19,966 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 9 [2022-10-16 04:38:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:19,966 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-10-16 04:38:19,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-16 04:38:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-10-16 04:38:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 04:38:19,967 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:19,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:19,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 04:38:19,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash 171976619, now seen corresponding path program 1 times [2022-10-16 04:38:19,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:19,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660571162] [2022-10-16 04:38:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:20,132 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-16 04:38:20,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:20,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660571162] [2022-10-16 04:38:20,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660571162] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:20,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:20,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695288117] [2022-10-16 04:38:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:20,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:20,135 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-16 04:38:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:20,164 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-10-16 04:38:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:20,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-10-16 04:38:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:20,166 INFO L225 Difference]: With dead ends: 32 [2022-10-16 04:38:20,166 INFO L226 Difference]: Without dead ends: 32 [2022-10-16 04:38:20,166 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-16 04:38:20,167 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:20,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 15 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-16 04:38:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-10-16 04:38:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 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-16 04:38:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-10-16 04:38:20,172 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 11 [2022-10-16 04:38:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:20,173 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-10-16 04:38:20,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-16 04:38:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-10-16 04:38:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 04:38:20,174 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:20,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:20,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 04:38:20,175 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 171976620, now seen corresponding path program 1 times [2022-10-16 04:38:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:20,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407743897] [2022-10-16 04:38:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:20,480 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-16 04:38:20,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:20,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407743897] [2022-10-16 04:38:20,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407743897] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:20,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:20,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220960041] [2022-10-16 04:38:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:20,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:20,483 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-16 04:38:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:20,504 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-10-16 04:38:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:20,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-10-16 04:38:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:20,505 INFO L225 Difference]: With dead ends: 31 [2022-10-16 04:38:20,505 INFO L226 Difference]: Without dead ends: 31 [2022-10-16 04:38:20,506 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-16 04:38:20,507 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:20,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-10-16 04:38:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-10-16 04:38:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 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-16 04:38:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-10-16 04:38:20,511 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 11 [2022-10-16 04:38:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:20,512 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-10-16 04:38:20,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-16 04:38:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-10-16 04:38:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 04:38:20,513 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:20,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:20,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 04:38:20,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:20,514 INFO L85 PathProgramCache]: Analyzing trace with hash 423521715, now seen corresponding path program 1 times [2022-10-16 04:38:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:20,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136139823] [2022-10-16 04:38:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:20,672 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-16 04:38:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136139823] [2022-10-16 04:38:20,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136139823] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:20,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:20,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:20,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124941953] [2022-10-16 04:38:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:20,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:20,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:20,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:20,676 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-16 04:38:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:20,703 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-10-16 04:38:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 04:38:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:20,705 INFO L225 Difference]: With dead ends: 30 [2022-10-16 04:38:20,705 INFO L226 Difference]: Without dead ends: 30 [2022-10-16 04:38:20,705 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-16 04:38:20,707 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:20,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-16 04:38:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-16 04:38:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 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-16 04:38:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-10-16 04:38:20,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 15 [2022-10-16 04:38:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:20,720 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-10-16 04:38:20,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-16 04:38:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-10-16 04:38:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 04:38:20,722 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:20,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:20,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 04:38:20,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash 423521716, now seen corresponding path program 1 times [2022-10-16 04:38:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:20,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821393208] [2022-10-16 04:38:20,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:20,858 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-16 04:38:20,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:20,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821393208] [2022-10-16 04:38:20,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821393208] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:20,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:20,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449959711] [2022-10-16 04:38:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:20,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:20,862 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-16 04:38:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:20,882 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-10-16 04:38:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-16 04:38:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:20,884 INFO L225 Difference]: With dead ends: 29 [2022-10-16 04:38:20,884 INFO L226 Difference]: Without dead ends: 29 [2022-10-16 04:38:20,884 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-16 04:38:20,885 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:20,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 16 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-16 04:38:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-16 04:38:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 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-16 04:38:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-10-16 04:38:20,889 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 15 [2022-10-16 04:38:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:20,890 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-10-16 04:38:20,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-16 04:38:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-10-16 04:38:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 04:38:20,891 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:20,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:20,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 04:38:20,891 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:20,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash 244222403, now seen corresponding path program 1 times [2022-10-16 04:38:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:20,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926031077] [2022-10-16 04:38:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:20,944 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-16 04:38:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:20,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926031077] [2022-10-16 04:38:20,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926031077] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:20,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:20,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122136874] [2022-10-16 04:38:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:20,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:20,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:20,947 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 04:38:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:20,959 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-10-16 04:38:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-10-16 04:38:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:20,960 INFO L225 Difference]: With dead ends: 30 [2022-10-16 04:38:20,960 INFO L226 Difference]: Without dead ends: 30 [2022-10-16 04:38:20,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:20,964 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:20,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-16 04:38:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-16 04:38:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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-16 04:38:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-10-16 04:38:20,968 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 16 [2022-10-16 04:38:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:20,969 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-10-16 04:38:20,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 04:38:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-10-16 04:38:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 04:38:20,970 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:20,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:20,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 04:38:20,971 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-16 04:38:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1411387928, now seen corresponding path program 1 times [2022-10-16 04:38:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:20,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849249460] [2022-10-16 04:38:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:22,948 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-16 04:38:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:22,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849249460] [2022-10-16 04:38:22,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849249460] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:22,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:22,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998142561] [2022-10-16 04:38:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:22,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:38:22,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:38:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:22,951 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:23,045 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-10-16 04:38:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:38:23,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 04:38:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:23,047 INFO L225 Difference]: With dead ends: 29 [2022-10-16 04:38:23,047 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 04:38:23,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:23,048 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:23,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 04:38:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 04:38:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 04:38:23,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-10-16 04:38:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:23,050 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 04:38:23,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 04:38:23,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 04:38:23,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-10-16 04:38:23,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-10-16 04:38:23,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-10-16 04:38:23,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-10-16 04:38:23,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-10-16 04:38:23,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-10-16 04:38:23,056 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-10-16 04:38:23,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-10-16 04:38:23,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-10-16 04:38:23,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-10-16 04:38:23,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-10-16 04:38:23,058 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-10-16 04:38:23,058 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-10-16 04:38:23,058 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-10-16 04:38:23,059 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-10-16 04:38:23,059 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-10-16 04:38:23,059 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-10-16 04:38:23,059 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-10-16 04:38:23,059 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-10-16 04:38:23,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-10-16 04:38:23,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-10-16 04:38:23,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-10-16 04:38:23,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-10-16 04:38:23,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-10-16 04:38:23,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-10-16 04:38:23,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-10-16 04:38:23,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-10-16 04:38:23,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-10-16 04:38:23,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-10-16 04:38:23,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-10-16 04:38:23,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-10-16 04:38:23,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 04:38:23,067 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:23,070 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 04:38:23,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:38:23 BoogieIcfgContainer [2022-10-16 04:38:23,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 04:38:23,076 INFO L158 Benchmark]: Toolchain (without parser) took 10484.80ms. Allocated memory was 158.3MB in the beginning and 283.1MB in the end (delta: 124.8MB). Free memory was 131.4MB in the beginning and 194.5MB in the end (delta: -63.1MB). Peak memory consumption was 62.6MB. Max. memory is 8.0GB. [2022-10-16 04:38:23,076 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 158.3MB. Free memory was 129.1MB in the beginning and 129.0MB in the end (delta: 80.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 04:38:23,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.26ms. Allocated memory is still 158.3MB. Free memory was 131.2MB in the beginning and 116.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-16 04:38:23,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.28ms. Allocated memory is still 158.3MB. Free memory was 116.0MB in the beginning and 114.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 04:38:23,078 INFO L158 Benchmark]: Boogie Preprocessor took 30.91ms. Allocated memory is still 158.3MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 04:38:23,078 INFO L158 Benchmark]: RCFGBuilder took 741.81ms. Allocated memory is still 158.3MB. Free memory was 112.9MB in the beginning and 130.7MB in the end (delta: -17.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 04:38:23,079 INFO L158 Benchmark]: TraceAbstraction took 9125.20ms. Allocated memory was 158.3MB in the beginning and 283.1MB in the end (delta: 124.8MB). Free memory was 130.2MB in the beginning and 194.5MB in the end (delta: -64.3MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. [2022-10-16 04:38:23,081 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.27ms. Allocated memory is still 158.3MB. Free memory was 129.1MB in the beginning and 129.0MB in the end (delta: 80.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.26ms. Allocated memory is still 158.3MB. Free memory was 131.2MB in the beginning and 116.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.28ms. Allocated memory is still 158.3MB. Free memory was 116.0MB in the beginning and 114.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.91ms. Allocated memory is still 158.3MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 741.81ms. Allocated memory is still 158.3MB. Free memory was 112.9MB in the beginning and 130.7MB in the end (delta: -17.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9125.20ms. Allocated memory was 158.3MB in the beginning and 283.1MB in the end (delta: 124.8MB). Free memory was 130.2MB in the beginning and 194.5MB in the end (delta: -64.3MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 559 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 369 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 317 mSDtfsCounter, 369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 49, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 2411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-16 04:38:23,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...