/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-dietlibc/atoll.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:55:19,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:55:19,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:55:19,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:55:19,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:55:19,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:55:19,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:55:19,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:55:19,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:55:19,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:55:19,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:55:19,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:55:19,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:55:19,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:55:19,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:55:19,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:55:19,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:55:19,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:55:19,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:55:19,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:55:19,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:55:19,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:55:19,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:55:19,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:55:19,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:55:19,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:55:19,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:55:19,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:55:19,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:55:19,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:55:19,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:55:19,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:55:19,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:55:19,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:55:19,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:55:19,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:55:19,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:55:19,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:55:19,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:55:19,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:55:19,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:55:19,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:55:19,923 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:55:19,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:55:19,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:55:19,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:55:19,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:55:19,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:55:19,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:55:19,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:55:19,929 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:55:19,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:55:19,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:55:19,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:55:19,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:55:19,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:55:19,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:55:19,931 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:55:19,931 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:55:19,931 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:55:19,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:55:19,932 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:55:19,932 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:55:19,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:55:19,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:55:19,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:55:19,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:55:19,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:19,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:55:19,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:55:19,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:55:19,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:55:19,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:55:20,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:55:20,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:55:20,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:55:20,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:55:20,373 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:55:20,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/atoll.i [2022-10-15 17:55:20,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654ea9392/cc54eaa212234661b39c51bf0561794e/FLAG401ce274d [2022-10-15 17:55:21,091 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:55:21,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/atoll.i [2022-10-15 17:55:21,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654ea9392/cc54eaa212234661b39c51bf0561794e/FLAG401ce274d [2022-10-15 17:55:21,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654ea9392/cc54eaa212234661b39c51bf0561794e [2022-10-15 17:55:21,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:55:21,411 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:55:21,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:21,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:55:21,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:55:21,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:21" (1/1) ... [2022-10-15 17:55:21,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1452c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:21, skipping insertion in model container [2022-10-15 17:55:21,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:21" (1/1) ... [2022-10-15 17:55:21,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:55:21,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:55:21,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:21,978 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:55:22,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:22,088 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:55:22,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22 WrapperNode [2022-10-15 17:55:22,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:22,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:22,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:55:22,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:55:22,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,144 INFO L138 Inliner]: procedures = 112, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2022-10-15 17:55:22,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:22,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:55:22,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:55:22,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:55:22,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,171 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:55:22,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:55:22,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:55:22,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:55:22,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (1/1) ... [2022-10-15 17:55:22,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:22,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:22,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:55:22,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:55:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:55:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:55:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:55:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:55:22,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:55:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:55:22,366 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:55:22,369 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:55:22,671 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:55:22,678 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:55:22,679 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:55:22,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:22 BoogieIcfgContainer [2022-10-15 17:55:22,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:55:22,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:55:22,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:55:22,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:55:22,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:55:21" (1/3) ... [2022-10-15 17:55:22,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a0c078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:22, skipping insertion in model container [2022-10-15 17:55:22,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:22" (2/3) ... [2022-10-15 17:55:22,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a0c078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:22, skipping insertion in model container [2022-10-15 17:55:22,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:22" (3/3) ... [2022-10-15 17:55:22,691 INFO L112 eAbstractionObserver]: Analyzing ICFG atoll.i [2022-10-15 17:55:22,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:55:22,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-10-15 17:55:22,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:55:22,825 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;@58688506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:55:22,825 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-10-15 17:55:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:22,837 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:22,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:22,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:22,846 INFO L85 PathProgramCache]: Analyzing trace with hash 925683, now seen corresponding path program 1 times [2022-10-15 17:55:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:22,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053347296] [2022-10-15 17:55:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:23,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:23,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053347296] [2022-10-15 17:55:23,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053347296] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:23,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:23,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578495352] [2022-10-15 17:55:23,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:23,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:23,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:23,080 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:23,133 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-10-15 17:55:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:55:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:23,147 INFO L225 Difference]: With dead ends: 41 [2022-10-15 17:55:23,147 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:55:23,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:23,154 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:23,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:55:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:55:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.72) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-10-15 17:55:23,196 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 4 [2022-10-15 17:55:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:23,197 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-10-15 17:55:23,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-10-15 17:55:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:23,198 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:23,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:23,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:55:23,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-10-15 17:55:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:23,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093359846] [2022-10-15 17:55:23,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093359846] [2022-10-15 17:55:23,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093359846] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:23,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:23,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314533232] [2022-10-15 17:55:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:23,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:23,391 INFO L87 Difference]: Start difference. First operand 38 states and 43 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-15 17:55:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:23,421 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-10-15 17:55:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:55:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:23,423 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:55:23,423 INFO L226 Difference]: Without dead ends: 37 [2022-10-15 17:55:23,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:23,425 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:23,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-10-15 17:55:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-10-15 17:55:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.68) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-10-15 17:55:23,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 4 [2022-10-15 17:55:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:23,433 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-10-15 17:55:23,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-10-15 17:55:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:23,434 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:23,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:23,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:55:23,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-10-15 17:55:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:23,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899105201] [2022-10-15 17:55:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:23,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:23,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899105201] [2022-10-15 17:55:23,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899105201] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:23,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:23,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389259759] [2022-10-15 17:55:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:23,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:23,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:23,623 INFO L87 Difference]: Start difference. First operand 37 states and 42 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-15 17:55:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:23,675 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-10-15 17:55:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:23,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:55:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:23,679 INFO L225 Difference]: With dead ends: 36 [2022-10-15 17:55:23,679 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:55:23,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:23,681 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:23,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:55:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:55:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.64) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-10-15 17:55:23,692 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 4 [2022-10-15 17:55:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:23,693 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-10-15 17:55:23,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-10-15 17:55:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:55:23,694 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:23,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:55:23,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:55:23,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:23,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash 889567306, now seen corresponding path program 1 times [2022-10-15 17:55:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:23,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97541145] [2022-10-15 17:55:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:23,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97541145] [2022-10-15 17:55:23,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97541145] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:23,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:23,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330337737] [2022-10-15 17:55:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:23,822 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-15 17:55:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:23,909 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-10-15 17:55:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-15 17:55:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:23,914 INFO L225 Difference]: With dead ends: 31 [2022-10-15 17:55:23,914 INFO L226 Difference]: Without dead ends: 31 [2022-10-15 17:55:23,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:23,925 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:23,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 20 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-10-15 17:55:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-10-15 17:55:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-10-15 17:55:23,937 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 6 [2022-10-15 17:55:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:23,939 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-10-15 17:55:23,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-15 17:55:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-10-15 17:55:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:55:23,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:23,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:55:23,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:55:23,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash 889567307, now seen corresponding path program 1 times [2022-10-15 17:55:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:23,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061728309] [2022-10-15 17:55:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061728309] [2022-10-15 17:55:24,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061728309] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:24,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:24,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871031136] [2022-10-15 17:55:24,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:24,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:55:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:24,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:55:24,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:24,115 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-15 17:55:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:24,191 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-10-15 17:55:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-15 17:55:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:24,193 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:55:24,193 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 17:55:24,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:55:24,195 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 104 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:24,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 56 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 17:55:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-10-15 17:55:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.4) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-10-15 17:55:24,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 6 [2022-10-15 17:55:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:24,207 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-10-15 17:55:24,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-15 17:55:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-10-15 17:55:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 17:55:24,208 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:24,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:24,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:55:24,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash 175688932, now seen corresponding path program 1 times [2022-10-15 17:55:24,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:24,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754957338] [2022-10-15 17:55:24,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:24,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:24,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754957338] [2022-10-15 17:55:24,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754957338] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:24,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578638590] [2022-10-15 17:55:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:24,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:24,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:24,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:24,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:55:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:24,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2022-10-15 17:55:24,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:24,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:55:24,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:24,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-10-15 17:55:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:25,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:25,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-10-15 17:55:25,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-10-15 17:55:25,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-10-15 17:55:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:25,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578638590] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:25,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:25,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-10-15 17:55:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049176219] [2022-10-15 17:55:25,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:25,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 17:55:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 17:55:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-10-15 17:55:25,323 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:25,592 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-10-15 17:55:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:55:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 17:55:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:25,594 INFO L225 Difference]: With dead ends: 67 [2022-10-15 17:55:25,594 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 17:55:25,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-10-15 17:55:25,596 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 44 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:25,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 332 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-10-15 17:55:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 17:55:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 36. [2022-10-15 17:55:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.34375) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-10-15 17:55:25,602 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 8 [2022-10-15 17:55:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:25,602 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-10-15 17:55:25,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-10-15 17:55:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:55:25,604 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:25,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:25,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:25,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 17:55:25,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1333337917, now seen corresponding path program 2 times [2022-10-15 17:55:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:25,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776923913] [2022-10-15 17:55:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:26,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:26,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776923913] [2022-10-15 17:55:26,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776923913] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:26,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943822604] [2022-10-15 17:55:26,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:55:26,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:26,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:26,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:55:26,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:55:26,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:55:26,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 17:55:26,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:26,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:26,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:55:26,655 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:26,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-10-15 17:55:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:26,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:27,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-10-15 17:55:27,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-10-15 17:55:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:27,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943822604] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:27,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:27,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-10-15 17:55:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937138527] [2022-10-15 17:55:27,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:27,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-15 17:55:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-15 17:55:27,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-10-15 17:55:27,194 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:27,641 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-10-15 17:55:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:55:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 17:55:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:27,643 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:55:27,643 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:55:27,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:55:27,644 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:27,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 276 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-10-15 17:55:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:55:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 17:55:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.3125) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-10-15 17:55:27,649 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 10 [2022-10-15 17:55:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:27,650 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-10-15 17:55:27,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-10-15 17:55:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:55:27,651 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:27,651 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:27,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-15 17:55:27,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-15 17:55:27,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1437482787, now seen corresponding path program 1 times [2022-10-15 17:55:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:27,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109518492] [2022-10-15 17:55:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 17:55:27,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:27,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109518492] [2022-10-15 17:55:27,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109518492] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:27,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:27,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269839579] [2022-10-15 17:55:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:27,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:27,901 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:27,919 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-10-15 17:55:27,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:55:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:27,922 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:55:27,922 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:27,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:27,924 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:27,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-10-15 17:55:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-10-15 17:55:27,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2022-10-15 17:55:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:27,937 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-10-15 17:55:27,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-10-15 17:55:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 17:55:27,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:27,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:27,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:55:27,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash 640034076, now seen corresponding path program 1 times [2022-10-15 17:55:27,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:27,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330574209] [2022-10-15 17:55:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:27,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:28,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330574209] [2022-10-15 17:55:28,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330574209] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:28,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:28,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:55:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686349568] [2022-10-15 17:55:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:28,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 17:55:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 17:55:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:55:28,281 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:28,522 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-10-15 17:55:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:55:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 17:55:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:28,526 INFO L225 Difference]: With dead ends: 80 [2022-10-15 17:55:28,526 INFO L226 Difference]: Without dead ends: 80 [2022-10-15 17:55:28,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-10-15 17:55:28,527 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 273 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:28,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 122 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-15 17:55:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 47. [2022-10-15 17:55:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-10-15 17:55:28,533 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 14 [2022-10-15 17:55:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:28,534 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-10-15 17:55:28,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-10-15 17:55:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 17:55:28,535 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:28,535 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:28,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:55:28,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:28,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -836005707, now seen corresponding path program 1 times [2022-10-15 17:55:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:28,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70262443] [2022-10-15 17:55:28,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:28,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70262443] [2022-10-15 17:55:28,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70262443] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670862452] [2022-10-15 17:55:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:28,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:28,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:28,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:29,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:55:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:29,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-15 17:55:29,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:29,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:29,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:55:29,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:29,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-10-15 17:55:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:29,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:55:29,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670862452] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:29,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:55:29,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 18 [2022-10-15 17:55:29,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545637934] [2022-10-15 17:55:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:29,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 17:55:29,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 17:55:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-10-15 17:55:29,564 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-15 17:55:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:29,686 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-10-15 17:55:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:55:29,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-15 17:55:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:29,690 INFO L225 Difference]: With dead ends: 77 [2022-10-15 17:55:29,690 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 17:55:29,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-10-15 17:55:29,691 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:29,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 365 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-10-15 17:55:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 17:55:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 39. [2022-10-15 17:55:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-10-15 17:55:29,696 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 16 [2022-10-15 17:55:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:29,696 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-10-15 17:55:29,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-15 17:55:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-10-15 17:55:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:55:29,700 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:29,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:29,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:29,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:29,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1942978704, now seen corresponding path program 1 times [2022-10-15 17:55:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:29,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404405536] [2022-10-15 17:55:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404405536] [2022-10-15 17:55:29,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404405536] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:29,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:29,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:29,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009501056] [2022-10-15 17:55:29,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:29,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:29,936 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:29,944 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-10-15 17:55:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:29,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:55:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:29,945 INFO L225 Difference]: With dead ends: 41 [2022-10-15 17:55:29,945 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 17:55:29,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:29,946 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 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-15 17:55:29,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 17:55:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-10-15 17:55:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-10-15 17:55:29,951 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2022-10-15 17:55:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:29,951 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-10-15 17:55:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-10-15 17:55:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 17:55:29,952 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:29,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:29,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:55:29,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:29,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash 101229444, now seen corresponding path program 1 times [2022-10-15 17:55:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:29,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401676601] [2022-10-15 17:55:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:30,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401676601] [2022-10-15 17:55:30,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401676601] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:30,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:30,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666276984] [2022-10-15 17:55:30,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:30,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:30,072 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:30,087 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-10-15 17:55:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:30,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 17:55:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:30,088 INFO L225 Difference]: With dead ends: 39 [2022-10-15 17:55:30,088 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:30,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:30,089 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:30,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 17:55:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-10-15 17:55:30,097 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2022-10-15 17:55:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:30,097 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-10-15 17:55:30,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-10-15 17:55:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:55:30,101 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:30,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:30,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:55:30,102 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1833340365, now seen corresponding path program 1 times [2022-10-15 17:55:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:30,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652015290] [2022-10-15 17:55:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:30,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:30,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652015290] [2022-10-15 17:55:30,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652015290] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:30,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785086605] [2022-10-15 17:55:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:30,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:30,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:30,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:55:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:30,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-15 17:55:30,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:30,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:30,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 17:55:30,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:30,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-10-15 17:55:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:31,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:31,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-10-15 17:55:31,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-10-15 17:55:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:31,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785086605] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:31,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:31,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-10-15 17:55:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201007093] [2022-10-15 17:55:31,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:31,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-15 17:55:31,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:31,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-15 17:55:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2022-10-15 17:55:31,732 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:33,151 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-10-15 17:55:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-15 17:55:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:55:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:33,152 INFO L225 Difference]: With dead ends: 100 [2022-10-15 17:55:33,152 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:55:33,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=524, Invalid=1638, Unknown=0, NotChecked=0, Total=2162 [2022-10-15 17:55:33,157 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 358 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:33,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 162 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 221 Invalid, 0 Unknown, 6 Unchecked, 0.2s Time] [2022-10-15 17:55:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:55:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:55:33,160 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-15 17:55:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:55:33,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-10-15 17:55:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:33,161 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:55:33,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:55:33,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:55:33,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2022-10-15 17:55:33,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2022-10-15 17:55:33,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-10-15 17:55:33,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-10-15 17:55:33,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-10-15 17:55:33,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-10-15 17:55:33,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-10-15 17:55:33,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-10-15 17:55:33,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2022-10-15 17:55:33,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2022-10-15 17:55:33,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2022-10-15 17:55:33,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2022-10-15 17:55:33,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-10-15 17:55:33,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:33,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:33,386 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:33,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:55:33,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:55:33 BoogieIcfgContainer [2022-10-15 17:55:33,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:55:33,392 INFO L158 Benchmark]: Toolchain (without parser) took 11986.41ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 124.1MB in the beginning and 168.1MB in the end (delta: -44.0MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2022-10-15 17:55:33,392 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:55:33,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.16ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 108.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 17:55:33,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.05ms. Allocated memory is still 151.0MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:55:33,394 INFO L158 Benchmark]: Boogie Preprocessor took 30.54ms. Allocated memory is still 151.0MB. Free memory was 106.7MB in the beginning and 105.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:55:33,394 INFO L158 Benchmark]: RCFGBuilder took 505.60ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 129.0MB in the end (delta: -23.8MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-10-15 17:55:33,394 INFO L158 Benchmark]: TraceAbstraction took 10707.49ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 128.5MB in the beginning and 168.1MB in the end (delta: -39.6MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2022-10-15 17:55:33,396 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.21ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 674.16ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 108.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.05ms. Allocated memory is still 151.0MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.54ms. Allocated memory is still 151.0MB. Free memory was 106.7MB in the beginning and 105.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 505.60ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 129.0MB in the end (delta: -23.8MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10707.49ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 128.5MB in the beginning and 168.1MB in the end (delta: -39.6MB). Peak memory consumption was 29.1MB. 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: 519]: 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, 40 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1005 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1005 mSDsluCounter, 1591 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 153 IncrementalHoareTripleChecker+Unchecked, 1179 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 412 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=9, InterpolantAutomatonStates: 90, 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, 13 MinimizatonAttempts, 114 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 223 ConstructedInterpolants, 24 QuantifiedInterpolants, 2946 SizeOfPredicates, 39 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 10/29 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-15 17:55:33,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...